Package org.jgrapht.alg
Class BiconnectivityInspector<V,E>
java.lang.Object
org.jgrapht.alg.BiconnectivityInspector<V,E>
Inspects a graph for the biconnectivity property. See
BlockCutpointGraph
for more information. A biconnected graph has only one
block (i.e. no cutpoints).- Since:
- July 5, 2007
- Author:
- Guillaume Boulmier
-
Constructor Summary
ConstructorsConstructorDescriptionBiconnectivityInspector
(UndirectedGraph<V, E> graph) Running time = O(m) where m is the number of edges. -
Method Summary
Modifier and TypeMethodDescriptionReturns the biconnected vertex-components of the graph.getBiconnectedVertexComponents
(V vertex) Returns the biconnected vertex-components containing the vertex.Returns the cutpoints of the graph.boolean
Returnstrue
if the graph is biconnected (no cutpoint),false
otherwise.
-
Constructor Details
-
BiconnectivityInspector
Running time = O(m) where m is the number of edges.
-
-
Method Details
-
getBiconnectedVertexComponents
Returns the biconnected vertex-components of the graph. -
getBiconnectedVertexComponents
Returns the biconnected vertex-components containing the vertex. A biconnected vertex-component contains all the vertices in the component. A vertex which is not a cutpoint is contained in exactly one component. A cutpoint is contained is at least 2 components.- Parameters:
vertex
-- Returns:
- set of all biconnected vertex-components containing the vertex.
-
getCutpoints
Returns the cutpoints of the graph. -
isBiconnected
public boolean isBiconnected()Returnstrue
if the graph is biconnected (no cutpoint),false
otherwise.
-