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

Packages that use LV

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 LV in org.jungrapht.samples.sugiyama.test.algorithms

Method parameters in org.jungrapht.samples.sugiyama.test.algorithms with type arguments of type LV

Modifier and Type	Method	Description
static <V> void	LayeredLayoutAlgorithm.rearrangeLayers(List<List<LV<V>>> layers)

Constructors in org.jungrapht.samples.sugiyama.test.algorithms with parameters of type LV

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)
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)

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

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)
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 LV in org.jungrapht.visualization.layout.algorithms.eiglsperger

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

Modifier and Type	Class	Description
class	SyntheticLV<V>	a vertex that is not in the original graph, but is synthesized in order to position bends in the articulated edges of the SugiyamaLayoutAlgorithm

Fields in org.jungrapht.visualization.layout.algorithms.eiglsperger declared as LV

Modifier and Type	Field	Description
protected LV<V>[][]	EiglspergerSteps.layersArray	the result of layering the graph vertices and introducint synthetic vertices and edges

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

Modifier and Type	Field	Description
protected org.jgrapht.Graph<LV<V>,Integer>	EiglspergerSteps.compactionGraph
protected org.jgrapht.Graph<LV<V>,Integer>	HorizontalCompaction.compactionGraph
protected org.jgrapht.Graph<LV<V>,Integer>	HorizontalCoordinateAssignment.compactionGraph
protected org.jgrapht.Graph<LV<V>,Integer>	VerticalAlignment.compactionGraph
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	Synthetics.dag
protected Function<LE<V,E>,LV<V>>	EiglspergerSteps.edgeSourceFunction
protected Function<LE<V,E>,LV<V>>	EiglspergerSteps.edgeTargetFunction
protected Set<LV<V>>	HorizontalCoordinateAssignment.isolatedCompactionGraphVertices
protected Predicate<LV<V>>	EiglspergerSteps.joinVertexPredicate	when sweeping top to bottom, this is a PVertex, bottom to top, this is a QVertex
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 Function<LV<V>,Set<LV<V>>>	EiglspergerSteps.neighborFunction	When sweeping top to bottom, this function returns predecessors When sweeping bottom to top, this function returns sucessors
protected Function<LV<V>,Set<LV<V>>>	EiglspergerSteps.neighborFunction	When sweeping top to bottom, this function returns predecessors When sweeping bottom to top, this function returns sucessors
protected Predicate<LV<V>>	EiglspergerSteps.splitVertexPredicate	when sweeping top to bottom, this is a QVertex, bottom to top this is a PVertex
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 Map<LV<V>,VertexMetadata<V>>	EiglspergerRunnable.vertexMetadataMap

Methods in org.jungrapht.visualization.layout.algorithms.eiglsperger with type parameters of type LV

Modifier and Type	Method	Description
<T extends LV<V>> T	SyntheticLV.copy()

Methods in org.jungrapht.visualization.layout.algorithms.eiglsperger that return LV

Modifier and Type	Method	Description
protected LV<V>[][]	EiglspergerRunnable.copy(LV<V>[][] in)
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 LV<V>[][]	EiglspergerRunnable.restore(LV<V>[][] layers, Map<LV<V>,VertexMetadata<V>> vertexMetadataMap)

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

Modifier and Type	Method	Description
static <V> List<LV<V>>	EiglspergerUtil.createListOfVertices(LV<V>[] rank)	Creates and returns a list of the vertices in a rank of the sparse layering array. No Containers are inserted in the list, they will be inserted as needed in stepSix of the algorithm
protected List<LV<V>>	HorizontalCoordinateAssignment.misAligned(Map<LV<V>,Point> pointMap)
protected List<LV<V>>	HorizontalCoordinateAssignment.misAligned(LV<V>[][] layers)
protected List<LV<V>>	HorizontalCoordinateAssignmentDeprecated.misAligned(Map<LV<V>,Point> pointMap)
protected List<LV<V>>	HorizontalCoordinateAssignmentDeprecated.misAligned(LV<V>[][] layers)
protected Map<LV<V>,VertexMetadata<V>>	EiglspergerRunnable.save(LV<V>[][] in)

