|
Eclipse Draw2d 3.1 |
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.eclipse.draw2d.internal.graph.GraphVisitor
org.eclipse.draw2d.graph.DirectedGraphLayout
Performs a graph layout of a 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 Summary | |
DirectedGraphLayout()
|
Method Summary | |
void |
visit(DirectedGraph graph)
Act on the given directed graph. |
Methods inherited from class org.eclipse.draw2d.internal.graph.GraphVisitor |
revisit |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public DirectedGraphLayout()
Method Detail |
public void visit(DirectedGraph graph)
GraphVisitor
visit
in class GraphVisitor
graph
- the graphGraphVisitor.visit(org.eclipse.draw2d.graph.DirectedGraph)
|
Eclipse Draw2d 3.1 |
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |