|
Eclipse Draw2d 3.1 |
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use GraphVisitor | |
org.eclipse.draw2d.graph | |
org.eclipse.draw2d.internal.graph |
Uses of GraphVisitor in org.eclipse.draw2d.graph |
Subclasses of GraphVisitor in org.eclipse.draw2d.graph | |
class |
CompoundDirectedGraphLayout
Performs a graph layout on a CompoundDirectedGraph . |
class |
DirectedGraphLayout
Performs a graph layout of a DirectedGraph . |
Uses of GraphVisitor in org.eclipse.draw2d.internal.graph |
Subclasses of GraphVisitor in org.eclipse.draw2d.internal.graph | |
class |
BreakCycles
This visitor eliminates cycles in the graph using a "greedy" heuristic. |
class |
CompoundBreakCycles
This visitor eliminates cycles in the graph via a modified implementation of the greedy cycle removal algorithm for directed graphs. |
class |
CompoundHorizontalPlacement
Calculates the X-coordinates for nodes in a compound directed graph. |
class |
CompoundPopulateRanks
Places nodes into ranks for a compound directed graph. |
class |
CompoundVerticalPlacement
calculates the height and y-coordinates for nodes and subgraphs in a compound directed graph. |
class |
ConvertCompoundGraph
Converts a compound directed graph into a simple directed graph. |
class |
HorizontalPlacement
Assigns the X and width values for nodes in a directed graph. |
class |
InitialRankSolver
Assigns a valid rank assignment to all nodes based on their edges. |
class |
InvertEdges
Inverts any edges which are marked as backwards or "feedback" edges. |
class |
LocalOptimizer
This graph visitor examines all adjacent pairs of nodes and determines if swapping the two nodes provides improved graph aesthetics. |
class |
MinCross
Sweeps up and down the ranks rearranging them so as to reduce edge crossings. |
class |
PlaceEndpoints
|
class |
PopulateRanks
This class takes a DirectedGraph with an optimal rank assignment and a spanning tree, and populates the ranks of the DirectedGraph. |
class |
RankAssigmentSolver
Assigns the final rank assignment for a DirectedGraph with an initial feasible spanning tree. |
class |
SortSubgraphs
Performs a topological sort from left to right of the subgraphs in a compound directed graph. |
(package private) class |
org.eclipse.draw2d.internal.graph.SpanningTreeVisitor
A base class for visitors which operate on the graphs spanning tree used to induce rank assignments. |
class |
TightSpanningTreeSolver
Finds a tight spanning tree from the graphs edges which induce a valid rank assignment. |
class |
VerticalPlacement
Assigns the Y and Height values to the nodes in the graph. |
|
Eclipse Draw2d 3.1 |
||||||||||
PREV NEXT | FRAMES NO FRAMES |