org.eclipse.draw2d.internal.graph
Class RankAssigmentSolver
java.lang.Object
|
+--org.eclipse.draw2d.internal.graph.GraphVisitor
|
+--org.eclipse.draw2d.internal.graph.SpanningTreeVisitor
|
+--org.eclipse.draw2d.internal.graph.RankAssigmentSolver
- public class RankAssigmentSolver
- extends org.eclipse.draw2d.internal.graph.SpanningTreeVisitor
solves the rank assigment problem on a DirectedGraph containing an initial feasible
spanning tree.
- Since:
- 2.1
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
graph
protected DirectedGraph graph
RankAssigmentSolver
public RankAssigmentSolver()
visit
public void visit(DirectedGraph graph)
- Specified by:
visit
in class GraphVisitor
getTreeHead
protected Node getTreeHead(Edge edge)
getTreeTail
protected Node getTreeTail(Edge edge)
Copyright (c) IBM Corp. and others 2000, 2003. All Rights Reserved.