A B C D E G H I N P R S T V W 

A

AncestorEngine - Class in slib.sglib.algo.graph.extraction.rvf
Class used to provide an easy way to retrieve the ancestors of a concept (super classes of a class).
AncestorEngine(G) - Constructor for class slib.sglib.algo.graph.extraction.rvf.AncestorEngine
Build an ancestor engine associated to the given graph.
applyAction(GAction, G) - Static method in class slib.sglib.algo.graph.utils.GraphActionExecutor
Apply the given action to the graph.
applyAction(URIFactory, GAction, G) - Static method in class slib.sglib.algo.graph.utils.GraphActionExecutor
Apply an action to the graph.
applyActions(URIFactory, List<GAction>, G) - Static method in class slib.sglib.algo.graph.utils.GraphActionExecutor
 

B

BFS - Class in slib.sglib.algo.graph.traversal.classical
Class used to perform traversal on a graph using Breadth First Search (BFS).
BFS(G, Set<URI>, WalkConstraint) - Constructor for class slib.sglib.algo.graph.traversal.classical.BFS
Creates an instance of BFS used to perform a Bread First Search Traversal over the graph.
BFS(G, URI, WalkConstraint) - Constructor for class slib.sglib.algo.graph.traversal.classical.BFS
Creates an instance of BFS used to perform a Bread First Search Traversal over the graph.

C

clear() - Method in class slib.sglib.algo.graph.validator.dag.Path
Clear the path.
Color - Enum in slib.sglib.algo.graph.utils
Enumeration used to represent colors.
computeNbPathLeadingToAllVertices() - Method in class slib.sglib.algo.graph.extraction.rvf.RVF_DAG
 
containsRootedDagRoot(G, URI, WalkConstraint) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
Test if the given URI corresponds to a root of the graph build according to the specified edge types.
containsTaxonomicDag(G) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
 
containsTaxonomicDagWithUniqueRoot(G) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
Check if the given graph contains a underlying taxonomic graph with a unique root.

D

DepthAnalyserAG - Class in slib.sglib.algo.graph.metric
Class used to analyze depth of vertices composing an acyclic graph
DepthAnalyserAG(G, WalkConstraint) - Constructor for class slib.sglib.algo.graph.metric.DepthAnalyserAG
Create a DepthAnalyserAG object considering a particular acyclic graph and set of edge types Note that graph acyclicity is not evaluated.
DescendantEngine - Class in slib.sglib.algo.graph.extraction.rvf
 
DescendantEngine(G) - Constructor for class slib.sglib.algo.graph.extraction.rvf.DescendantEngine
 
DFS - Class in slib.sglib.algo.graph.traversal.classical
Class used to perform traversal on a graph using Depth First Search Algorithm from a set of vertices and considering particular types of relationships.
DFS(G, Set<URI>, WalkConstraint) - Constructor for class slib.sglib.algo.graph.traversal.classical.DFS
Create a DFS iterator, note that DFS is performed at instance creation.
DFS(G, URI, WalkConstraint) - Constructor for class slib.sglib.algo.graph.traversal.classical.DFS
 
Dijkstra - Class in slib.sglib.algo.graph.shortest_path
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
Dijkstra(G, WalkConstraint) - Constructor for class slib.sglib.algo.graph.shortest_path.Dijkstra
Edge weights set to 1
Dijkstra(G, WalkConstraint, GWS) - Constructor for class slib.sglib.algo.graph.shortest_path.Dijkstra
Create an Dijkstra algorithm used to compute shortest paths on a graph considering a given non negative weighting scheme

E

exec(Set<URI>, G) - Method in class slib.sglib.algo.graph.reduction.dag.GraphReduction_DAG_Ranwez_2011
 

G

g - Variable in class slib.sglib.algo.graph.extraction.rvf.RVF
 
GAction - Class in slib.sglib.algo.graph.utils
Class used to represent an action which is applicable to a graph.
GAction(GActionType) - Constructor for class slib.sglib.algo.graph.utils.GAction
Build an instance of GAction considering the given type.
GActionType - Enum in slib.sglib.algo.graph.utils
Enumeration used to represent the various types of actions which can be applied to a graph.
GActionValidator - Class in slib.sglib.algo.graph.utils
Class used to validate if the configuration associated to a GAction is valid.
GActionValidator() - Constructor for class slib.sglib.algo.graph.utils.GActionValidator
 
