|
Eclipse Draw2d 3.0.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 via an implementation of the Greedy-Cycle-Removal algorithm. |
class |
CompoundBreakCycles
This visitor eliminates cycles in the graph via a modified implementation of the Greedy-Cycle-Removal algorithm. |
class |
CompoundHorizontalPlacement
|
class |
CompoundPopulateRanks
|
class |
CompoundVerticalPlacement
|
class |
ConvertCompoundGraph
|
class |
HorizontalPlacement
|
class |
InitialRankSolver
|
class |
InvertEdges
Graph visitors run prior to this visitor may have inverted edges to remove cycles in the graph. |
class |
LocalOptimizer
This graph visitor examines all adjacent pairs of nodes and determines if swapping the two nodes provides improved graph aesthetics. |
class |
MinCross
|
class |
PlaceEndpoints
|
class |
PopulateRanks
This class takes a DirectedGraph with an optimal rank assigment and a spanning tree, and populates the ranks of the DirectedGraph. |
class |
RankAssigmentSolver
solves the rank assigment problem on a DirectedGraph containing an initial feasible spanning tree. |
class |
RestoreCompoundGraph
|
class |
SortSubgraphs
|
(package private) class |
org.eclipse.draw2d.internal.graph.SpanningTreeVisitor
|
class |
TightSpanningTreeSolver
|
class |
VerticalPlacement
|
|
Eclipse Draw2d 3.0.1 |
||||||||||
PREV NEXT | FRAMES NO FRAMES |