V - The vertex typeE - The edge typepublic class SPQRTree<V extends Vertex,E extends Edge<V>> extends AbstractTree<V,E>
| Constructor and Description |
|---|
SPQRTree(E referenceEdge,
Graph<V,E> graph)
Constructs a SPQR tree of the given graph
|
getRoot, setRootaddEdge, addVertex, addVertex, addVertexBeginning, adjacencyMatrix, adjacentEdges, adjacentVertices, allEdges, edgeBetween, edgeesBetween, edgesBetween, equals, getAdjacentLists, getAllSelfLoopEdges, getAllSinks, getAllSources, getEdges, getTreeLeaves, getVertexByContent, getVertices, graphMaxDegree, hasEdge, hashCode, hasSelfLoopEdges, hasVertex, inDegree, inEdges, isBiconnected, isConnected, isConnected, isCyclic, isDirected, isRing, isSimple, isSink, isSource, isTree, listBiconnectedComponents, listCutVertices, listMultiEdges, outDegree, outEdges, printAdjacencyMatrix, removeEdge, removeVertex, setDirected, setEdges, setVertices, subgraph, toString, vertexDegreepublic SPQRTree(E referenceEdge, Graph<V,E> graph) throws CannotBeAppliedException
referenceEdge - Reference edgegraph - GraphCannotBeAppliedException - if the graph doesn't have a SPQR tree