graph.algorithms.numbering

Class STNumbering<V extends Vertex,E extends Edge<V>>

java.lang.Object

graph.algorithms.numbering.Numbering<V,E>

graph.algorithms.numbering.STNumbering<V,E>

Type Parameters:

V - The vertex type

E - The edge type

public class STNumbering<V extends Vertex,E extends Edge<V>>
extends Numbering<V,E>

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"

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
STNumbering(Graph<V,E> graph, V s, V t)

Method Summary

Modifier and Type	Method and Description
void	formOrder(Graph<V,E> graph, V s, V t) Forms the st-order
java.util.Map<V,java.lang.Integer>	getNumbering()

Methods inherited from class graph.algorithms.numbering.Numbering

getOrder, numberOf

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

STNumbering

public STNumbering(Graph<V,E> graph,
                   V s,
                   V t)

Method Detail

formOrder

public void formOrder(Graph<V,E> graph,
                      V s,
                      V t)

Forms the st-order

Parameters:

graph - Graph

s - The first (S) vertex

t - The last (T) vertex

getNumbering

public java.util.Map<V,java.lang.Integer> getNumbering()

Returns:

the numbering