org.eclipse.draw2d.internal.graph
Class RankAssigmentSolver

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

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

graph

protected DirectedGraph graph
Constructor Detail

RankAssigmentSolver

public RankAssigmentSolver()
Method Detail

visit

public void visit(DirectedGraph graph)
Specified by:
visit in class GraphVisitor

getTreeHead

protected Node getTreeHead(Edge edge)

getTreeTail

protected Node getTreeTail(Edge edge)