graphlab.library.algorithms.graphdecomposition
Class BiconnectedComponents<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>

java.lang.Object
  graphlab.library.algorithms.Algorithm
      graphlab.library.algorithms.graphdecomposition.BiconnectedComponents<VertexType,EdgeType>

All Implemented Interfaces:

AlgorithmInterface, AutomatedAlgorithm

Direct Known Subclasses:

BiconnectedComponentsAnim

public class BiconnectedComponents<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
extends Algorithm
implements AutomatedAlgorithm

This Method find the biconnected components of a graph. Which are the maximal subgraphs without any cut vertices.

Author:

Soroush Sabet

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

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface graphlab.library.algorithms.AlgorithmInterface

acceptEventDispatcher

Constructor Detail

BiconnectedComponents

public BiconnectedComponents()

Method Detail

doAlgorithm

public void doAlgorithm()

Specified by:

doAlgorithm in interface AutomatedAlgorithm

Bicon

public 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.

Parameters:

g -