Class Summary |
BreakCycles |
This visitor eliminates cycles in the graph using a "greedy" heuristic. |
CompoundBreakCycles |
This visitor eliminates cycles in the graph via a modified implementation of the
greedy cycle removal algorithm for directed graphs. |
CompoundHorizontalPlacement |
Calculates the X-coordinates for nodes in a compound directed graph. |
CompoundPopulateRanks |
Places nodes into ranks for a compound directed graph. |
CompoundRankSorter |
Sorts nodes in a compound directed graph. |
CompoundVerticalPlacement |
calculates the height and y-coordinates for nodes and subgraphs in a compound directed
graph. |
ConvertCompoundGraph |
Converts a compound directed graph into a simple directed graph. |
GraphUtilities |
Some utility methods for graphs. |
GraphVisitor |
Performs some action on a Graph. |
HorizontalPlacement |
Assigns the X and width values for nodes in a directed graph. |
InitialRankSolver |
Assigns a valid rank assignment to all nodes based on their edges. |
InvertEdges |
Inverts any edges which are marked as backwards or "feedback" edges. |
LocalOptimizer |
This graph visitor examines all adjacent pairs of nodes and determines if
swapping the two nodes provides improved graph aesthetics. |
MinCross |
Sweeps up and down the ranks rearranging them so as to reduce edge crossings. |
NodePair |
|
PlaceEndpoints |
|
PopulateRanks |
This class takes a DirectedGraph with an optimal rank assignment and a spanning tree,
and populates the ranks of the DirectedGraph. |
RankAssigmentSolver |
Assigns the final rank assignment for a DirectedGraph with an initial feasible
spanning tree. |
RevertableChange |
|
SortSubgraphs |
Performs a topological sort from left to right of the subgraphs in a compound directed
graph. |
TightSpanningTreeSolver |
Finds a tight spanning tree from the graphs edges which induce a valid rank assignment.
|
VerticalPlacement |
Assigns the Y and Height values to the nodes in the graph. |
VirtualNodeCreation |
Encapsulates the conversion of a long edge to multiple short edges and back. |