Methods in org.jungrapht.visualization.layout.algorithms.eiglsperger with parameters of type LV

Modifier and Type	Method	Description
protected int	VerticalAlignment.alignMoveCursor(LV<V> neighbor, LV<V> vertex)
protected int	VerticalAlignmentDeprecated.alignMoveCursor(LV<V> neighbor, LV<V> vertex)
protected int	VerticalAlignmentDeprecated.alignSegmentVertexMoveCursor(org.jungrapht.visualization.layout.algorithms.eiglsperger.SegmentVertex<V> segmentVertex, LV<V> vertex)
static <V> void	EiglspergerUtil.check(LV<V>[][] layers)
protected LV<V>[][]	EiglspergerRunnable.copy(LV<V>[][] in)
static <V> List<LV<V>>	EiglspergerUtil.createListOfVertices(LV<V>[] rank)	Creates and returns a list of the vertices in a rank of the sparse layering array. No Containers are inserted in the list, they will be inserted as needed in stepSix of the algorithm
Point	HorizontalCompactionDeprecated.getPoint(LV<V> v)
protected int	HorizontalCompaction.idx(LV<V> v)
protected int	HorizontalCompactionDeprecated.idx(LV<V> v)
protected int	HorizontalCoordinateAssignment.idx(LV<V> v)
protected int	HorizontalCoordinateAssignmentDeprecated.idx(LV<V> v)
protected int	VerticalAlignment.idx(LV<V> v)
protected int	VerticalAlignmentDeprecated.idx(LV<V> v)
protected boolean	HorizontalCoordinateAssignment.incidentToInnerSegment(LV<V> v)	override to say that only QVertices are incident to an inner edge that spans from previous rank to this one
protected boolean	HorizontalCoordinateAssignmentDeprecated.incidentToInnerSegment(LV<V> v)	override to say that only QVertices are incident to an inner edge that spans from previous rank to this one
protected boolean	HorizontalCoordinateAssignment.misAligned(LV<V> v)
protected List<LV<V>>	HorizontalCoordinateAssignment.misAligned(LV<V>[][] layers)
protected boolean	HorizontalCoordinateAssignment.misAligned(LV<V> v, Map<LV<V>,Point> map)
protected boolean	HorizontalCoordinateAssignmentDeprecated.misAligned(LV<V> v)
protected List<LV<V>>	HorizontalCoordinateAssignmentDeprecated.misAligned(LV<V>[][] layers)
protected boolean	HorizontalCoordinateAssignmentDeprecated.misAligned(LV<V> v, Map<LV<V>,Point> map)
static <V> SyntheticLV<V>	SyntheticLV.of(LV<V> source, LV<V> target)
static <V,E> VirtualEdge<V,E>	VirtualEdge.of(LV<V> source, LV<V> target)
protected void	HorizontalCompaction.placeBlock(LV<V> v)
protected void	HorizontalCompactionDeprecated.placeBlock(LV<V> v)
protected int	HorizontalCompaction.pos(LV<V> v)
protected int	HorizontalCompactionDeprecated.pos(LV<V> v)
protected int	HorizontalCoordinateAssignment.pos(LV<V> v)	override to use pos instead of index
protected int	HorizontalCoordinateAssignmentDeprecated.pos(LV<V> v)	override to use pos instead of index
protected int	VerticalAlignment.pos(LV<V> v)
protected int	VerticalAlignmentDeprecated.pos(LV<V> v)
protected LV<V>[][]	EiglspergerRunnable.restore(LV<V>[][] layers, Map<LV<V>,VertexMetadata<V>> vertexMetadataMap)
protected Map<LV<V>,VertexMetadata<V>>	EiglspergerRunnable.save(LV<V>[][] in)
int	EiglspergerStepsBackward.sweep(LV<V>[][] layersArray)
int	EiglspergerStepsForward.sweep(LV<V>[][] layersArray)

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

Modifier and Type	Method	Description
protected List<LV<V>>	HorizontalCoordinateAssignment.misAligned(Map<LV<V>,Point> pointMap)
protected boolean	HorizontalCoordinateAssignment.misAligned(LV<V> v, Map<LV<V>,Point> map)
protected List<LV<V>>	HorizontalCoordinateAssignmentDeprecated.misAligned(Map<LV<V>,Point> pointMap)
protected boolean	HorizontalCoordinateAssignmentDeprecated.misAligned(LV<V> v, Map<LV<V>,Point> map)
protected LV<V>[][]	EiglspergerRunnable.restore(LV<V>[][] layers, Map<LV<V>,VertexMetadata<V>> vertexMetadataMap)
int	EiglspergerSteps.stepFive(List<LV<V>> currentLayer, List<LV<V>> downstreamLayer, int currentRank, int downstreamRank)	In the fifth step we perform cross counting according to the scheme pro- posed by Barth et al (see Section 1.2).
void	EiglspergerSteps.stepFour(List<LV<V>> downstreamLayer, int downstreamRank)	In the fourth step we place each q-vertex v of L i+1 according to the position of its corresponding segment s(v).
void	EiglspergerSteps.stepOne(List<LV<V>> currentLayer)	"In the first step we append the segment s(v) for each p-vertex v in layer L i to the container preceding v.
void	EiglspergerSteps.stepSix(List<LV<V>> downstreamLayer)	In the sixth step we perform a scan on L i+1 and insert empty containers between two consecutive vertices, and call join(S 1 , S 2 ) on two consecutive containers in the list.
void	EiglspergerSteps.stepThree(List<LV<V>> downstreamLayer)	"In the third step we calculate an initial ordering of L i+1 .
void	EiglspergerSteps.stepTwo(List<LV<V>> currentLayer, List<LV<V>> downstreamLayer)	"In the second step we compute the measure values for the elements in L i+1 .

Constructors in org.jungrapht.visualization.layout.algorithms.eiglsperger with parameters of type LV

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)
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)
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)
HorizontalCompactionDeprecated(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)
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)
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)
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)
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)
SyntheticLV(LV<V> source, LV<V> target)
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)
VirtualEdge(LV<V> source, LV<V> target)

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

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)
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)
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)
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)
HorizontalCompactionDeprecated(LV<V>[][] layers, Map<LV<V>,LV<V>> rootMap, Map<LV<V>,LV<V>> alignMap, int deltaX, int deltaY)
HorizontalCompactionDeprecated(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)
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)
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)
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)
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)
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)

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

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

Modifier and Type	Class	Description
class	LVI<V>	Implementation of a vertex type for a layered layout algorithm. Instances of LVI<V> replace instances of V during layout The LVI<V> holds metadata information about the position of the vertex in the layered graph.
class	SyntheticLV<V>	a vertex that is not in the original graph, but is synthesized in order to position bends in the articulated edges of the SugiyamaLayoutAlgorithm

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

Modifier and Type	Field	Description
protected LV<V>[][]	HorizontalCompaction.layers
protected LV<V>[][]	HorizontalCoordinateAssignment.layers
protected LV<V>[][]	VerticalAlignment.layers
LV<V>	LEI.source
LV<V>	LEI.target

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

