Uses of Interface
org.jungrapht.visualization.layout.algorithms.sugiyama.LE

Packages that use LE

Package	Description
org.jungrapht.samples.sugiyama.test.algorithms
org.jungrapht.visualization.layout.algorithms.eiglsperger
org.jungrapht.visualization.layout.algorithms.sugiyama
org.jungrapht.visualization.layout.algorithms.util

Uses of LE in org.jungrapht.samples.sugiyama.test.algorithms

Constructor parameters in org.jungrapht.samples.sugiyama.test.algorithms with type arguments of type LE

Constructor	Description
SelectiveEiglspergerHorizontalCoordinateAssignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments, int horizontalOffset, int verticalOffset, boolean doUpLeft, boolean doUpRight, boolean doDownLeft, boolean doDownRight)
SelectiveEiglspergerHorizontalCoordinateAssignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments, int horizontalOffset, int verticalOffset, boolean doUpLeft, boolean doUpRight, boolean doDownLeft, boolean doDownRight)
SelectiveSugiyamaHorizontalCoordinateAssignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments, int horizontalOffset, int verticalOffset, boolean doUpLeft, boolean doUpRight, boolean doDownLeft, boolean doDownRight)
SelectiveSugiyamaHorizontalCoordinateAssignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments, int horizontalOffset, int verticalOffset, boolean doUpLeft, boolean doUpRight, boolean doDownLeft, boolean doDownRight)

Uses of LE in org.jungrapht.visualization.layout.algorithms.eiglsperger

Classes in org.jungrapht.visualization.layout.algorithms.eiglsperger that implement LE

Modifier and Type	Class	Description
class	VirtualEdge<V,E>	an edge that is not in the original graph, but is synthesized to replace one or more original graph edges.

Fields in org.jungrapht.visualization.layout.algorithms.eiglsperger with type parameters of type LE

Modifier and Type	Field	Description
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	Synthetics.dag
protected Function<List<LE<V,E>>,List<LE<V,E>>>	EiglspergerSteps.edgeEndpointSwapOrNot
protected Function<List<LE<V,E>>,List<LE<V,E>>>	EiglspergerSteps.edgeEndpointSwapOrNot
protected Function<LE<V,E>,LV<V>>	EiglspergerSteps.edgeSourceFunction
protected Function<LE<V,E>,LV<V>>	EiglspergerSteps.edgeTargetFunction
protected org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>>	EiglspergerRunnable.neighborCache
protected org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>>	EiglspergerSteps.neighborCache
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	EiglspergerRunnable.svGraph
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	EiglspergerSteps.svGraph	The delegate Graph to layout
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	HorizontalCompaction.svGraph
protected Set<LE<V,E>>	EiglspergerSteps.typeOneConflicts

Methods in org.jungrapht.visualization.layout.algorithms.eiglsperger that return types with arguments of type LE

Modifier and Type	Method	Description
Set<LE<V,E>>	EiglspergerSteps.getTypeOneConflicts()
protected static <V,E> List<LE<V,E>>	EiglspergerSteps.swapEdgeEndpoints(List<LE<V,E>> list)

Method parameters in org.jungrapht.visualization.layout.algorithms.eiglsperger with type arguments of type LE

Modifier and Type	Method	Description
LV<V>[][]	Synthetics.createVirtualVerticesAndEdges(List<LE<V,E>> edges, List<List<LV<V>>> layers)	Add new Synthetic vertices to replace edges that 'jump' more than one layer with a chain of edges that connect each layer.
protected static <V,E> List<LE<V,E>>	EiglspergerSteps.swapEdgeEndpoints(List<LE<V,E>> list)

Constructor parameters in org.jungrapht.visualization.layout.algorithms.eiglsperger with type arguments of type LE

