|
||||||||||
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.contracts.Asserts | +--suvi.alg.contracts.EdgeRoutingPolicyContract
Design-by-Contract decorator for the EdgeRoutingPolicy
-interface.
Field Summary |
Fields inherited from class javautils.collections.Algs |
EMPTY_ARRAY, EMPTY_LIST, EMPTY_MAP, EMPTY_SEQUENCE, EMPTY_SET |
Fields inherited from interface suvi.api.alg.attr.EdgeLabelConstants |
EL_CENTER_LABEL, EL_HEAD_LABEL, EL_MAX_LABEL, EL_MIN_LABEL, EL_TAIL_LABEL |
Constructor Summary | |
EdgeRoutingPolicyContract(EdgeRoutingPolicy original)
|
Method Summary | |
GraphLayoutAttr[] |
defaultAttrs()
Default implementations of all the required attributes. |
EdgeRouting |
edgeRouting(javautils.graph.adt.AugmentedGraph original,
javautils.graph.adt.AugmentedGraph preprocessed,
GraphTopology topology,
GraphLayoutAttrMap attrMap,
AugmentedNodeRanking ranking,
AugmentedNodeOrdering ordering,
AugmentedNodePositioning positioning)
Edge routing for the graph. |
protected void |
edgeRoutingPost(javautils.graph.adt.AugmentedGraph original,
javautils.graph.adt.AugmentedGraph preprocessed,
GraphTopology topology,
GraphLayoutAttrMap attrMap,
AugmentedNodeRanking ranking,
AugmentedNodeOrdering ordering,
AugmentedNodePositioning positioning,
EdgeRouting routing)
|
protected void |
edgeRoutingPre(javautils.graph.adt.AugmentedGraph original,
javautils.graph.adt.AugmentedGraph preprocessed,
GraphTopology topology,
GraphLayoutAttrMap attrMap,
AugmentedNodeRanking ranking,
AugmentedNodeOrdering ordering,
AugmentedNodePositioning positioning)
|
Methods inherited from class suvi.alg.contracts.Asserts |
verifyContainsAllDefaults, verifyForAllNotNull, verifyForAllNotNull, verifyMatches, verifyTrue, verifyTrue, verifyValidAttrMap, verifyValidDefaults, verifyValidGap, verifyValidLayout, verifyValidRanking, verifyValidSpline, verifyValidTopology |
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 |
Constructor Detail |
public EdgeRoutingPolicyContract(EdgeRoutingPolicy original)
Method Detail |
public GraphLayoutAttr[] defaultAttrs()
GraphLayoutAttrConsumer
Default implementations of all the required attributes. The
returned array must not contain duplicates nor null
references.
defaultAttrs
in interface GraphLayoutAttrConsumer
public EdgeRouting edgeRouting(javautils.graph.adt.AugmentedGraph original, javautils.graph.adt.AugmentedGraph preprocessed, GraphTopology topology, GraphLayoutAttrMap attrMap, AugmentedNodeRanking ranking, AugmentedNodeOrdering ordering, AugmentedNodePositioning positioning)
EdgeRoutingPolicy
Edge routing for the graph.
edgeRouting
in interface EdgeRoutingPolicy
protected void edgeRoutingPre(javautils.graph.adt.AugmentedGraph original, javautils.graph.adt.AugmentedGraph preprocessed, GraphTopology topology, GraphLayoutAttrMap attrMap, AugmentedNodeRanking ranking, AugmentedNodeOrdering ordering, AugmentedNodePositioning positioning)
protected void edgeRoutingPost(javautils.graph.adt.AugmentedGraph original, javautils.graph.adt.AugmentedGraph preprocessed, GraphTopology topology, GraphLayoutAttrMap attrMap, AugmentedNodeRanking ranking, AugmentedNodeOrdering ordering, AugmentedNodePositioning positioning, EdgeRouting routing)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |