Uses of Class
graph.algorithms.numbering.Numbering

Packages that use Numbering

Package	Description
graph.algorithms.numbering	Classes represent different numberings of vertices.

Uses of Numbering in graph.algorithms.numbering

Subclasses of Numbering in graph.algorithms.numbering

Modifier and Type	Class and Description
class	DFSNumbering<V extends Vertex,E extends Edge<V>> Represents DFS numbering of a given graph
class	STNumbering<V extends Vertex,E extends Edge<V>> Given any edge {s,t} in a biconnected graph G with n vertices, the vertices can be numbered from 1 to n so that vertex s receives the number 1 and vertex t the number n This is called the st-numbering This implementation is based on an algoritm by Even and Tarjan from their paper titled "Computing an st-numbering"