suvi.alg.util
Class NodeOrderingPolicies

java.lang.Object
  |
  +--javautils.collections.Algs
        |
        +--javautils.graph.Graphs
              |
              +--suvi.alg.util.NodeOrderingPolicies
Direct Known Subclasses:
HeuristicNodeOrderingPolicy, NodeOrderingPolicyDecorator, SimplisticNodeOrderingPolicy

public class NodeOrderingPolicies
extends javautils.graph.Graphs

Static utility methods especially for node ordering policies.


Field Summary
 
Fields inherited from class javautils.collections.Algs
EMPTY_ARRAY, EMPTY_LIST, EMPTY_MAP, EMPTY_SEQUENCE, EMPTY_SET
 
Constructor Summary
NodeOrderingPolicies()
           
 
Method Summary
static javautils.maps.ObjectToIntMap asMap(javautils.graph.adt.Graph preprocessed, NodeOrdering ordering)
           
static java.lang.Object[][] asTable(javautils.graph.adt.Graph preprocessed, AugmentedNodeRanking ranking, javautils.maps.ObjectToIntMap nodeToColMap)
           
static int crossings(javautils.graph.adt.Graph preprocessed, AugmentedNodeRanking ranking, javautils.maps.ObjectToIntMap nodeToColMap)
          Computes edge crossings in O(E*log(E)+N) time.
static javautils.maps.ObjectToIntMap initialOrdering(javautils.graph.adt.AugmentedGraph preprocessed, AugmentedNodeRanking ranking)
           
static NodeOrdering newNodeOrdering(javautils.maps.ObjectToIntMap nodeToColMap)
           
 
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

NodeOrderingPolicies

public NodeOrderingPolicies()
Method Detail

initialOrdering

public static javautils.maps.ObjectToIntMap initialOrdering(javautils.graph.adt.AugmentedGraph preprocessed,
                                                            AugmentedNodeRanking ranking)

newNodeOrdering

public static NodeOrdering newNodeOrdering(javautils.maps.ObjectToIntMap nodeToColMap)

asMap

public static javautils.maps.ObjectToIntMap asMap(javautils.graph.adt.Graph preprocessed,
                                                  NodeOrdering ordering)

asTable

public static java.lang.Object[][] asTable(javautils.graph.adt.Graph preprocessed,
                                           AugmentedNodeRanking ranking,
                                           javautils.maps.ObjectToIntMap nodeToColMap)

crossings

public static int crossings(javautils.graph.adt.Graph preprocessed,
                            AugmentedNodeRanking ranking,
                            javautils.maps.ObjectToIntMap nodeToColMap)

Computes edge crossings in O(E*log(E)+N) time.