getAllAncestorsExc() - Method in class slib.sglib.algo.graph.extraction.rvf.AncestorEngine
Compute the set of exclusive ancestors of all vertices contained in the graph.
getAllAncestorsInc() - Method in class slib.sglib.algo.graph.extraction.rvf.AncestorEngine
Compute the set of inclusive ancestors of all vertices contained in the graph.
getAllDescendantsExc() - Method in class slib.sglib.algo.graph.extraction.rvf.DescendantEngine
Compute the set of exclusive descendants of all vertices contained in the graph.
getAllDescendantsInc() - Method in class slib.sglib.algo.graph.extraction.rvf.DescendantEngine
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.
getAllRVClass() - Method in class slib.sglib.algo.graph.extraction.rvf.RVF_TAX
Compute for all vertices of the loaded graph, the set of vertices corresponding to classes which can be reach from them.
getAncestorsExc(URI) - Method in class slib.sglib.algo.graph.extraction.rvf.AncestorEngine
Compute the set of exclusive ancestors of a class.
getAncestorsInc(URI) - Method in class slib.sglib.algo.graph.extraction.rvf.AncestorEngine
Compute the set of inclusive ancestors of a class.
getClasses(G) - Static method in class slib.sglib.algo.graph.accessor.GraphAccessor
Return a set of URI corresponding to the classes of the graph.
getDAGRoots(G, WalkConstraint) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
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
getDescendantsExc(URI) - Method in class slib.sglib.algo.graph.extraction.rvf.DescendantEngine
Compute the set of exclusive descendants of a class.
getDescendantsInc(URI) - Method in class slib.sglib.algo.graph.extraction.rvf.DescendantEngine
Compute the set of inclusive descendants of a class.
getDirectClass(URI) - Method in class slib.sglib.algo.graph.extraction.rvf.instances.impl.InstanceAccessor_RDF_TYPE
 
getDirectClass(URI) - Method in interface slib.sglib.algo.graph.extraction.rvf.instances.InstancesAccessor
Method providing access to the classes annotating an instance.
getDirectInstances(URI) - Method in class slib.sglib.algo.graph.extraction.rvf.instances.impl.InstanceAccessor_RDF_TYPE
 
getDirectInstances(URI) - Method in interface slib.sglib.algo.graph.extraction.rvf.instances.InstancesAccessor
Access to a way to iterate through the set of instances considered as direct instances of a class e.g.
getDirectInstancesNumber(URI) - Method in class slib.sglib.algo.graph.extraction.rvf.instances.impl.InstanceAccessor_RDF_TYPE
 
getInstances(G) - Static method in class slib.sglib.algo.graph.accessor.GraphAccessor
Return a set of URI corresponding to the instances of the graph, note that instance.
getInstances() - Method in class slib.sglib.algo.graph.extraction.rvf.instances.impl.InstanceAccessor_RDF_TYPE
 
getInstances(URI) - Method in class slib.sglib.algo.graph.extraction.rvf.instances.impl.InstanceAccessor_RDF_TYPE
 
getInstances() - Method in interface slib.sglib.algo.graph.extraction.rvf.instances.InstancesAccessor
Return a way to iterate over the collection of instances.
getInstances(URI) - Method in interface slib.sglib.algo.graph.extraction.rvf.instances.InstancesAccessor
Access to a way to iterate over an instance of a class.
getLastEdge() - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
 
getMaxDepthsDistribution() - Method in class slib.sglib.algo.graph.metric.DepthAnalyserAG
 
getMinDepthsDistribution() - Method in class slib.sglib.algo.graph.metric.DepthAnalyserAG
 
getRV(URI) - Method in class slib.sglib.algo.graph.extraction.rvf.RVF
Retrieve the set of reachable vertices RV from a specified vertex taking into account the type of relationships associated to the current instance.
getRV(Set<URI>) - Method in class slib.sglib.algo.graph.extraction.rvf.RVF
Compute the set of reachable vertices for each vertices composing the graph associated to the object considering the edge types loaded.
getRVClass(URI) - Method in class slib.sglib.algo.graph.extraction.rvf.RVF_TAX
Compute the set of vertices corresponding to classes which can be reach from the given vertex.
getRVnb(Set<URI>) - Method in class slib.sglib.algo.graph.extraction.rvf.RVF
Return the number of vertices reachable from all vertices composing the graph associated to the instance.
getTaxonomicRoots(G) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
Return the vertices which root the taxonomic graph.
getTerminalVertices() - Method in class slib.sglib.algo.graph.extraction.rvf.RVF_DAG
Return the set of terminal vertices (leaves) reachable.
getTraversalOrder() - Method in class slib.sglib.algo.graph.traversal.classical.DFS
Returns the traversal ordering resulting of the DFS i.e topological sort.
getUniqueTaxonomicRoot(G) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
Return the unique vertex rooting the underlying taxonomic graph.
getV_NoEdgeType(G, URI, Direction) - Static method in class slib.sglib.algo.graph.accessor.GraphAccessor
 
