|
Search this API | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object y.layout.hierarchic.TopologicalLayerer
public class TopologicalLayerer
This class implements the first phase of the Sugiyama algorithm. It uses topological sorting to assign layers to the nodes.
Field Summary | |
---|---|
static byte |
DOWN_SHIFT
Ranking policy specifier. |
static byte |
NO_RERANKING
Ranking policy specifier. |
static byte |
TIGHT_TREE
Ranking policy specifier. |
Constructor Summary | |
---|---|
TopologicalLayerer()
|
Method Summary | |
---|---|
void |
assignLayers(LayoutGraph graph,
Layers layers,
LayoutDataProvider ldp)
This method assigns all nodes in the graph to layers and registers them in the Layers instance. |
int |
assignNodeLayer(LayoutGraph g,
NodeMap layer,
EdgeList reversedEdges)
This method assigns the nodes in the graph to layers. |
byte |
getRankingPolicy()
Returns the currently active ranking policy within this layerer. |
void |
setRankingPolicy(byte p)
Sets the (re)ranking policy used within this layerer. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
public static final byte NO_RERANKING
public static final byte DOWN_SHIFT
public static final byte TIGHT_TREE
Constructor Detail |
---|
public TopologicalLayerer()
Method Detail |
---|
public void setRankingPolicy(byte p)
NO_RERANKING
is set.
p
- one of NO_RERANKING
, DOWN_SHIFT
and
TIGHT_TREE
.public byte getRankingPolicy()
setRankingPolicy(byte)
public int assignNodeLayer(LayoutGraph g, NodeMap layer, EdgeList reversedEdges)
g
- the graph for which the layers are determined.layer
- here the layers are storedreversedEdges
- here the edges are stored which had been reversed.
public void assignLayers(LayoutGraph graph, Layers layers, LayoutDataProvider ldp)
Layerer
Layers
instance. In order to create new layers, the factory
method Layers.insert(byte, int)
must be used.
assignLayers
in interface Layerer
graph
- the graph that contains the nodes that should be distributed
into the layerslayers
- the object that will be filled with the results of the
calculationldp
- LayoutDataProvider that can be used to query information about
the nodes - note that positional information
(see NodeData.getPosition()
and NodeData.getLayer()
) cannot
be available at any time.Layers.insert(byte, int)
,
Layer.add(y.base.Node)
|
© Copyright 2000-2013, yWorks GmbH. All rights reserved. |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |