Check if the given graph contains a unique underlying rooted taxonomic
graph Do not check if the graph is a DAG Shortcut of
ValidatorDAG#getDAGRoots(G, EType) == 1 only considering
SUBCLASSOF relationships
Class used to perform traversal on a graph using Depth First Search Algorithm
from a set of vertices and considering particular types of relationships.
Basic implementation of the shortest path algorithm proposed by Dijkstra Only
suited for shortest path exclusively composed of non-negative weight more about TODO
optimize i.e Fibonacci heap implementation
Compute the set of inclusive descendants of all vertices contained in the
graph.
getAllRV() -
Method in class slib.sglib.algo.graph.extraction.rvf.RVF_DAG
Compute the set of reachable vertices for each vertices contained in the
graph according to the specified constraint associated to the instance in
use.
Root vertices (terminal vertices) are those of type CLASS which respect
the following restrictions : must not contains an edges of
the given types and direction
Do not check if the graph is a DAG
Return a set of URI corresponding to the instances of the graph, note
that instance definition is here different from RDF the definition of an
instance.
Check if the underlying graph defined by the edges of edgeTypes, the
given edges type ,and build using a traversal starting from the root
vertices according to the inverse of edgeTypes is a DAG.
Performs a transitive reduction of the given graph considering a given
vertex as root only taxonomic relationships are considered i.e
SUBCLASSOF, SUPERCLASSOF.
Reachable Vertex Finder (RVF) objects can be used to retrieve the vertices
reachable from a particular vertex of a graph considering particular
constraints e.g.
Object of this class can be used to retrieve the vertices reachable from a
particular vertex of an acyclic graph considering particular relationships
i.e.