org.jgrapht.alg
public class BlockCutpointGraph<V,E> extends SimpleGraph<UndirectedGraph<V,E>,DefaultEdge>
| Constructor and Description |
|---|
BlockCutpointGraph(UndirectedGraph<V,E> graph)
Running time = O(m) where m is the number of edges.
|
| Modifier and Type | Method and Description |
|---|---|
UndirectedGraph<V,E> |
getBlock(V vertex)
Returns the vertex if vertex is a cutpoint, and otherwise returns the
block (biconnected component) containing the vertex.
|
java.util.Set<V> |
getCutpoints()
Returns the cutpoints of the initial graph.
|
boolean |
isCutpoint(V vertex)
Renvoie
true if the vertex is a cutpoint, false
otherwise. |
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeSetFactory, setEdgeWeight, vertexSetassertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSetsequals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitdegreeOfaddEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, getEdgeSource, getEdgeTarget, getEdgeWeight, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSetpublic BlockCutpointGraph(UndirectedGraph<V,E> graph)
public UndirectedGraph<V,E> getBlock(V vertex)
vertex - vertex in the initial graph.public java.util.Set<V> getCutpoints()
public boolean isCutpoint(V vertex)
true if the vertex is a cutpoint, false
otherwise.vertex - vertex in the initial graph.