Modifier and Type	Field	Description
protected Map<LV<V>,LV<V>>	HorizontalCompaction.alignMap
protected Map<LV<V>,LV<V>>	HorizontalCompaction.alignMap
protected Map<LV<V>,LV<V>>	VerticalAlignment.alignMap
protected Map<LV<V>,LV<V>>	VerticalAlignment.alignMap
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	Synthetics.dag
protected List<LV<V>>	ArticulatedEdge.intermediateVertices
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 Map<LV<V>,LV<V>>	HorizontalCompaction.rootMap
protected Map<LV<V>,LV<V>>	HorizontalCompaction.rootMap
protected Map<LV<V>,LV<V>>	VerticalAlignment.rootMap
protected Map<LV<V>,LV<V>>	VerticalAlignment.rootMap
protected Map<LV<V>,Integer>	HorizontalCompaction.shift
protected Map<LV<V>,LV<V>>	HorizontalCompaction.sink
protected Map<LV<V>,LV<V>>	HorizontalCompaction.sink
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
protected Map<LV<V>,VertexMetadata<V>>	SugiyamaRunnable.vertexMetadataMap
protected Map<LV<V>,Integer>	HorizontalCompaction.x
protected Map<LV<V>,Integer>	HorizontalCompaction.y

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

Modifier and Type	Method	Description
<T extends LV<V>> T	LV.copy()
<T extends LV<V>> T	LVI.copy()
<T extends LV<V>> T	SyntheticLV.copy()

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

Modifier and Type	Method	Description
protected LV<V>	HorizontalCompaction.align(LV<V> v)
protected LV<V>	VerticalAlignment.align(LV<V> v)
protected LV<V>[][]	SugiyamaRunnable.copy(LV<V>[][] in)
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.
LV<V>	LE.getSource()
LV<V>	LEI.getSource()
LV<V>	LE.getTarget()
LV<V>	LEI.getTarget()
static <V> LV<V>	LV.of(V vertex)
static <V> LV<V>	LV.of(V vertex, int rank, int index)
protected LV<V>	HorizontalCompaction.pred(LV<V> v)	return the predecessor of v in the same rank
protected LV<V>	HorizontalCoordinateAssignment.pred(LV<V> v)
protected LV<V>[][]	SugiyamaRunnable.restore(LV<V>[][] layers, Map<LV<V>,VertexMetadata<V>> vertexMetadataMap)
protected LV<V>	HorizontalCompaction.root(LV<V> v)
protected LV<V>	VerticalAlignment.root(LV<V> v)
protected LV<V>	HorizontalCompaction.sink(LV<V> v)
protected LV<V>	HorizontalCoordinateAssignment.succ(LV<V> v)
protected LV<V>	HorizontalCoordinateAssignment.upperNeighborFor(LV<V> v)

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

