Eclipse Draw2d
3.1

org.eclipse.draw2d.internal.graph
Class TightSpanningTreeSolver

java.lang.Object
  extended byorg.eclipse.draw2d.internal.graph.GraphVisitor
      extended byorg.eclipse.draw2d.internal.graph.SpanningTreeVisitor
          extended byorg.eclipse.draw2d.internal.graph.TightSpanningTreeSolver

public class TightSpanningTreeSolver
extends org.eclipse.draw2d.internal.graph.SpanningTreeVisitor

Finds a tight spanning tree from the graphs edges which induce a valid rank assignment. This process requires that the nodes be initially given a feasible ranking.

Since:
2.1.2

Field Summary
protected  org.eclipse.draw2d.internal.graph.TightSpanningTreeSolver.CandidateList candidates
           
protected  DirectedGraph graph
           
protected  NodeList members
           
 
Constructor Summary
TightSpanningTreeSolver()
           
 
Method Summary
protected  Node getTreeHead(Edge edge)
           
protected  Node getTreeTail(Edge edge)
           
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 org.eclipse.draw2d.internal.graph.TightSpanningTreeSolver.CandidateList candidates

members

protected NodeList members
Constructor Detail

TightSpanningTreeSolver

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

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.