Constructor	Description
EiglspergerSteps(org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, LV<V>[][] layersArray, Predicate<LV<V>> joinVertexPredicate, Predicate<LV<V>> splitVertexPredicate, Function<LE<V,E>,LV<V>> edgeSourceFunction, Function<LE<V,E>,LV<V>> edgeTargetFunction, Function<LV<V>,Set<LV<V>>> neighborFunction, Function<List<LE<V,E>>,List<LE<V,E>>> edgeEndpointSwapOrNot, boolean transpose)
EiglspergerSteps(org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, LV<V>[][] layersArray, Predicate<LV<V>> joinVertexPredicate, Predicate<LV<V>> splitVertexPredicate, Function<LE<V,E>,LV<V>> edgeSourceFunction, Function<LE<V,E>,LV<V>> edgeTargetFunction, Function<LV<V>,Set<LV<V>>> neighborFunction, Function<List<LE<V,E>>,List<LE<V,E>>> edgeEndpointSwapOrNot, boolean transpose)
EiglspergerStepsBackward(org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache, LV<V>[][] layersArray, boolean transpose)
EiglspergerStepsBackward(org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache, LV<V>[][] layersArray, boolean transpose)
EiglspergerStepsForward(org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache, LV<V>[][] layersArray, boolean transpose)
EiglspergerStepsForward(org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache, LV<V>[][] layersArray, boolean transpose)
HorizontalCompaction(VerticalAlignment.HDirection hDirection, VerticalAlignment.VDirection vDirection, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, org.jgrapht.Graph<LV<V>,Integer> compactionGraph, LV<V>[][] layers, Map<LV<V>,LV<V>> rootMap, Map<LV<V>,LV<V>> alignMap, int deltaX, int deltaY)
HorizontalCoordinateAssignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, org.jgrapht.Graph<LV<V>,Integer> compactionGraph, Set<LE<V,E>> markedSegments, int horizontalOffset, int verticalOffset)
HorizontalCoordinateAssignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, org.jgrapht.Graph<LV<V>,Integer> compactionGraph, Set<LE<V,E>> markedSegments, int horizontalOffset, int verticalOffset)
HorizontalCoordinateAssignmentDeprecated(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments, int horizontalOffset, int verticalOffset)
HorizontalCoordinateAssignmentDeprecated(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments, int horizontalOffset, int verticalOffset)
LeftmostLower(VerticalAlignment.HDirection hDirection, VerticalAlignment.VDirection vDirection, LV<V>[][] layers, org.jgrapht.Graph<LV<V>,Integer> compactionGraph, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
LeftmostLower(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
LeftmostLower(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
LeftmostUpper(VerticalAlignment.HDirection hDirection, VerticalAlignment.VDirection vDirection, LV<V>[][] layers, org.jgrapht.Graph<LV<V>,Integer> compactionGraph, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
LeftmostUpper(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
LeftmostUpper(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
RightmostLower(VerticalAlignment.HDirection hDirection, VerticalAlignment.VDirection vDirection, LV<V>[][] layers, org.jgrapht.Graph<LV<V>,Integer> compactionGraph, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
RightmostLower(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
RightmostLower(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
RightmostUpper(VerticalAlignment.HDirection hDirection, VerticalAlignment.VDirection vDirection, LV<V>[][] layers, org.jgrapht.Graph<LV<V>,Integer> compactionGraph, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
RightmostUpper(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
RightmostUpper(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
Synthetics(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
VerticalAlignment(VerticalAlignment.HDirection hDirection, VerticalAlignment.VDirection vDirection, LV<V>[][] layers, org.jgrapht.Graph<LV<V>,Integer> compactionGraph, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
VerticalAlignmentDeprecated(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
VerticalAlignmentDeprecated(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)

Uses of LE in org.jungrapht.visualization.layout.algorithms.sugiyama

Classes in org.jungrapht.visualization.layout.algorithms.sugiyama that implement LE

Modifier and Type	Class	Description
class	ArticulatedEdge<V,E>
class	LEI<V,E>	Implementation of an edge type used for the application of a layered layout algorithm. Instances of LEI<V,E> replace instances of E during layout
class	SyntheticLE<V,E>	an edge that is not in the original graph, but is synthesized to replace one or more original graph edges.

Fields in org.jungrapht.visualization.layout.algorithms.sugiyama declared as LE

Modifier and Type	Field	Description
protected LE<V,E>	ArticulatedEdge.se	two synthetic edges are created by splitting an existing SE<V,E> edge.
protected LE<V,E>	SyntheticLE.se	two synthetic edges are created by splitting an existing SE<V,E> edge.

Fields in org.jungrapht.visualization.layout.algorithms.sugiyama with type parameters of type LE

Modifier and Type	Field	Description
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	Synthetics.dag
protected Set<LE<V,E>>	HorizontalCoordinateAssignment.markedSegments
protected Set<LE<V,E>>	VerticalAlignment.markedSegments
protected org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>>	HorizontalCoordinateAssignment.neighborCache
protected org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>>	SugiyamaRunnable.neighborCache
protected org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>>	VerticalAlignment.neighborCache
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	HorizontalCoordinateAssignment.svGraph
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	SugiyamaRunnable.svGraph
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	VerticalAlignment.svGraph

Methods in org.jungrapht.visualization.layout.algorithms.sugiyama that return LE

Modifier and Type	Method	Description
protected static <V,E> LE<V,E>[]	AccumulatorTreeUtil.getEdgeArray(List<LE<V,E>> edges)	get an int array holding the indices of the target vertices for the passed edges
static <V,E> LE<V,E>	LE.of(E edge, LV<V> source, LV<V> target)
LE<V,E>	LE.swapped()

Methods in org.jungrapht.visualization.layout.algorithms.sugiyama that return types with arguments of type LE

Modifier and Type	Method	Description
static <V,E> Comparator<LE<V,E>>	Comparators.biLevelEdgeComparator()
static <V,E> Comparator<LE<V,E>>	Comparators.biLevelEdgeComparatorReverse()
org.jgrapht.Graph<LV<V>,LE<V,E>>	TransformedGraphSupplier.get()
static <V,E> Comparator<LE<V,E>>	Comparators.sourceIndexComparator()
static <V,E> Comparator<LE<V,E>>	Comparators.targetIndexComparator()

Methods in org.jungrapht.visualization.layout.algorithms.sugiyama with parameters of type LE

Modifier and Type	Method	Description
int	AccumulatorTree.crossWeight(LE<V,E>[] edgeArray, Function<Integer,Integer> weight)
protected boolean	VerticalAlignment.notMarked(LE<V,E> edge)
static <V,E> ArticulatedEdge	ArticulatedEdge.of(LE<V,E> edge, LV<V> source, LV<V> target)
static <V,E> SyntheticLE	SyntheticLE.of(LE<V,E> edge, LV<V> source, LV<V> target)

Method parameters in org.jungrapht.visualization.layout.algorithms.sugiyama with type arguments of type LE

Modifier and Type	Method	Description
protected static <V,E> int	AccumulatorTreeUtil.accumulatorTreeCount(List<LE<V,E>> edges)	count edge crossings in the passed List of edges
protected static <V,E> int	AccumulatorTreeUtil.accumulatorTreeWeight(List<LE<V,E>> edges, Function<Integer,Integer> weightFunction)	count edge crossing weight in the passed List of edges
static <V,E> List<List<LV<V>>>	GraphLayers.assign(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
static <V,E> List<List<LV<V>>>	GraphLayers.coffmanGraham(org.jgrapht.Graph<LV<V>,LE<V,E>> dag, int width)
static <V,E> List<List<LV<V>>>	GraphLayers.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> List<List<LV<V>>>	GraphLayers.coffmanGraham(org.jgrapht.Graph<LV<V>,LE<V,E>> dag, org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache, int width)
LV<V>[][]	Synthetics.createVirtualVerticesAndEdges(List<LE<V,E>> edges, List<List<LV<V>>> layers)	Add new Synthethic vertices to replace edges that 'jump' more than one layer with a chain of edges that connect each layer.
static <V,E> int	AccumulatorTreeUtil.crossingCount(List<LE<V,E>> edges)	count edge crossings in the passed List of edges
static <V,E> int	AccumulatorTreeUtil.crossingWeight(List<LE<V,E>> edges, Function<Integer,Integer> weightFunction)	count edge crossing weight in the passed List of edges
protected static <V,E> LE<V,E>[]	AccumulatorTreeUtil.getEdgeArray(List<LE<V,E>> edges)	get an int array holding the indices of the target vertices for the passed edges
protected static <V,E> int[]	AccumulatorTreeUtil.getTargetIndices(List<LE<V,E>> edges)	get an int array holding the indices of the target vertices for the passed edges
static <V,E> List<List<LV<V>>>	GraphLayers.longestPath(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
static <V,E> List<List<LV<V>>>	GraphLayers.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>>>	GraphLayers.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>>>	GraphLayers.longestPathReverse(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
static <V,E> List<List<LV<V>>>	GraphLayers.longestPathReverse(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>>>	GraphLayers.longestPathReverse(org.jgrapht.Graph<LV<V>,LE<V,E>> dag, org.jgrapht.alg.util.NeighborCache<LV<V>,LE<V,E>> neighborCache)
protected void	SugiyamaRunnable.medianDownwards(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph)
protected void	SugiyamaRunnable.medianUpwards(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph)
static <V,E> void	GraphLayers.minimizeEdgeLength(org.jgrapht.Graph<LV<V>,LE<V,E>> dag, List<List<LV<V>>> layers)
static <V,E> List<List<LV<V>>>	GraphLayers.networkSimplex(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
protected void	SugiyamaRunnable.transposeDownwards(LV<V>[][] ranks, Map<Integer,List<LE<V,E>>> reducedEdgeMap)
protected void	SugiyamaRunnable.transposeUpwards(LV<V>[][] ranks, Map<Integer,List<LE<V,E>>> reducedEdgeMap)

Constructors in org.jungrapht.visualization.layout.algorithms.sugiyama with parameters of type LE

Constructor	Description
ArticulatedEdge(LE<V,E> edge, LV<V> source, LV<V> target)
SyntheticLE(LE<V,E> edge, LV<V> source, LV<V> target)

Constructor parameters in org.jungrapht.visualization.layout.algorithms.sugiyama with type arguments of type LE

Constructor	Description
AllLevelCross(org.jgrapht.Graph<LV<V>,LE<V,E>> graph, LV<V>[][] levels)
HorizontalCoordinateAssignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments, int horizontalOffset, int verticalOffset)
HorizontalCoordinateAssignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments, int horizontalOffset, int verticalOffset)
LeftmostLower(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
LeftmostLower(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
LeftmostUpper(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
LeftmostUpper(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
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)
RightmostLower(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
RightmostLower(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
RightmostUpper(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
RightmostUpper(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
Synthetics(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
VerticalAlignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
VerticalAlignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)

Uses of LE in org.jungrapht.visualization.layout.algorithms.util

Fields in org.jungrapht.visualization.layout.algorithms.util with type parameters of type LE

Modifier and Type	Field	Description
protected Map<LE<V,E>,Integer>	NetworkSimplex.cutMap
protected Map<LE<V,E>,Integer>	NetworkSimplex.cutValues
protected Map<LE<V,E>,Boolean>	NetworkSimplex.edgeInTreeMap
protected Map<LV<V>,LE<V,E>>	NetworkSimplex.parent
protected Function<LE<V,E>,Integer>	NetworkSimplex.Builder.separationFunction
protected Function<LE<V,E>,Integer>	NetworkSimplex.separationFunction
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	NetworkSimplex.Builder.svGraph
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	NetworkSimplex.svGraph
protected Function<LE<V,E>,Integer>	NetworkSimplex.Builder.weightFunction
protected Function<LE<V,E>,Integer>	NetworkSimplex.weightFunction

Methods in org.jungrapht.visualization.layout.algorithms.util that return types with arguments of type LE

Modifier and Type	Method	Description
Map<LE<V,E>,Boolean>	NetworkSimplex.getEdgeInTreeMap()

Method parameters in org.jungrapht.visualization.layout.algorithms.util with type arguments of type LE

Modifier and Type	Method	Description
static <V,E> NetworkSimplex.Builder<V,E,?,?>	NetworkSimplex.builder(org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph)
B	NetworkSimplex.Builder.separationFunction(Function<LE<V,E>,Integer> separationFunction)
B	NetworkSimplex.Builder.weightFunction(Function<LE<V,E>,Integer> weightFunction)

Constructor parameters in org.jungrapht.visualization.layout.algorithms.util with type arguments of type LE

Constructor	Description
Builder(org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph)