|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--javautils.collections.Algs | +--suvi.alg.policies.SimplisticNodePositioningPolicy
Calculates coordinates of all nodes in a graph. The y-coordinate of each rank is shared by all nodes in the rank, and is simply the sum of y-coordinate of the previous rank, the minimum vertical gap, half of the ranks height and half of the previous ranks height. The y-coordinate of the first rank of the ranking is half of the ranks height.
The x-coordinate of a node is calculated similarly: it is a sum of the x-coordinate of the previous node in the rank, the minimum horizontal gap, half of the width of the previous node in the rank, and half of the current nodes width. The x-coordinate of the first node of each rank is half of the ranks width.
Field Summary |
Fields inherited from class javautils.collections.Algs |
EMPTY_ARRAY, EMPTY_LIST, EMPTY_MAP, EMPTY_SEQUENCE, EMPTY_SET |
Constructor Summary | |
SimplisticNodePositioningPolicy()
|
Method Summary | |
GraphLayoutAttr[] |
defaultAttrs()
This policy uses the following attributes: NodeExtentAttr
NodeGapAttr
|
NodePositioning |
nodePositioning(javautils.graph.adt.AugmentedGraph original,
javautils.graph.adt.AugmentedGraph preprocessed,
GraphTopology topology,
GraphLayoutAttrMap attrMap,
AugmentedNodeRanking ranking,
AugmentedNodeOrdering ordering)
A node positioning for the graph. |
Methods inherited from class javautils.collections.Algs |
addAll, allSuperInterfaces, asArray, asArray, asComparator, asUnmodifiableList, collect, collectMap, collectSet, collectUnmodifiable, concat, concat, concat, copyOf, copyOf, copyOf, copyOf, copyOf, copyOf, copyOf, copyOf, copyOf, copyOfArray, ensureLength, exists, exists, exists, filter, filter, filter, find, find, find, flatten, flatten, flatten, fold, fold, fold, foldRight, foldRight, foldRight, forAll, forAll, forAll, forEach, forEach, forEach, forEach, forEach, forEach, forEachInProduct, forEachInProduct, forEachInProduct, forEachInProduct, genAddAll, genConcat, genConcat, genForEach, genForEach, getOrIfNull, integersInRange, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iterator, iteratorOverArray, map, map, map, map, map, map, mapMorphism, mapMorphismTo, mapTransform, max, max, max, max, max, max, max, min, min, min, min, min, min, min, newMap, newShapedArray, newUnmodifiableList, putAll, putAll, reverseIterator, reverseIterator, select, select, select, sign, singletonIterator, sort, sort, sorted, sorted, transform, transform, transform |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public SimplisticNodePositioningPolicy()
Method Detail |
public GraphLayoutAttr[] defaultAttrs()
This policy uses the following attributes:
defaultAttrs
in interface GraphLayoutAttrConsumer
public NodePositioning nodePositioning(javautils.graph.adt.AugmentedGraph original, javautils.graph.adt.AugmentedGraph preprocessed, GraphTopology topology, GraphLayoutAttrMap attrMap, AugmentedNodeRanking ranking, AugmentedNodeOrdering ordering)
NodePositioningPolicy
A node positioning for the graph.
nodePositioning
in interface NodePositioningPolicy
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |