public class DirectedGraphLayout
extends java.lang.Object
DirectedGraph
. The directed graph
must meet the following conditions:
edges
list exactly once.
nodes
list exactly once.
Edge.isFeedback
set to true
. The following
statements are true with respect to the inverted edge. When the algorithm
completes, it will invert the edges again, but will leave the feedback flags
set.
Edge.weight
s. The minimum x value assigned to a node or bendpoint
will be 0.
For each NODE:
For each EDGE:
virtual
nodes. The virtual nodes
will be assigned an x coordinate indicating the routing path for that edge.
isFeedback
flag will be
set, and if it has virtual nodes, they will be in reverse order (bottom-up).
This class is not guaranteed to produce the same results for each invocation.
Constructor and Description |
---|
DirectedGraphLayout() |
Modifier and Type | Method and Description |
---|---|
void |
visit(DirectedGraph graph)
Lays out the given graph
|
public void visit(DirectedGraph graph)
graph
- the graph to layoutCopyright (c) IBM Corp. and others 2000, 2011. All Rights Reserved.