|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Object
|
+--javautils.collections.Algs
|
+--javautils.graph.Graphs
|
+--suvi.alg.util.NodeRankingPolicyDecorator
A basic forwarding Decorator [Gamma1995] for
NodeRankingPolicy-classes.
| Field Summary | |
protected NodeRankingPolicy |
original
|
| Fields inherited from class javautils.collections.Algs |
EMPTY_ARRAY, EMPTY_LIST, EMPTY_MAP, EMPTY_SEQUENCE, EMPTY_SET |
| Constructor Summary | |
NodeRankingPolicyDecorator(NodeRankingPolicy original)
|
|
| Method Summary | |
GraphLayoutAttr[] |
defaultAttrs()
Default implementations of all the required attributes. |
NodeRanking |
nodeRanking(javautils.graph.adt.AugmentedGraph original,
javautils.graph.adt.AugmentedGraph preprocessed,
GraphTopology topology,
GraphLayoutAttrMap attrMap)
A node ranking for the graph. |
| Methods inherited from class javautils.graph.Graphs |
asSourceTargetPair, asString, asString, augmented, connectedComponents, edges, edgeSet, forEachEdge, forEachNode, inducedByEdgesAndContainingNodes, invariant, isAcyclic, isIncoming, isSelf, nodesByDecreasingDfsFinishingTime, nodesByIncreasingIndegree, nodesByIncreasingOutdegree, nodeSet, nodesReachableFrom, nodesReachableFrom, nodesReachableFrom, otherNode, randomGraph, restrictedToNodes, restrictedToNodes, restrictedToNodes, sameNodesAndEdges, stronglyConnectedComponents, transitiveIrreflexiveClosure, transposed, transposed, undirected |
| 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 |
| Field Detail |
protected final NodeRankingPolicy original
| Constructor Detail |
public NodeRankingPolicyDecorator(NodeRankingPolicy original)
| Method Detail |
public GraphLayoutAttr[] defaultAttrs()
GraphLayoutAttrConsumerDefault implementations of all the required attributes. The
returned array must not contain duplicates nor null
references.
defaultAttrs in interface GraphLayoutAttrConsumer
public NodeRanking nodeRanking(javautils.graph.adt.AugmentedGraph original,
javautils.graph.adt.AugmentedGraph preprocessed,
GraphTopology topology,
GraphLayoutAttrMap attrMap)
NodeRankingPolicyA node ranking for the graph.
nodeRanking in interface NodeRankingPolicy
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||