org.eclipse.draw2d.internal.graph
Class CompoundBreakCycles
java.lang.Object
org.eclipse.draw2d.internal.graph.GraphVisitor
org.eclipse.draw2d.internal.graph.CompoundBreakCycles
- public class CompoundBreakCycles
- extends GraphVisitor
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.
- Since:
- 2.1.2
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
CompoundBreakCycles
public CompoundBreakCycles()
visit
public void visit(DirectedGraph g)
- Description copied from class:
GraphVisitor
- Act on the given directed graph.
- Specified by:
visit in class GraphVisitor
- Parameters:
g - the graph- See Also:
GraphVisitor.visit(org.eclipse.draw2d.graph.DirectedGraph)
Copyright (c) IBM Corp. and others 2000, 2004. All Rights Reserved.