Algorithm from the paper "Computing an st-numbering" by Shimon Even and Robert Endre Tarjan. Running time is O(V + E). This method must be called on a biconnected graph.
Namespace: com.mindfusion.graphs
Package: com.mindfusion.graphs
Java Copy Code |
---|
public ArrayList<Vertex> getStNumbering ( |