Uses of Package
graph.algorithms.numbering

Packages that use graph.algorithms.numbering

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

Classes in graph.algorithms.numbering used by graph.algorithms.numbering

Class and Description
Numbering Abstract class meant to be extended by all implementing a numbering algorithm

Classes in graph.algorithms.numbering used by graph.algorithms.planarity

Class and Description
STNumbering 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"