|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--jdsl.graph.algo.AbstractTopologicalSort | +--jdsl.graph.algo.UnitWeightedTopologicalNumbering
This algorithm class computes the optimal unit-weighted topological numbering for a given DAG. Each Vertex is assigned a non-unique order-number. The number of a given Vertex is equal to 1 plus the highest value of any of its predecessors' numbers. The order-number of a Vertex may be retrieved using the number(Vertex) method.
AbstractTopologicalSort
Fields inherited from class jdsl.graph.algo.AbstractTopologicalSort |
graph_, is_cyclic_, NUMBER_KEY_, queue_ |
Constructor Summary | |
UnitWeightedTopologicalNumbering()
Constructor |
Method Summary | |
protected void |
sort()
The meat of the algorithm. |
Methods inherited from class jdsl.graph.algo.AbstractTopologicalSort |
cleanup, execute, init, isCyclic, number |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public UnitWeightedTopologicalNumbering()
Method Detail |
protected final void sort()
sort
in class AbstractTopologicalSort
jdsl.graph.algo.AbstractTopologicalSort
TopologicalSort
,
UnitWeightedTopologicalNumbering
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |