|
GraphLab Project | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectgraphlab.library.algorithms.Algorithm
graphlab.library.algorithms.graphdecomposition.BiconnectedComponents<VertexType,EdgeType>
public class BiconnectedComponents<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
This Method find the biconnected components of a graph. Which are the maximal subgraphs without any cut vertices.
Constructor Summary | |
---|---|
BiconnectedComponents()
|
Method Summary | |
---|---|
java.util.Vector<Pair<java.util.Vector<VertexType>,java.util.Vector<EdgeType>>> |
Bicon(BaseGraph<VertexType,EdgeType> g)
This is the main method, wich take the graph g as the input, and returns the biconnected components of g in a vector. |
void |
doAlgorithm()
|
Methods inherited from class graphlab.library.algorithms.Algorithm |
---|
acceptEventDispatcher, dispatchEvent, getDispatcher |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface graphlab.library.algorithms.AlgorithmInterface |
---|
acceptEventDispatcher |
Constructor Detail |
---|
public BiconnectedComponents()
Method Detail |
---|
public void doAlgorithm()
doAlgorithm
in interface AutomatedAlgorithm
public java.util.Vector<Pair<java.util.Vector<VertexType>,java.util.Vector<EdgeType>>> Bicon(BaseGraph<VertexType,EdgeType> g)
g
-
|
GraphLab Project | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |