slib.graph.algo.extraction.rvf

Class RVF_TAX

java.lang.Object

slib.graph.algo.extraction.rvf.RVF

slib.graph.algo.extraction.rvf.RVF_DAG

slib.graph.algo.extraction.rvf.RVF_TAX

Direct Known Subclasses:

AncestorEngine, DescendantEngine

public class RVF_TAX
extends RVF_DAG

Object of this class can be used to retrieve the vertices reachable from a particular vertex of an acyclic graph considering taxonomic relationships.

Author:

Sébastien Harispe

Field Summary

Fields inherited from class slib.graph.algo.extraction.rvf.RVF

g, wc

Constructor Summary

Constructors

Constructor and Description
RVF_TAX(G g, Direction dir)

Method Summary

Methods

Modifier and Type	Method and Description
Map<org.openrdf.model.URI,Set<org.openrdf.model.URI>>	getAllRVClass() Compute for all vertices of the loaded graph, the set of vertices corresponding to classes which can be reach from them.
Set<org.openrdf.model.URI>	getRVClass(org.openrdf.model.URI v) Compute the set of vertices corresponding to classes which can be reach from the given vertex.

Methods inherited from class slib.graph.algo.extraction.rvf.RVF_DAG

computeNbPathLeadingToAllVertices, getAllRV, getTerminalVertices, propagateNbOccurences

Methods inherited from class slib.graph.algo.extraction.rvf.RVF

getRV, getRV, getRVnb, getWalkConstraint, setWalkConstraint

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

RVF_TAX

public RVF_TAX(G g,
       Direction dir)

Method Detail

getRVClass

public Set<org.openrdf.model.URI> getRVClass(org.openrdf.model.URI v)

Compute the set of vertices corresponding to classes which can be reach from the given vertex. Exclusive process: the focused vertex will NOT be included in the set of reachable vertices.

Parameters:

v - the vertex of interest

Returns:

the set of classes which can be reached from the selected vertex

getAllRVClass

public Map<org.openrdf.model.URI,Set<org.openrdf.model.URI>> getAllRVClass()
                                                                    throws SLIB_Ex_Critic

Compute for all vertices of the loaded graph, the set of vertices corresponding to classes which can be reach from them. Exclusive process: a vertex will NOT be included in the set of reachable vertices it can reach.

Returns:

the map storing, for each vertex, the set of reachable vertices respecting the above constraint.

Throws:

SLIB_Ex_Critic