V
- the graph vertex typeE
- the graph edge typepublic class BiconnectivityInspector<V,E> extends 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 |
---|---|
Set<Set<V>> |
getBiconnectedVertexComponents()
Returns the biconnected vertex-components of the graph.
|
Set<Set<V>> |
getBiconnectedVertexComponents(V vertex)
Returns the biconnected vertex-components containing the vertex.
|
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)
graph
- the input graphpublic Set<Set<V>> getBiconnectedVertexComponents()
public Set<Set<V>> getBiconnectedVertexComponents(V vertex)
vertex
- the input vertexpublic Set<V> getCutpoints()
public boolean isBiconnected()
true
if the graph is biconnected (no cutpoint), false
otherwise.Copyright © 2016. All rights reserved.