Uses of Class
org.eclipse.draw2d.graph.DirectedGraph

Packages that use DirectedGraph

org.eclipse.draw2d.graph
org.eclipse.draw2d.internal.graph

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 Subgraphs, 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 g)
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	RestoreCompoundGraph.visit(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	InitialRankSolver.visit(DirectedGraph graph)
void	BreakCycles.visit(DirectedGraph g)
void	PlaceEndpoints.visit(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.visit(DirectedGraph dg)
void	InvertEdges.visit(DirectedGraph g)
abstract void	GraphVisitor.visit(DirectedGraph g) Act on the given directed graph.