Modifier and Type	Method	Description
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)
org.jgrapht.Graph<LV<V>,LE<V,E>>	TransformedGraphSupplier.get()
Map<LV<V>,LV<V>>	VerticalAlignment.getAlignMap()
Map<LV<V>,LV<V>>	VerticalAlignment.getAlignMap()
List<LV<V>>	ArticulatedEdge.getIntermediateVertices()
Map<LV<V>,LV<V>>	VerticalAlignment.getRootMap()
Map<LV<V>,LV<V>>	VerticalAlignment.getRootMap()
Map<LV<V>,Integer>	HorizontalCompaction.getShift()
Map<LV<V>,LV<V>>	HorizontalCompaction.getSink()
Map<LV<V>,LV<V>>	HorizontalCompaction.getSink()
protected List<LV<V>>	HorizontalCoordinateAssignment.getUpperNeighbors(LV<V> v)	return a list of the upper neighbors for the supplied vertex, sorted in index order
SingletonTransformer<V,LV<V>>	TransformedGraphSupplier.getVertexTransformer()
Map<LV<V>,Integer>	HorizontalCompaction.getX()
Map<LV<V>,Integer>	HorizontalCompaction.getY()
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.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.networkSimplex(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
protected Map<LV<V>,VertexMetadata<V>>	SugiyamaRunnable.save(LV<V>[][] in)

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

Modifier and Type	Method	Description
void	ArticulatedEdge.addIntermediateVertex(LV<V> v)
protected LV<V>	HorizontalCompaction.align(LV<V> v)
protected void	HorizontalCompaction.align(LV<V> k, LV<V> v)
protected LV<V>	VerticalAlignment.align(LV<V> v)
protected void	VerticalAlignment.align(LV<V> k, LV<V> v)
protected int	VerticalAlignment.alignMoveCursor(LV<V> um, LV<V> vkofi)
void	VertexMetadata.applyTo(LV<V> v)	apply the saved metadata to the supplied vertex
static <V> void	Unaligned.centerPoints(LV<V>[][] layers, Function<V,Rectangle> vertexShapeFunction, int horizontalOffset, int verticalOffset, Map<LV<V>,Point> vertexPointMap)
static <V> void	GraphLayers.checkLayers(LV<V>[][] layers)
protected LV<V>[][]	SugiyamaRunnable.copy(LV<V>[][] in)
Point	HorizontalCompaction.getPoint(LV<V> v)
protected List<LV<V>>	HorizontalCoordinateAssignment.getUpperNeighbors(LV<V> v)	return a list of the upper neighbors for the supplied vertex, sorted in index order
protected boolean	HorizontalCompaction.hasPredecessor(LV<V> v)
protected int	HorizontalCompaction.idx(LV<V> v)
protected boolean	HorizontalCoordinateAssignment.incidentToInnerSegment(LV<V> v)
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> ArticulatedEdge	ArticulatedEdge.of(LE<V,E> edge, LV<V> source, LV<V> target)
static <V,E> LE<V,E>	LE.of(E edge, LV<V> source, LV<V> target)
static <V,E> SyntheticLE	SyntheticLE.of(LE<V,E> edge, LV<V> source, LV<V> target)
static <V> VertexMetadata<V>	VertexMetadata.of(LV<V> vertex)	store the metadata for the supplied vertex
protected void	HorizontalCompaction.placeBlock(LV<V> v)
protected int	HorizontalCompaction.pos(LV<V> v)
protected int	HorizontalCoordinateAssignment.pos(LV<V> v)
protected int	VerticalAlignment.pos(LV<V> v)
protected LV<V>	HorizontalCompaction.pred(LV<V> v)	return the predecessor of v in the same rank
protected LV<V>	HorizontalCoordinateAssignment.pred(LV<V> v)
protected LV<V>[][]	SugiyamaRunnable.restore(LV<V>[][] layers, Map<LV<V>,VertexMetadata<V>> vertexMetadataMap)
protected LV<V>	HorizontalCompaction.root(LV<V> v)
protected void	HorizontalCompaction.root(LV<V> k, LV<V> v)
protected LV<V>	VerticalAlignment.root(LV<V> v)
protected void	VerticalAlignment.root(LV<V> k, LV<V> v)
protected Map<LV<V>,VertexMetadata<V>>	SugiyamaRunnable.save(LV<V>[][] in)
static <V> void	Unaligned.setPoints(LV<V>[][] layers, Function<V,Rectangle> vertexShapeFunction, int horizontalOffset, int verticalOffset, Map<LV<V>,Point> vertexPointMap)
protected int	HorizontalCompaction.shift(LV<V> v)
protected void	HorizontalCompaction.shift(LV<V> k, int v)
protected LV<V>	HorizontalCompaction.sink(LV<V> v)
protected void	HorizontalCompaction.sink(LV<V> k, LV<V> v)
protected LV<V>	HorizontalCoordinateAssignment.succ(LV<V> v)
protected static <V> void	AccumulatorTreeUtil.swap(LV<V>[] array, int i, int j)	swap members i and j in the passed array, and update the index metadata in the swapped members to reflect their new positions
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)
protected LV<V>	HorizontalCoordinateAssignment.upperNeighborFor(LV<V> v)
protected int	HorizontalCompaction.x(LV<V> v)
protected void	HorizontalCompaction.x(LV<V> v, int d)
protected int	HorizontalCompaction.y(LV<V> v)
protected void	HorizontalCompaction.y(LV<V> v, int d)

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

