org.eclipse.draw2d.internal.graph
Class TightSpanningTreeSolver
java.lang.Object
org.eclipse.draw2d.internal.graph.GraphVisitor
org.eclipse.draw2d.internal.graph.SpanningTreeVisitor
org.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
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
graph
protected DirectedGraph graph
candidates
protected org.eclipse.draw2d.internal.graph.TightSpanningTreeSolver.CandidateList candidates
members
protected NodeList members
TightSpanningTreeSolver
public TightSpanningTreeSolver()
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)
Copyright (c) IBM Corp. and others 2000, 2005. All Rights Reserved.