Package com.jgalgo.alg.connect
Class BiConnectedComponentsAlgoAbstract
- java.lang.Object
-
- com.jgalgo.alg.connect.BiConnectedComponentsAlgoAbstract
-
- All Implemented Interfaces:
BiConnectedComponentsAlgo
- Direct Known Subclasses:
BiConnectedComponentsAlgoHopcroftTarjan
public abstract class BiConnectedComponentsAlgoAbstract extends Object implements BiConnectedComponentsAlgo
Abstract class for bi-connected components algorithms.The class implements the interface by solving the problem on the index graph and then maps the results back to the original graph. The implementation for index graphs is abstract and left to the subclasses.
- Author:
- Barak Ugav
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from interface com.jgalgo.alg.connect.BiConnectedComponentsAlgo
BiConnectedComponentsAlgo.IResult, BiConnectedComponentsAlgo.Result<V,E>
-
-
Constructor Summary
Constructors Constructor Description BiConnectedComponentsAlgoAbstract()
Default constructor.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description <V,E>
BiConnectedComponentsAlgo.Result<V,E>findBiConnectedComponents(Graph<V,E> g)
Compute all maximal bi-connected components of a graph.
-
-
-
Method Detail
-
findBiConnectedComponents
public <V,E> BiConnectedComponentsAlgo.Result<V,E> findBiConnectedComponents(Graph<V,E> g)
Description copied from interface:BiConnectedComponentsAlgo
Compute all maximal bi-connected components of a graph.If an
IntGraph
is passed as an argumentBiConnectedComponentsAlgo.IResult
is returned.- Specified by:
findBiConnectedComponents
in interfaceBiConnectedComponentsAlgo
- Type Parameters:
V
- the vertices typeE
- the edges type- Parameters:
g
- a graph- Returns:
- a result object containing the bi-connected components of the graph
-
-