- labelAsEmpty() - Method in class graph.tree.pq.PQTreeNode
-
Changes the label to empty
while updating the lists of the
empty, partial and full children
- labelAsFull() - Method in class graph.tree.pq.PQTreeNode
-
Changes the label to full
while updating the lists of the
empty, partial and full children
- labelAsPartial(PQNodeLabel) - Method in class graph.tree.pq.PQTreeNode
-
Changes the label to partial
while updating the lists of the
empty, partial and full children
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.AbstractJGraphXLayouter
-
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.AbstractJungLayouter
-
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.AbstractLayouter
-
Lays out the graph, taking into account given properties
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.AbstractPrefuseLayouter
-
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.automatic.AutomaticPropertiesLayout
-
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.box.BoxLayouter
-
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.circle.CircleLayouter
-
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.circle.CircleWithCenterLayouter
-
- layout() - Method in class graph.layout.dsl.DSLLayouter
-
Lays out the graph and returns a mapping of vertices and edges to their positions
- layout() - Method in class graph.layout.Layouter
-
Lays out the graph and returns an instance of the drawing object
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.orthogonal.VisibilityRepresentationLayout
-
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.straight.line.ConvexLayouter
-
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.straight.line.TutteLayouter
-
- layout(Graph<V, E>, GraphLayoutProperties) - Method in class graph.layout.symmetric.SymmetricCircleLayouter
-
- LayoutAestheticMap - Class in graph.layout
-
Class used to map aethetic criteria and algoritithms which were designed
in accordance with them
- LayoutAestheticMap() - Constructor for class graph.layout.LayoutAestheticMap
-
- LayoutAlgorithms - Enum in graph.layout
-
Lists all implemented layout algorithms
- Layouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout
-
Layouter accepts lists of veritces and edges which might in fact form more than one graph
It then forms the graphs which can later be layouted using the desired method
- Layouter() - Constructor for class graph.layout.Layouter
-
Constructs the layouter without populating list of edges and vertices
- Layouter(List<V>, List<E>, LayoutAlgorithms) - Constructor for class graph.layout.Layouter
-
Constructs the layouter and sets lists of vertices and edges, as well
as the layout algorithm which should be used
- Layouter(List<V>, List<E>, LayoutAlgorithms, GraphLayoutProperties) - Constructor for class graph.layout.Layouter
-
Constructs the layouter and sets lists of vertices and edges, as well
as the layout algorithm which should be used and its properties
- LayouterFactory<V extends Vertex,E extends Edge<V>> - Class in graph.layout
-
Factory class used to create an instance of the layouter class
- LayouterFactory() - Constructor for class graph.layout.LayouterFactory
-
- LayoutPicker<V extends Vertex,E extends Edge<V>> - Class in graph.layout.automatic
-
Class used to select an algorithm automatically based on properties
of the graph
- LayoutPicker() - Constructor for class graph.layout.automatic.LayoutPicker
-
- leastAncestor(V) - Method in class graph.trees.dfs.DFSTree
-
Vertex directly adjacent to v by a back edge that has the lowest index of all
such vertices
- leftFaceOf(E) - Method in class graph.algorithms.planarity.PlanarFaces
-
Left face of the given edge
- Line - Class in graph.math
-
A line defined with k and n parameters, where y=k*x +n
- Line(Double, Double) - Constructor for class graph.math.Line
-
Constructs a line given k and n parameters
- lineThroughTwoPoints(Point2D, Point2D) - Static method in class graph.math.Calc
-
Finds a line which goes through provided two points
- listBiconnectedComponents() - Method in class graph.elements.Graph
-
Finds all biconnected components of the graph
- listBiconnectedComponents() - Method in class graph.properties.GraphProperties
-
Finds all biconnected components of a graph
- listCutVertices() - Method in class graph.elements.Graph
-
Finds all cut vertices of a graph
- listMultiEdges() - Method in class graph.elements.Graph
-
Finds all multiedges of the graph
- listMultiEdges() - Method in class graph.properties.GraphProperties
-
Finds all multiedges in a graph
- lowpt(V) - Method in class graph.trees.dfs.DFSTree
-
Finds the lowpoint of a vertex
The lowpoint of a vertex v, denoted by lowpt(v), is the lowest DFS index of
an ancestor of v reachable through a back edge from a descendant of v
- lowpt(E) - Method in class graph.trees.dfs.DFSTree
-
Finds the lowpoint of the given edge
The lowpt of an edge (v, w) is its lowest
return point (or w if none exists).
- lowpts(V) - Method in class graph.trees.dfs.DFSTree
-
Finds both lowpt1 and lowpt2 of a vertex
The lowpoint of a vertex v, denoted by lowpt(v), is the lowest DFS index of
an ancestor of v reachable through a back edge from a descendant of v
lowpt1 is the lowest index, lowpt2 is the second lowest
- LRPartition<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.lrpartition
-
A partition B = L U R of DFS oriented graph's
back edges into two classes, referred to as left and right, is called left-right
partition, or LR partition for short
- LRPartition(Graph<V, E>) - Constructor for class graph.algorithms.lrpartition.LRPartition
-
- LRPartitionEdge<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.lrpartition
-
Used to implement LR planar testing algorithms
Saves lists of edges which should be in the same and in different partitions
than the given edge
- LRPartitionEdge(E) - Constructor for class graph.algorithms.lrpartition.LRPartitionEdge
-
Mark the given edge as a LR partition edge and initializes
lists of the edges which should be in the same and in different
partition as it
- LRPartitionSet<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.lrpartition
-
Used in LR planar testing algorithm to form L and R partitions
- LRPartitionSet(DFSTree<V, E>) - Constructor for class graph.algorithms.lrpartition.LRPartitionSet
-