slib.sglib.algo.graph.metric
Class DepthAnalyserAG
java.lang.Object
slib.sglib.algo.graph.metric.DepthAnalyserAG
public class DepthAnalyserAG
- extends Object
Class used to analyze depth of vertices composing an acyclic graph
- Author:
- Sebastien Harispe
Constructor Summary |
DepthAnalyserAG(slib.sglib.model.graph.G g,
slib.sglib.model.graph.utils.WalkConstraint wc)
Create a DepthAnalyserAG object considering a particular acyclic graph
and set of edge types Note that graph acyclicity is not evaluated. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
DepthAnalyserAG
public DepthAnalyserAG(slib.sglib.model.graph.G g,
slib.sglib.model.graph.utils.WalkConstraint wc)
- Create a DepthAnalyserAG object considering a particular acyclic graph
and set of edge types Note that graph acyclicity is not evaluated.
- Parameters:
factory
- g
- The graph to considerwc
-
getVMaxDepths
public Map<org.openrdf.model.URI,Integer> getVMaxDepths()
throws slib.utils.ex.SLIB_Ex_Critic
- Returns:
- a ResultStack containing the maximal depth of each vertex.
- Throws:
slib.utils.ex.SLIB_Ex_Critic
getVMinDepths
public Map<org.openrdf.model.URI,Integer> getVMinDepths()
throws slib.utils.ex.SLIB_Ex_Critic
- Returns:
- a ResultStack containing the minimal depth of each vertex.
- Throws:
slib.utils.ex.SLIB_Ex_Critic
getMinDepthsDistribution
public Map<Integer,Integer> getMinDepthsDistribution()
throws slib.utils.ex.SLIB_Exception
- Returns:
- a HashMap representing the distribution of each represented
minimal depths. key Integer the depth, value the number of vertices with
the corresponding depth
- Throws:
slib.utils.ex.SLIB_Exception
getMaxDepthsDistribution
public Map<Integer,Integer> getMaxDepthsDistribution()
throws slib.utils.ex.SLIB_Exception
- Returns:
- a HashMap representing the distribution of each represented
maximal depths. key Integer the depth, value the number of vertices with
the corresponding depth
- Throws:
slib.utils.ex.SLIB_Exception
Copyright © 2013. All Rights Reserved.