|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.eclipse.draw2d.internal.graph.GraphVisitor
org.eclipse.draw2d.internal.graph.SpanningTreeVisitor
org.eclipse.draw2d.internal.graph.RankAssigmentSolver
solves the rank assigment problem on a DirectedGraph containing an initial feasible spanning tree.
Field Summary | |
protected DirectedGraph |
graph
|
Constructor Summary | |
RankAssigmentSolver()
|
Method Summary | |
protected Node |
getTreeHead(Edge edge)
|
protected Node |
getTreeTail(Edge edge)
|
void |
visit(DirectedGraph graph)
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
protected DirectedGraph graph
Constructor Detail |
public RankAssigmentSolver()
Method Detail |
public void visit(DirectedGraph graph)
visit
in class GraphVisitor
protected Node getTreeHead(Edge edge)
protected Node getTreeTail(Edge edge)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |