Eclipse Draw2d
3.1

org.eclipse.draw2d.internal.graph
Class CompoundBreakCycles

java.lang.Object
  extended byorg.eclipse.draw2d.internal.graph.GraphVisitor
      extended byorg.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

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

CompoundBreakCycles

public CompoundBreakCycles()
Method Detail

revisit

public void revisit(DirectedGraph g)
Description copied from class: GraphVisitor
Called in reverse order of visit.

Overrides:
revisit in class GraphVisitor
Parameters:
g - the graph to act upon

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)

Eclipse Draw2d
3.1

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