Eclipse Draw2d
3.1

org.eclipse.draw2d.internal.graph
Class InitialRankSolver

java.lang.Object
  extended byorg.eclipse.draw2d.internal.graph.GraphVisitor
      extended byorg.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

Field Summary
protected  EdgeList candidates
           
protected  DirectedGraph graph
           
protected  NodeList members
           
 
Constructor Summary
InitialRankSolver()
           
 
Method Summary
protected  void solve()
           
 void visit(DirectedGraph graph)
          Act on the given directed graph.
 
Methods inherited from class org.eclipse.draw2d.internal.graph.GraphVisitor
revisit
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

graph

protected DirectedGraph graph

candidates

protected EdgeList candidates

members

protected NodeList members
Constructor Detail

InitialRankSolver

public InitialRankSolver()
Method Detail

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()

Eclipse Draw2d
3.1

Copyright (c) IBM Corp. and others 2000, 2005. All Rights Reserved.