Eclipse Draw2d
3.0

Package org.eclipse.draw2d.internal.graph

Class Summary
BreakCycles This visitor eliminates cycles in the graph using a "greedy" heuristic.
CompoundBreakCycles This visitor eliminates cycles in the graph via a modified implementation of the greedy cycle removal algorithm for directed graphs.
CompoundHorizontalPlacement Calculates the X-coordinates for nodes in a compound directed graph.
CompoundPopulateRanks  
CompoundRankSorter  
CompoundVerticalPlacement calculates the height and y-coordinates for nodes and subgraphs in a compound directed graph.
ConvertCompoundGraph Converts a compound directed graph into a simple directed graph.
GraphUtilities Some utility methods for graphs.
GraphVisitor Performs some action on a Graph.
HorizontalPlacement  
InitialRankSolver  
InvertEdges Inverts any edges which are marked as backwards or "feedback" edges.
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 Assigns the final rank assignment for a DirectedGraph with an initial feasible spanning tree.
RestoreCompoundGraph  
SortSubgraphs  
TightSpanningTreeSolver Finds a tight spanning tree from the graphs edges which induce a valid rank assignment.
VerticalPlacement Assigns the Y and Height values to the nodes in the graph.
 


Eclipse Draw2d
3.0

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