|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectslib.sglib.algo.graph.validator.dag.ValidatorDAG
public class ValidatorDAG
Used to validate if a graph is directed and acyclic (DAG)
Constructor Summary | |
---|---|
ValidatorDAG()
|
Method Summary | |
---|---|
boolean |
containsRootedDagRoot(slib.sglib.model.graph.G g,
org.openrdf.model.URI rootURI,
slib.sglib.model.graph.utils.WalkConstraint wc)
Test if the given URI corresponds to a root of the graph build according to the specified edge types. |
boolean |
containsRootedTaxonomicDag(slib.sglib.model.graph.G g)
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 |
boolean |
containsTaxonomicDag(slib.sglib.model.graph.G graph)
|
Set<org.openrdf.model.URI> |
getDAGRoots(slib.sglib.model.graph.G g,
slib.sglib.model.graph.utils.WalkConstraint wc)
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 |
slib.sglib.model.graph.elements.E |
getLastEdge()
|
org.openrdf.model.URI |
getRootedTaxonomicDAGRoot(slib.sglib.model.graph.G g)
Return the vertex rooting the unique underlying rooted taxonomic graph. |
Set<org.openrdf.model.URI> |
getTaxonomicDAGRoots(slib.sglib.model.graph.G g)
Do not check if the graph is a DAG |
boolean |
isDag(slib.sglib.model.graph.G graph,
Set<org.openrdf.model.URI> startingURIs,
slib.sglib.model.graph.utils.WalkConstraint wc)
|
boolean |
isDag(slib.sglib.model.graph.G graph,
org.openrdf.model.URI rootURI,
slib.sglib.model.graph.utils.WalkConstraint wc)
Check if the underlying graph defined by the edges of the given edge types and build using a traversal starting from the given root node is a DAG. |
boolean |
isDag(slib.sglib.model.graph.G graph,
slib.sglib.model.graph.utils.WalkConstraint wc)
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. |
boolean |
isUniqueRootedDagRoot(slib.sglib.model.graph.G g,
org.openrdf.model.URI root,
slib.sglib.model.graph.utils.WalkConstraint wc)
Do not check if the graph is a DAG |
boolean |
isUniqueRootedTaxonomicDag(slib.sglib.model.graph.G g,
org.openrdf.model.URI root)
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public ValidatorDAG()
Method Detail |
---|
public boolean isDag(slib.sglib.model.graph.G graph, Set<org.openrdf.model.URI> startingURIs, slib.sglib.model.graph.utils.WalkConstraint wc) throws slib.utils.ex.SLIB_Ex_Critic
graph
- startingURIs
- edgesTypes
- dir
-
slib.utils.ex.SLIB_Ex_Critic
public boolean isDag(slib.sglib.model.graph.G graph, org.openrdf.model.URI rootURI, slib.sglib.model.graph.utils.WalkConstraint wc) throws slib.utils.ex.SLIB_Ex_Critic
ValidatorDAG#isDag(G, Set, Set)
only considering
the given set of edge types
graph
- the graph on which the evaluation has to be maderootURI
- edgeTypes
- dir
-
slib.utils.ex.SLIB_Ex_Critic
public boolean containsTaxonomicDag(slib.sglib.model.graph.G graph) throws slib.utils.ex.SLIB_Ex_Critic
graph
-
slib.utils.ex.SLIB_Ex_Critic
public boolean isDag(slib.sglib.model.graph.G graph, slib.sglib.model.graph.utils.WalkConstraint wc) throws slib.utils.ex.SLIB_Ex_Critic
ValidatorDAG#isDag(G, Set, Set)
considering the given edge types
and the root vertices according to the inverse of the specified edge
types as root (see ValidatorDAG#getDAGRoots(G, EType)
)
graph
- the graph on which the evaluation has to be madeedgeTypes
- dir
-
slib.utils.ex.SLIB_Ex_Critic
public Set<org.openrdf.model.URI> getDAGRoots(slib.sglib.model.graph.G g, slib.sglib.model.graph.utils.WalkConstraint wc)
g
- the graph on which the root vertices need to be retrieveetypes
- e.g. if taxonomic graph use SUPERCLASSOFdir
-
public boolean containsRootedTaxonomicDag(slib.sglib.model.graph.G g) throws slib.utils.ex.SLIB_Ex_Critic
ValidatorDAG#getDAGRoots(G, EType)
== 1 only considering
SUBCLASSOF relationships
g
- the graph on which the test is performed
slib.utils.ex.SLIB_Ex_Critic
public org.openrdf.model.URI getRootedTaxonomicDAGRoot(slib.sglib.model.graph.G g) throws slib.utils.ex.SLIB_Ex_Critic
ValidatorDAG#getDAGRoots(G, EType)
only considering
SUBCLASSOF relationships
g
- the graph
IllegalArgumentException
- if the underlying taxonomic graph of the
given graph contains multiple roots.
slib.utils.ex.SLIB_Ex_Critic
public Set<org.openrdf.model.URI> getTaxonomicDAGRoots(slib.sglib.model.graph.G g)
g
-
public boolean containsRootedDagRoot(slib.sglib.model.graph.G g, org.openrdf.model.URI rootURI, slib.sglib.model.graph.utils.WalkConstraint wc)
g
- the graph to considerrootURI
- the URI to testedgesType
- the edge type to consider only OUT direction is
considered
public boolean isUniqueRootedTaxonomicDag(slib.sglib.model.graph.G g, org.openrdf.model.URI root) throws slib.utils.ex.SLIB_Ex_Critic
g
- root
-
slib.utils.ex.SLIB_Ex_Critic
public boolean isUniqueRootedDagRoot(slib.sglib.model.graph.G g, org.openrdf.model.URI root, slib.sglib.model.graph.utils.WalkConstraint wc) throws slib.utils.ex.SLIB_Ex_Critic
g
- root
- edgesType
- dir
-
slib.utils.ex.SLIB_Ex_Critic
public slib.sglib.model.graph.elements.E getLastEdge()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |