slib.graph.algo.extraction.validator.dag

Class ValidatorDAG

java.lang.Object

slib.graph.algo.extraction.validator.dag.ValidatorDAG

public class ValidatorDAG
extends Object

Used to validate if a graph is directed and acyclic (DAG)

Author:

Sébastien Harispe

Constructor Summary

Constructors

Constructor and Description
ValidatorDAG()

Method Summary

Methods

Modifier and Type	Method and Description
boolean	containsRootedDagRoot(G g, org.openrdf.model.URI rootURI, WalkConstraint wc) Test if the given URI corresponds to a root of the graph build according to the specified edge types.
boolean	containsTaxonomicDag(G graph)
boolean	containsTaxonomicDagWithUniqueRoot(G g) Check if the given graph contains a underlying taxonomic graph with a unique root.
Set<org.openrdf.model.URI>	getDAGRoots(G g, 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
E	getLastEdge()
Set<org.openrdf.model.URI>	getTaxonomicRoots(G g) Return the vertices which root the taxonomic graph.
org.openrdf.model.URI	getUniqueTaxonomicRoot(G g) Return the unique vertex rooting the underlying taxonomic graph.
boolean	isDag(G graph, Set<org.openrdf.model.URI> startingURIs, WalkConstraint wc)
boolean	isDag(G graph, org.openrdf.model.URI rootURI, 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(G graph, WalkConstraint wc) Check if the underlying graph defined by given WalkConstraint is a DAG.
boolean	isUniqueRootedDagRoot(G g, org.openrdf.model.URI root, WalkConstraint wc) Do not check if the graph is a DAG
boolean	isUniqueRootedTaxonomicDag(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

ValidatorDAG

public ValidatorDAG()

Method Detail

isDag

public boolean isDag(G graph,
            Set<org.openrdf.model.URI> startingURIs,
            WalkConstraint wc)
              throws SLIB_Ex_Critic

Parameters:

graph -

startingURIs -

wc -

Returns:

true if the graph is a DAG

Throws:

SLIB_Ex_Critic

isDag

public boolean isDag(G graph,
            org.openrdf.model.URI rootURI,
            WalkConstraint wc)
              throws SLIB_Ex_Critic

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. shortcut of isDag(G, WalkConstraint) only considering the given set of edge types

Parameters:

graph - the graph on which the evaluation has to be made

rootURI -

wc -

Returns:

true if the the (underlying) graph reduction is a DAG

Throws:

SLIB_Ex_Critic

containsTaxonomicDag

public boolean containsTaxonomicDag(G graph)
                             throws SLIB_Ex_Critic

Parameters:

graph -

Returns:

true if the graph contains a taxonomic graph.

Throws:

SLIB_Ex_Critic

isDag

public boolean isDag(G graph,
            WalkConstraint wc)
              throws SLIB_Ex_Critic

Check if the underlying graph defined by given WalkConstraint is a DAG. shortcut of isDag(G, WalkConstraint) considering the given edge types and the root vertices according to the inverse of the specified edge types as root (see getDAGRoots(G, WalkConstraint))

Parameters:

graph - the graph on which the evaluation has to be made

wc -

Returns:

true if the the (underlying) graph reduction is a DAG

Throws:

SLIB_Ex_Critic

getDAGRoots

public Set<org.openrdf.model.URI> getDAGRoots(G g,
                                     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

Parameters:

g - the graph on which the root vertices need to be retrieve

wc -

Returns:

The set of vertices matching the predefined conditions

containsTaxonomicDagWithUniqueRoot

public boolean containsTaxonomicDagWithUniqueRoot(G g)
                                           throws SLIB_Ex_Critic

Check if the given graph contains a underlying taxonomic graph with a unique root.

Parameters:

g - the graph on which the test is performed

Returns:

true if the graph contains a unique underlying rooted taxonomic graph

Throws:

SLIB_Ex_Critic

getUniqueTaxonomicRoot

public org.openrdf.model.URI getUniqueTaxonomicRoot(G g)
                                             throws SLIB_Ex_Critic

Return the unique vertex rooting the underlying taxonomic graph. Do not check if the taxonomic graph is a DAG but throw an error if the taxonomic graph contains multiple roots.

Parameters:

g - the graph

Returns:

the unique vertex which roots the taxonomic graph

Throws:

SLIB_Ex_Critic - if the underlying taxonomic graph of the given graph contains multiple roots.

getTaxonomicRoots

public Set<org.openrdf.model.URI> getTaxonomicRoots(G g)

Return the vertices which root the taxonomic graph.

Parameters:

g -

Returns:

the vertices which can be considered as a root, i.e. all the vertices which are not subsumed by an other vertex through a taxonomic relationship.

containsRootedDagRoot

public boolean containsRootedDagRoot(G g,
                            org.openrdf.model.URI rootURI,
                            WalkConstraint wc)

Test if the given URI corresponds to a root of the graph build according to the specified edge types.

Parameters:

g - the graph to consider

rootURI - the URI to test

wc - the edge type to consider only OUT direction is considered

Returns:

true if the graph defined by the specified constraint is rooted by the given URI

isUniqueRootedTaxonomicDag

public boolean isUniqueRootedTaxonomicDag(G g,
                                 org.openrdf.model.URI root)
                                   throws SLIB_Ex_Critic

Parameters:

g -

root -

Returns:

true if the graph contains a taxonomic graph which is rooted by a unique vertex.

Throws:

SLIB_Ex_Critic

isUniqueRootedDagRoot

public boolean isUniqueRootedDagRoot(G g,
                            org.openrdf.model.URI root,
                            WalkConstraint wc)
                              throws SLIB_Ex_Critic

Do not check if the graph is a DAG

Parameters:

g -

root -

wc -

Returns:

true if the graph is a DAG and rooted by a unique vertex.

Throws:

SLIB_Ex_Critic

getLastEdge

public E getLastEdge()

Returns:

the last edge which has been processed during the treatment.