- Edge<V extends Vertex> - Interface in graph.elements
-
Edge of the graph
- edgeBetween(V, V) - Method in class graph.elements.Graph
-
Checks if there is an edge between the two given graph vertices and return is
it if exists
- EdgeDirection - Enum in graph.elements
-
Directions of edges.
- edgeesBetween(V, V) - Method in class graph.elements.Graph
-
Returns all edges between vertices v1 and v2
- edgeesBetweenWithTriangulated(V, V) - Method in class graph.ordering.circular.GraphCopy
-
Finds all edges between the given two vertices taking
triangulated edges into account as well
- edgesBetween(List<V>) - Method in class graph.elements.Graph
-
Finds all edges between certain vertices
- edgesInCommon(Graph<V, E>, Graph<V, E>) - Method in class graph.operations.GraphOperations
-
Finds edges which the given two graphs have in common
- Embedding<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.planarity
-
Represents embedding of a graph - clockwise order of edges around each vertex
- Embedding(Map<V, List<E>>, Map<V, Integer>) - Constructor for class graph.algorithms.planarity.Embedding
-
- emedGraph(Graph<V, E>, V, V) - Static method in class graph.algorithms.planarity.PlanarEmbedding
-
Calculates a planar embedding of a graph based on the work of Chiba, Nishizeki, Abe and Ozava
A linear algorithm for embedding planar graphs using PQ-trees, Journal of Computer and System Sciences 30, 1985
- emptyChildrenCount() - Method in class graph.tree.pq.PQTreeNode
-
Only used for P-nodes
- EntryDirection - Enum in graph.layout.orthogonal
-
Directions from which an edge can enter a vertex
- equals(Object) - Method in class graph.algorithms.planarity.dual.DualGraphEdge
-
- equals(Object) - Method in class graph.elements.Graph
-
- equals(Object) - Method in class graph.properties.components.SplitPair
-
- equals(Object) - Method in class graph.symmetry.Permutation
-
- execute(Object, String, Object...) - Static method in class graph.algorithm.AlgorithmExecutor
-
Executes a given algorithm and returns its result and the time the execution took
- execute() - Method in class graph.algorithms.drawing.ConvexDrawing
-
Executes the algorithms
- execute(Path<V, E>) - Method in class graph.algorithms.drawing.ConvexDrawing
-
Executes the algorithms give an outside facial cycle
- execute(Permutation) - Method in class graph.algorithms.drawing.CyclicSymmetricGraphDrawing
-
Executes the algorithm using the provided permutation
- execute() - Method in class graph.algorithms.drawing.CyclicSymmetricGraphDrawing
-
Executes the algorithm and automatically selects a suitable permutation
- execute(List<V>, Point2D, double) - Method in class graph.algorithms.drawing.TutteEmbedding
-
Executes the algorithm, calculates each vertex's position
- execute(Matrix) - Static method in class graph.math.GramSchmidt
-
Calculates orthonormal basis gibev a matrix
- execute() - Method in class graph.properties.splitting.HopcroftTarjanSplitting
-
Executes the algorithms and sets values of the properties which
contain the results - lists of separation pair and components
- ExecuteResult - Class in graph.algorithm
-
A class which groups result of the execution of an algorithm and duration of
that execution
- ExecuteResult(long, Object) - Constructor for class graph.algorithm.ExecuteResult
-