suvi.alg.policies
Class SimplisticNodeRankingPolicy

java.lang.Object
  |
  +--javautils.collections.Algs
        |
        +--javautils.graph.Graphs
              |
              +--suvi.alg.util.NodeRankingPolicies
                    |
                    +--suvi.alg.policies.SimplisticNodeRankingPolicy

All Implemented Interfaces:

GraphLayoutAttrConsumer, NodeRankingPolicy

public class SimplisticNodeRankingPolicy

extends NodeRankingPolicies

implements NodeRankingPolicy

Assigns ranks by considering nodes in decreasing DFS finishing order and selecting the minimum rank for each node that does not create backwards going edges. As long as the graph is acyclic, the resulting ranking will not have backwards going edges.

Nested Class Summary

Nested classes inherited from class suvi.alg.util.NodeRankingPolicies

NodeRankingPolicies.SpanningTree

Field Summary

Fields inherited from class javautils.collections.Algs

EMPTY_ARRAY, EMPTY_LIST, EMPTY_MAP, EMPTY_SEQUENCE, EMPTY_SET

Constructor Summary

SimplisticNodeRankingPolicy()

Method Summary

GraphLayoutAttr[]	defaultAttrs() This policy uses the following attributes: EdgeMinLengthAttr
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 suvi.alg.util.NodeRankingPolicies

edgeToMinLengthMap, edgeToWeightMap, feasibleTree, initialRanking, networkSimplex, newNodeRanking, normalize

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

SimplisticNodeRankingPolicy

public SimplisticNodeRankingPolicy()

Method Detail

defaultAttrs

public GraphLayoutAttr[] defaultAttrs()

This policy uses the following attributes:

• EdgeMinLengthAttr

Specified by:

defaultAttrs in interface GraphLayoutAttrConsumer

nodeRanking

public NodeRanking nodeRanking(javautils.graph.adt.AugmentedGraph original,
                               javautils.graph.adt.AugmentedGraph preprocessed,
                               GraphTopology topology,
                               GraphLayoutAttrMap attrMap)

Description copied from interface: NodeRankingPolicy

A node ranking for the graph.

Specified by:

nodeRanking in interface NodeRankingPolicy