Eclipse Draw2d
3.1

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

Assigns the final rank assignment for a DirectedGraph with an initial feasible spanning tree.

Since:
2.1.2

Field Summary
protected  DirectedGraph graph
           
 
Constructor Summary
RankAssigmentSolver()
           
 
Method Summary
protected  Node getTreeHead(Edge edge)
           
protected  Node getTreeTail(Edge edge)
           
 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
Constructor Detail

RankAssigmentSolver

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

getTreeHead

protected Node getTreeHead(Edge edge)

getTreeTail

protected Node getTreeTail(Edge edge)

Eclipse Draw2d
3.1

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