|
Eclipse Draw2d 3.1 |
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.eclipse.draw2d.internal.graph.GraphVisitor
org.eclipse.draw2d.internal.graph.CompoundBreakCycles
This visitor eliminates cycles in the graph via a modified implementation of the greedy cycle removal algorithm for directed graphs. The algorithm has been modified to handle the presence of Subgraphs and compound cycles which may result. This algorithm determines a set of edges which can be inverted and result in a graph without compound cycles.
Constructor Summary | |
CompoundBreakCycles()
|
Method Summary | |
void |
revisit(DirectedGraph g)
Called in reverse order of visit. |
void |
visit(DirectedGraph g)
Act on the given directed graph. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public CompoundBreakCycles()
Method Detail |
public void revisit(DirectedGraph g)
GraphVisitor
revisit
in class GraphVisitor
g
- the graph to act uponpublic void visit(DirectedGraph g)
GraphVisitor
visit
in class GraphVisitor
g
- the graphGraphVisitor.visit(org.eclipse.draw2d.graph.DirectedGraph)
|
Eclipse Draw2d 3.1 |
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |