Eclipse Draw2d
3.0.1

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, or containing 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 DirectedGraphLayout.visit(DirectedGraph graph)
           
 void CompoundDirectedGraphLayout.visit(DirectedGraph g)
           
 

Uses of DirectedGraph in org.eclipse.draw2d.internal.graph
 

Fields in org.eclipse.draw2d.internal.graph declared as DirectedGraph
protected  DirectedGraph TightSpanningTreeSolver.graph
           
protected  DirectedGraph RankAssigmentSolver.graph
           
protected  DirectedGraph InitialRankSolver.graph
           
 DirectedGraph HorizontalPlacement.graph
           
 DirectedGraph HorizontalPlacement.prime
           
 

Methods in org.eclipse.draw2d.internal.graph with parameters of type DirectedGraph
 void VerticalPlacement.visit(DirectedGraph g)
           
 void TightSpanningTreeSolver.visit(DirectedGraph graph)
           
 void SortSubgraphs.visit(DirectedGraph dg)
           
 void RestoreCompoundGraph.visit(DirectedGraph g)
           
 void RankAssigmentSolver.visit(DirectedGraph graph)
           
 void PopulateRanks.visit(DirectedGraph g)
           
 void PlaceEndpoints.visit(DirectedGraph g)
           
 void MinCross.visit(DirectedGraph g)
           
 void LocalOptimizer.visit(DirectedGraph g)
           
 void InvertEdges.visit(DirectedGraph g)
           
 void InitialRankSolver.visit(DirectedGraph graph)
           
 void HorizontalPlacement.visit(DirectedGraph g)
           
abstract  void GraphVisitor.visit(DirectedGraph g)
           
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 ConvertCompoundGraph.visit(DirectedGraph dg)
           
 void CompoundVerticalPlacement.visit(DirectedGraph dg)
           
 void CompoundRankSorter.init(DirectedGraph g)
           
 void CompoundHorizontalPlacement.visit(DirectedGraph g)
           
 void CompoundBreakCycles.visit(DirectedGraph g)
           
 void BreakCycles.visit(DirectedGraph g)
           
 


Eclipse Draw2d
3.0.1

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