|
Eclipse Draw2d 3.1 |
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use DirectedGraph | |
org.eclipse.draw2d.graph | Stand-alone algorithms related to Graph Drawing. |
org.eclipse.draw2d.internal.graph | Internal support for the org.eclipse.draw2d.graph package. |
Uses of DirectedGraph in org.eclipse.draw2d.graph |
Subclasses of DirectedGraph in org.eclipse.draw2d.graph | |
class |
CompoundDirectedGraph
A DirectedGraph whose Nodes may be compound Subgraph s, which may
contain other nodes. |
Fields in org.eclipse.draw2d.graph declared as DirectedGraph | |
DirectedGraph |
DirectedGraph.gPrime
For internal use only. |
Methods in org.eclipse.draw2d.graph with parameters of type DirectedGraph | |
void |
CompoundDirectedGraphLayout.visit(DirectedGraph graph)
Lays out the given compound directed graph. |
void |
DirectedGraphLayout.visit(DirectedGraph graph)
|
Uses of DirectedGraph in org.eclipse.draw2d.internal.graph |
Fields in org.eclipse.draw2d.internal.graph declared as DirectedGraph | |
protected DirectedGraph |
RankAssigmentSolver.graph
|
protected DirectedGraph |
InitialRankSolver.graph
|
DirectedGraph |
HorizontalPlacement.graph
|
DirectedGraph |
HorizontalPlacement.prime
|
protected DirectedGraph |
TightSpanningTreeSolver.graph
|
Methods in org.eclipse.draw2d.internal.graph with parameters of type DirectedGraph | |
void |
RankAssigmentSolver.visit(DirectedGraph graph)
|
void |
CompoundVerticalPlacement.visit(DirectedGraph dg)
|
void |
LocalOptimizer.visit(DirectedGraph g)
|
void |
VerticalPlacement.visit(DirectedGraph g)
|
void |
CompoundRankSorter.init(DirectedGraph g)
|
void |
SortSubgraphs.visit(DirectedGraph dg)
|
static boolean |
GraphUtilities.isCyclic(DirectedGraph graph)
Returns true if the given graph contains at least one cycle. |
static int |
GraphUtilities.numberOfCrossingsInGraph(DirectedGraph graph)
Counts the number of edge crossings in a DirectedGraph |
void |
PopulateRanks.visit(DirectedGraph g)
|
void |
PopulateRanks.revisit(DirectedGraph g)
|
void |
InitialRankSolver.visit(DirectedGraph graph)
|
void |
BreakCycles.visit(DirectedGraph g)
|
void |
PlaceEndpoints.visit(DirectedGraph g)
|
void |
CompoundPopulateRanks.visit(DirectedGraph g)
|
void |
CompoundBreakCycles.revisit(DirectedGraph g)
|
void |
CompoundBreakCycles.visit(DirectedGraph g)
|
void |
CompoundHorizontalPlacement.visit(DirectedGraph g)
|
void |
HorizontalPlacement.visit(DirectedGraph g)
|
void |
MinCross.visit(DirectedGraph g)
|
void |
TightSpanningTreeSolver.visit(DirectedGraph graph)
|
void |
ConvertCompoundGraph.revisit(DirectedGraph g)
|
void |
ConvertCompoundGraph.visit(DirectedGraph dg)
|
void |
InvertEdges.visit(DirectedGraph g)
|
abstract void |
GraphVisitor.visit(DirectedGraph g)
Act on the given directed graph. |
void |
GraphVisitor.revisit(DirectedGraph g)
Called in reverse order of visit. |
Constructors in org.eclipse.draw2d.internal.graph with parameters of type DirectedGraph | |
VirtualNodeCreation(Edge edge,
DirectedGraph graph)
Breaks a single edge into multiple edges containing virtual nodes. |
|
Eclipse Draw2d 3.1 |
||||||||||
PREV NEXT | FRAMES NO FRAMES |