A B C D E F G H I K L M N O P Q R S T V

D

DecorablePosition<E> - Interface in net.datastructures

An interface for a position that can be marked with an arbitrary number of decorations.

DefaultComparator<E> - Class in net.datastructures

Comparator based on the natural ordering

DefaultComparator() - Constructor for class net.datastructures.DefaultComparator

degree(Vertex<V>) - Method in class net.datastructures.AdjacencyListGraph

Return the degree of a given vertex

Deque<E> - Interface in net.datastructures

Interface for a deque: a collection of objects that are inserted and removed at both ends; a subset of java.util.LinkedList methods.

dequeue() - Method in class net.datastructures.NodeQueue

Removes the element at the front of the queue.

dequeue() - Method in interface net.datastructures.Queue

Removes the element at the front of the queue.

DFS<V,E,I,R> - Class in net.datastructures

Generic DFS traversal of a graph using the template method pattern.

DFS() - Constructor for class net.datastructures.DFS

Dictionary<K,V> - Interface in net.datastructures

An interface for a dictionary storing (key-value) pairs.

Dijkstra<V,E> - Class in net.datastructures

Dijkstra's algorithm for the single-source shortest path problem in an undirected graph whose edges have integer weights.

Dijkstra() - Constructor for class net.datastructures.Dijkstra

DLNode<E> - Class in net.datastructures

A simple node class for a doubly-linked list.

DNode<E> - Class in net.datastructures

A simple node class for a doubly-linked list.

DNode(DNode<E>, DNode<E>, E) - Constructor for class net.datastructures.DNode

Constructor