org.eclipse.draw2d.internal.graph
Class InitialRankSolver
java.lang.Object
org.eclipse.draw2d.internal.graph.GraphVisitor
org.eclipse.draw2d.internal.graph.InitialRankSolver
- public class InitialRankSolver
- extends GraphVisitor
Assigns a valid rank assignment to all nodes based on their edges. The assignment is
not optimal in that it does not provide the minimum global length of edge lengths.
- Since:
- 2.1.2
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
graph
protected DirectedGraph graph
candidates
protected EdgeList candidates
members
protected NodeList members
InitialRankSolver
public InitialRankSolver()
visit
public void visit(DirectedGraph graph)
- Description copied from class:
GraphVisitor
- Act on the given directed graph.
- Specified by:
visit
in class GraphVisitor
- Parameters:
graph
- the graph
solve
protected void solve()
Copyright (c) IBM Corp. and others 2000, 2005. All Rights Reserved.