Modifier and Type	Method	Description
static <V,E> List<List<LV<V>>>	GraphLayers.assign(org.jgrapht.Graph<LV<V>,LE<V,E>> dag)
static <V> void	Unaligned.centerPoints(LV<V>[][] layers, Function<V,Rectangle> vertexShapeFunction, int horizontalOffset, int verticalOffset, Map<LV<V>,Point> vertexPointMap)
static <V> void	GraphLayers.checkLayers(List<List<LV<V>>> layers)
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)
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> 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 LV<V>[][]	SugiyamaRunnable.restore(LV<V>[][] layers, Map<LV<V>,VertexMetadata<V>> vertexMetadataMap)
static <V> void	Unaligned.setPoints(List<List<LV<V>>> layers, Function<V,Rectangle> vertexShapeFunction, int horizontalOffset, int verticalOffset, Map<LV<V>,Point> vertexPointMap)
static <V> void	Unaligned.setPoints(List<List<LV<V>>> layers, Function<V,Rectangle> vertexShapeFunction, int horizontalOffset, int verticalOffset, Map<LV<V>,Point> vertexPointMap)
static <V> void	Unaligned.setPoints(LV<V>[][] layers, Function<V,Rectangle> vertexShapeFunction, int horizontalOffset, int verticalOffset, Map<LV<V>,Point> vertexPointMap)
protected static <V> void	AccumulatorTreeUtil.swap(List<LV<V>> layer, int i, int j)	swap members i and j in the passed List, and update the index metadata in the swapped members to reflect their new positions

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

Constructor	Description
AllLevelCross(org.jgrapht.Graph<LV<V>,LE<V,E>> graph, LV<V>[][] levels)
ArticulatedEdge(LE<V,E> edge, LV<V> source, LV<V> target)
HorizontalCompaction(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, 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)
LeftmostUpper(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
LEI(E edge, LV<V> source, LV<V> target)
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)
SyntheticLE(LE<V,E> edge, LV<V> source, LV<V> target)
VerticalAlignment(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)

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

Constructor	Description
AllLevelCross(org.jgrapht.Graph<LV<V>,LE<V,E>> graph, LV<V>[][] levels)
HorizontalCompaction(LV<V>[][] layers, Map<LV<V>,LV<V>> rootMap, Map<LV<V>,LV<V>> alignMap, int deltaX, int deltaY)
HorizontalCompaction(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, 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)
LeftmostUpper(LV<V>[][] layers, org.jgrapht.Graph<LV<V>,LE<V,E>> svGraph, Set<LE<V,E>> markedSegments)
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)
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)

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

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

Modifier and Type	Field	Description
protected List<List<LV<V>>>	NetworkSimplex.layerList
protected Map<LV<V>,Integer>	NetworkSimplex.layers
protected List<LV<V>>	NetworkSimplex.leaves
protected Map<LV<V>,Integer>	NetworkSimplex.lim
protected Map<LV<V>,Integer>	NetworkSimplex.low
protected Map<LV<V>,LE<V,E>>	NetworkSimplex.parent
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	NetworkSimplex.Builder.svGraph
protected org.jgrapht.Graph<LV<V>,LE<V,E>>	NetworkSimplex.svGraph
protected List<LV<V>>	NetworkSimplex.treeVertices
protected Map<LV<V>,Boolean>	NetworkSimplex.vertexInTreeMap

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

Modifier and Type	Method	Description
List<List<LV<V>>>	NetworkSimplex.getLayerList()
List<LV<V>>	NetworkSimplex.getTreeVertices()
Map<LV<V>,Boolean>	NetworkSimplex.getVertexInTreeMap()

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

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

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

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