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

Class GraphLayers

java.lang.Object

org.jungrapht.visualization.layout.algorithms.sugiyama.GraphLayers

public class GraphLayers
extends Object

Method Summary

Modifier and Type	Method	Description
static <V,E> List<List<LV<V>>>	assign(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
static <V> void	checkLayers(List<List<LV<V>>> layers)
static <V> void	checkLayers(LV<V>[][] layers)
static <V,E> List<List<LV<V>>>	coffmanGraham(org.jgrapht.Graph<LV<V>,LE<V,E>> dag, int width)
static <V,E> List<List<LV<V>>>	coffmanGraham(org.jgrapht.Graph<LV<V>,LE<V,E>> dag, org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache, int width)
static <V,E> boolean	isIsolatedVertex(org.jgrapht.Graph<V,E> graph, V v)
static <V,E> boolean	isLoopVertex(org.jgrapht.Graph<V,E> graph, V v)
static <V,E> boolean	isZeroDegreeVertex(org.jgrapht.Graph<V,E> graph, V v)
static <V,E> List<List<LV<V>>>	longestPath(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
static <V,E> List<List<LV<V>>>	longestPath(org.jgrapht.Graph<LV<V>,LE<V,E>> dag, org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache)
static <V,E> List<List<LV<V>>>	longestPathReverse(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
static <V,E> List<List<LV<V>>>	longestPathReverse(org.jgrapht.Graph<LV<V>,LE<V,E>> dag, org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache)
static <V,E> void	minimizeEdgeLength(org.jgrapht.Graph<LV<V>,LE<V,E>> dag, List<List<LV<V>>> layers)
static <V,E> List<List<LV<V>>>	networkSimplex(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
static <V,E> int	vertexIsolationScore(org.jgrapht.Graph<V,E> graph, V v)	to set vertex order to normal -> loop -> zeroDegree

Methods inherited from class java.lang.Object

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

Method Detail

assign

public static <V,E> List<List<LV<V>>> assign(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)

minimizeEdgeLength

public static <V,E> void minimizeEdgeLength(org.jgrapht.Graph<LV<V>,LE<V,E>> dag,
                                                  List<List<LV<V>>> layers)

longestPath

public static <V,E> List<List<LV<V>>> longestPath(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)

longestPath

public static <V,E> List<List<LV<V>>> longestPath(org.jgrapht.Graph<LV<V>,LE<V,E>> dag,
                                                        org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache)

longestPathReverse

public static <V,E> List<List<LV<V>>> longestPathReverse(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)

longestPathReverse

public static <V,E> List<List<LV<V>>> longestPathReverse(org.jgrapht.Graph<LV<V>,LE<V,E>> dag,
                                                               org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache)

networkSimplex

public static <V,E> List<List<LV<V>>> networkSimplex(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)

coffmanGraham

public static <V,E> List<List<LV<V>>> coffmanGraham(org.jgrapht.Graph<LV<V>,LE<V,E>> dag,
                                                          int width)

coffmanGraham

public static <V,E> List<List<LV<V>>> coffmanGraham(org.jgrapht.Graph<LV<V>,LE<V,E>> dag,
                                                          org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache,
                                                          int width)

checkLayers

public static <V> void checkLayers(List<List<LV<V>>> layers)

checkLayers

public static <V> void checkLayers(LV<V>[][] layers)

isLoopVertex

public static <V,E> boolean isLoopVertex(org.jgrapht.Graph<V,E> graph,
                                               V v)

isZeroDegreeVertex

public static <V,E> boolean isZeroDegreeVertex(org.jgrapht.Graph<V,E> graph,
                                                     V v)

isIsolatedVertex

public static <V,E> boolean isIsolatedVertex(org.jgrapht.Graph<V,E> graph,
                                                   V v)

vertexIsolationScore

public static <V,E> int vertexIsolationScore(org.jgrapht.Graph<V,E> graph,
                                                   V v)

to set vertex order to normal -> loop -> zeroDegree

Type Parameters:

V -

E -

Parameters:

graph -

v -

Returns: