- DAGLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.force.directed
-
Layouter which uses JUNG framework's DAG layout
- DAGLayouter() - Constructor for class graph.layout.force.directed.DAGLayouter
-
- decrementPertinentChildCount() - Method in class graph.tree.pq.PQTreeNode
-
Decrements pertinent children count
- DefaultGraphLayoutProperties - Class in graph.layout
-
Sets default properties of layout algorithms.
- DefaultGraphLayoutProperties() - Constructor for class graph.layout.DefaultGraphLayoutProperties
-
- DeFrayseeixHeuristic<V extends Vertex,E extends Edge<V>> - Class in graph.symmetry
-
A class for calculating De Frayseeix's heuristic
- DeFrayseeixHeuristic() - Constructor for class graph.symmetry.DeFrayseeixHeuristic
-
- DFSNumbering<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.numbering
-
Represents DFS numbering of a given graph
- DFSNumbering(DFSTree<V, E>) - Constructor for class graph.algorithms.numbering.DFSNumbering
-
- DFSNumbering(Graph<V, E>) - Constructor for class graph.algorithms.numbering.DFSNumbering
-
- DFSTree<V extends Vertex,E extends Edge<V>> - Class in graph.trees.dfs
-
DFS tree, with methods for its creation and relevant method
regarding its edges and nodes
- DFSTree(V) - Constructor for class graph.trees.dfs.DFSTree
-
- DFSTree(V, int[], List<E>, List<E>, List<V>) - Constructor for class graph.trees.dfs.DFSTree
-
- DFSTreeTraversal<V extends Vertex,E extends Edge<V>> - Class in graph.traversal
-
Class for forming a DFS tree given a graph
- DFSTreeTraversal(Graph<V, E>) - Constructor for class graph.traversal.DFSTreeTraversal
-
- DijkstraAlgorithm<V extends Vertex,E extends Edge<V>> - Class in graph.traversal
-
An implementation of Dijkstra's algorithm for finding a path between
two graph vertices in a graph
- DijkstraAlgorithm(Graph<V, E>) - Constructor for class graph.traversal.DijkstraAlgorithm
-
Initialized the algorithm's parameters based on the properties of the graph
- DijkstraAlgorithm(List<E>, boolean) - Constructor for class graph.traversal.DijkstraAlgorithm
-
Initializes the algorithm's parameters based on the given values
- DijkstraAlgorithm() - Constructor for class graph.traversal.DijkstraAlgorithm
-
Sets default value of the directed parameter and leaves the edge empty
- directDescendantsOf(V) - Method in class graph.trees.dfs.DFSTree
-
Finds all direct descendants of a given vertex.
- Direction - Enum in graph.enumerations
-
- distanceBetweenTwoPoints(Point2D, Point2D) - Static method in class graph.math.Calc
-
Finds distance between the two provided points
- Drawing<V extends Vertex,E extends Edge<V>> - Class in graph.drawing
-
Represents a drawing of a graph.
- Drawing() - Constructor for class graph.drawing.Drawing
-
Creates a drawing with empty vertex and edge mappings
- Drawing(Map<V, Point2D>, Map<E, List<Point2D>>) - Constructor for class graph.drawing.Drawing
-
Creates a drawing with the provided edge and vertex mappings
- DSLException - Exception in graph.exception
-
Exception which is thrown if the supplied string is not
in accordance with the dsl
- DSLException(String) - Constructor for exception graph.exception.DSLException
-
- DSLLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.dsl
-
A layouter which lays out a given graph in accordance with the user's description
which needs to conform to the defined dsl.
- DSLLayouter(List<V>, List<E>, String) - Constructor for class graph.layout.dsl.DSLLayouter
-
Constructs the DSL layouter given lists of graph's vertices and edges
and textual description of the desired layout conforming to the dsl
- DualGraphEdge<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.planarity.dual
-
Class represents edge of a dual graph
Each edge of dual graphs connects a face to the left of a graph's edge
and the face to the right
- DualGraphEdge(DualGraphVertex<V, E>, DualGraphVertex<V, E>) - Constructor for class graph.algorithms.planarity.dual.DualGraphEdge
-
- DualGraphVertex<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.planarity.dual
-
Class represents vertices of dual graphs
Vertices of dual graphs are sets of faces of G, where G is a st-graph
(DAG with one source and one sink)
- DualGraphVertex(List<E>) - Constructor for class graph.algorithms.planarity.dual.DualGraphVertex
-