Package org.jungrapht.visualization.layout.algorithms.sugiyama

Class LevelCross<V,E>

java.lang.Object

org.jungrapht.visualization.layout.algorithms.sugiyama.LevelCross<V,E>

Type Parameters:

V - vertex type

E - edge type

public class LevelCross<V,E>
extends Object

Implementation of the LevelCross algorithm

See Also:

"An E log E Line Crossing Algorithm for Levelled Graphs. Vance Waddle and Ashok Malhotra IBM Thomas J. Watson Research Center", "Simple and Efficient Bilayer Cross Counting. Wilhelm Barth, Petra Mutzel, Institut für Computergraphik und Algorithmen Technische Universität Wien, Michael Jünger, Institut für Informatik Universität zu Köln"

Constructor Summary

Constructors

Constructor	Description
LevelCross(List<LE<V,E>> edgeList, int levelSize, int levelRank, int successorLevelSize, int successorLevelRank)
LevelCross(org.jgrapht.Graph<LV<V>,LE<V,E>> graph, int levelSize, int levelRank, int successorLevelSize, int successorLevelRank)

Method Summary

Modifier and Type	Method	Description
AccumulatorTree	getLevelTree()
AccumulatorTree	getSuccessorTree()
int	levelCross()
String	toString()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

LevelCross

public LevelCross(org.jgrapht.Graph<LV<V>,LE<V,E>> graph,
                  int levelSize,
                  int levelRank,
                  int successorLevelSize,
                  int successorLevelRank)

LevelCross

public LevelCross(List<LE<V,E>> edgeList,
                  int levelSize,
                  int levelRank,
                  int successorLevelSize,
                  int successorLevelRank)

Method Detail

getLevelTree

public AccumulatorTree getLevelTree()

getSuccessorTree

public AccumulatorTree getSuccessorTree()

levelCross

public int levelCross()

toString

public String toString()

Overrides:

toString in class Object