public class BiconnectivityInspector<V,E>
extends java.lang.Object
BlockCutpointGraph
for more information. A biconnected graph has only one
block (i.e. no cutpoints).Constructor and Description |
---|
BiconnectivityInspector(UndirectedGraph<V,E> graph)
Running time = O(m) where m is the number of edges.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<java.util.Set<V>> |
getBiconnectedVertexComponents()
Returns the biconnected vertex-components of the graph.
|
java.util.Set<java.util.Set<V>> |
getBiconnectedVertexComponents(V vertex)
Returns the biconnected vertex-components containing the vertex.
|
java.util.Set<V> |
getCutpoints()
Returns the cutpoints of the graph.
|
boolean |
isBiconnected()
Returns
true if the graph is biconnected (no cutpoint),
false otherwise. |
public BiconnectivityInspector(UndirectedGraph<V,E> graph)
public java.util.Set<java.util.Set<V>> getBiconnectedVertexComponents()
public java.util.Set<java.util.Set<V>> getBiconnectedVertexComponents(V vertex)
vertex
- public java.util.Set<V> getCutpoints()
public boolean isBiconnected()
true
if the graph is biconnected (no cutpoint),
false
otherwise.