getV_NoEdgeType(G, Set<URI>, Direction) - Static method in class slib.sglib.algo.graph.accessor.GraphAccessor
 
getVMaxDepths() - Method in class slib.sglib.algo.graph.metric.DepthAnalyserAG
 
getVMinDepths() - Method in class slib.sglib.algo.graph.metric.DepthAnalyserAG
 
getWalkConstraint() - Method in class slib.sglib.algo.graph.extraction.rvf.RVF
 
GraphAccessor - Class in slib.sglib.algo.graph.accessor
 
GraphAccessor() - Constructor for class slib.sglib.algo.graph.accessor.GraphAccessor
 
GraphActionExecutor - Class in slib.sglib.algo.graph.utils
Class managing the execution of GAction over a graph.
GraphActionExecutor() - Constructor for class slib.sglib.algo.graph.utils.GraphActionExecutor
 
GraphReduction_DAG_Ranwez_2011 - Class in slib.sglib.algo.graph.reduction.dag
Algorithm used to extract a subgraph from a DAG (Directed Acyclic Graph)
Implementation of Ranwez et al.
GraphReduction_DAG_Ranwez_2011(G) - Constructor for class slib.sglib.algo.graph.reduction.dag.GraphReduction_DAG_Ranwez_2011
 
GraphReduction_DAG_Ranwez_2011(G, Set<URI>, Set<URI>, boolean) - Constructor for class slib.sglib.algo.graph.reduction.dag.GraphReduction_DAG_Ranwez_2011
Method used to perform the subGraph extraction of an acyclic graph based on top-down and bottom-up transitive closures.
GraphReduction_Transitive - Class in slib.sglib.algo.graph.reduction.dag
Class used to perform a transitive reduction of a DAG see http://en.wikipedia.org/wiki/Transitive_reduction
GraphReduction_Transitive() - Constructor for class slib.sglib.algo.graph.reduction.dag.GraphReduction_Transitive
 
GraphTraversal - Interface in slib.sglib.algo.graph.traversal
GraphTraversal interface

H

hasNext() - Method in class slib.sglib.algo.graph.traversal.classical.BFS
Check if the traversal is finished.
hasNext() - Method in class slib.sglib.algo.graph.traversal.classical.DFS
 
hasNext() - Method in interface slib.sglib.algo.graph.traversal.GraphTraversal
Check if the traversal is finished.

I

InstanceAccessor_RDF_TYPE - Class in slib.sglib.algo.graph.extraction.rvf.instances.impl
 
InstanceAccessor_RDF_TYPE(G, DescendantEngine) - Constructor for class slib.sglib.algo.graph.extraction.rvf.instances.impl.InstanceAccessor_RDF_TYPE
 
InstanceAccessor_RDF_TYPE(G) - Constructor for class slib.sglib.algo.graph.extraction.rvf.instances.impl.InstanceAccessor_RDF_TYPE
 
InstancesAccessor - Interface in slib.sglib.algo.graph.extraction.rvf.instances
Interface defining a access to the instances of the classes
isDag(G, Set<URI>, WalkConstraint) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
 
isDag(G, URI, WalkConstraint) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
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.
isDag(G, WalkConstraint) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
Check if the underlying graph defined by given WalkConstraint is a DAG.
isUniqueRootedDagRoot(G, URI, WalkConstraint) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
Do not check if the graph is a DAG
isUniqueRootedTaxonomicDag(G, URI) - Method in class slib.sglib.algo.graph.validator.dag.ValidatorDAG
 
isValid() - Method in class slib.sglib.algo.graph.utils.GAction
Check if the action is valid with regards to the parameters required to be specified.

N

next() - Method in class slib.sglib.algo.graph.traversal.classical.BFS
Access to the next vertex reached by the BFS.
next() - Method in class slib.sglib.algo.graph.traversal.classical.DFS
 
next() - Method in interface slib.sglib.algo.graph.traversal.GraphTraversal
Return the next vertex of the traversal.
NOT_COMPUTED - Static variable in class slib.sglib.algo.graph.shortest_path.Dijkstra
 

P

Path - Class in slib.sglib.algo.graph.validator.dag
Simple representation of a path in a graph.
Path() - Constructor for class slib.sglib.algo.graph.validator.dag.Path
 
process(G) - Static method in class slib.sglib.algo.graph.reduction.dag.GraphReduction_Transitive
Performs a transitive reduction of the underlying taxonomic graph of the given graph.
process(G, Set<URI>) - Static method in class slib.sglib.algo.graph.reduction.dag.GraphReduction_Transitive
Performs a transitive reduction of the given graph considering a set of vertices corresponding to the roots of the graph.
propagateNbOccurences(Map<URI, Integer>) - Method in class slib.sglib.algo.graph.extraction.rvf.RVF_DAG
Method used to compute the number of occurrences associated to each vertex after the propagation of the given number of occurences.

