Eclipse Draw2d
2.1

Package org.eclipse.draw2d.internal.graph

Class Summary
BreakCycles This visitor eliminates cycles in the graph via an implementation of the Greedy-Cycle-Removal algorithm.
CompoundBreakCycles This visitor eliminates cycles in the graph via a modified implementation of the Greedy-Cycle-Removal algorithm.
CompoundHorizontalPlacement  
CompoundPopulateRanks  
CompoundRankSorter  
CompoundVerticalPlacement  
ConvertCompoundGraph  
GraphUtilities Some utility methods for graphs.
GraphVisitor  
HorizontalPlacement  
InitialRankSolver  
InvertEdges Graph visitors run prior to this visitor may have inverted edges to remove cycles in the graph.
LocalOptimizer This graph visitor examines all adjacent pairs of nodes and determines if swapping the two nodes provides improved graph aesthetics.
MinCross  
NodePair  
PlaceEndpoints  
PopulateRanks This class takes a DirectedGraph with an optimal rank assigment and a spanning tree, and populates the ranks of the DirectedGraph.
RankAssigmentSolver solves the rank assigment problem on a DirectedGraph containing an initial feasible spanning tree.
RestoreCompoundGraph  
SortSubgraphs  
TightSpanningTreeSolver  
VerticalPlacement  
 


Eclipse Draw2d
2.1

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