Package com.jgalgo

Interface BiConnectedComponentsAlgo

public interface BiConnectedComponentsAlgo

An algorithm that compute the bi-connected components of a graph.

Given a graph $G=(V,E)$ a bi-connected component $B \subseteq V$ is a maximal set of connected vertices that remain connected even after removing any single vertex of $B$. In particular, an isolated vertex is considered a bi-connected component, along with an isolated pair of vertices connected by a single edge. This algorithm compute all the maximal bi-connected components of the graph. Note that the bi-connected components are not disjoint, namely a single vertex can be included in multiple bi-connected components, differing from the regular connected components of a graph.

Author:

Barak Ugav

See Also:

Wikipedia, ConnectedComponentsAlgo

Nested Class Summary

Nested Classes

Modifier and Type	Interface	Description
static interface	BiConnectedComponentsAlgo.Builder	A builder for BiConnectedComponentsAlgo objects.
static interface	BiConnectedComponentsAlgo.Result	A result object of a BiConnectedComponentsAlgo computation.

Method Summary

Modifier and Type	Method	Description
BiConnectedComponentsAlgo.Result	computeBiConnectivityComponents(Graph g)	Compute all maximal bi-connected components of a graph.
static BiConnectedComponentsAlgo.Builder	newBuilder()	Create a new bi-connected components algorithm builder.

Method Detail

computeBiConnectivityComponents

BiConnectedComponentsAlgo.Result computeBiConnectivityComponents(Graph g)

Compute all maximal bi-connected components of a graph.

Parameters:

g - a graph

Returns:

a result object containing the bi-connected components of the graph

newBuilder

static BiConnectedComponentsAlgo.Builder newBuilder()

Create a new bi-connected components algorithm builder.

This is the recommended way to instantiate a new BiConnectedComponentsAlgo object.

Returns:

a new builder that can build BiConnectedComponentsAlgo objects