R

REROOT_UNIVERSAL_ROOT_FLAG - Static variable in class slib.sglib.algo.graph.utils.GraphActionExecutor
 
RooterDAG - Class in slib.sglib.algo.graph.utils
Object used to root a graph taking into consideration edge types defining roots.
RooterDAG() - Constructor for class slib.sglib.algo.graph.utils.RooterDAG
 
rootUnderlyingDAG(G, URI, WalkConstraint, boolean) - Static method in class slib.sglib.algo.graph.utils.RooterDAG
Add a unique root to a DAG (underlying DAG) composed of multiple roots.
rootUnderlyingTaxonomicDAG(G, URI) - Static method in class slib.sglib.algo.graph.utils.RooterDAG
Root the underlying taxonomic DAG of the specified graph.
RVF - Class in slib.sglib.algo.graph.extraction.rvf
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.
RVF(G, WalkConstraint) - Constructor for class slib.sglib.algo.graph.extraction.rvf.RVF
Reachable vertex Finder
RVF_DAG - Class in slib.sglib.algo.graph.extraction.rvf
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.
RVF_DAG(G, WalkConstraint) - Constructor for class slib.sglib.algo.graph.extraction.rvf.RVF_DAG
Create a basic RVF object considering an acyclic graph and a only one type of relationships to consider during the traversal.
RVF_TAX - Class in slib.sglib.algo.graph.extraction.rvf
Object of this class can be used to retrieve the vertices reachable from a particular vertex of an acyclic graph considering taxonomic relationships.
RVF_TAX(G, Direction) - Constructor for class slib.sglib.algo.graph.extraction.rvf.RVF_TAX
 

S

setWalkConstraint(WalkConstraint) - Method in class slib.sglib.algo.graph.extraction.rvf.RVF
 
shortestPath(URI, URI) - Method in class slib.sglib.algo.graph.shortest_path.Dijkstra
Compute shortest path between two nodes Note also that the resultStack is populated during computation
shortestPath(URI) - Method in class slib.sglib.algo.graph.shortest_path.Dijkstra
 
slib.sglib.algo.graph - package slib.sglib.algo.graph
 
slib.sglib.algo.graph.accessor - package slib.sglib.algo.graph.accessor
 
slib.sglib.algo.graph.extraction.rvf - package slib.sglib.algo.graph.extraction.rvf
 
slib.sglib.algo.graph.extraction.rvf.instances - package slib.sglib.algo.graph.extraction.rvf.instances
 
slib.sglib.algo.graph.extraction.rvf.instances.impl - package slib.sglib.algo.graph.extraction.rvf.instances.impl
 
slib.sglib.algo.graph.metric - package slib.sglib.algo.graph.metric
 
slib.sglib.algo.graph.reduction.dag - package slib.sglib.algo.graph.reduction.dag
 
slib.sglib.algo.graph.shortest_path - package slib.sglib.algo.graph.shortest_path
 
slib.sglib.algo.graph.traversal - package slib.sglib.algo.graph.traversal
 
slib.sglib.algo.graph.traversal.classical - package slib.sglib.algo.graph.traversal.classical
 
slib.sglib.algo.graph.utils - package slib.sglib.algo.graph.utils
 
slib.sglib.algo.graph.validator.dag - package slib.sglib.algo.graph.validator.dag
 

T

toString() - Method in class slib.sglib.algo.graph.validator.dag.Path
 
type - Variable in class slib.sglib.algo.graph.utils.GAction
The type of action

V

valid(GAction) - Static method in class slib.sglib.algo.graph.utils.GActionValidator
Test if the given GAction is valid.
ValidatorDAG - Class in slib.sglib.algo.graph.validator.dag
Used to validate if a graph is directed and acyclic (DAG)
ValidatorDAG() - Constructor for class slib.sglib.algo.graph.validator.dag.ValidatorDAG
 
valueOf(String) - Static method in enum slib.sglib.algo.graph.utils.Color
Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum slib.sglib.algo.graph.utils.GActionType
Returns the enum constant of this type with the specified name.
values() - Static method in enum slib.sglib.algo.graph.utils.Color
Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum slib.sglib.algo.graph.utils.GActionType
Returns an array containing the constants of this enum type, in the order they are declared.

W

wc - Variable in class slib.sglib.algo.graph.extraction.rvf.RVF
 
A B C D E G H I N P R S T V W 

Copyright © 2014. All rights reserved.