- Edge<E> - Interface in net.datastructures
-
An interface for an edge of a graph.
- edges() - Method in class net.datastructures.AdjacencyListGraph
-
Return an iterator over the edges of the graph
- edges() - Method in interface net.datastructures.Graph
-
Returns the edges of the graph as an iterable collection
- edges() - Method in interface support.graph.Graph
-
Returns an iterator holding all the edges of the graph.
- element() - Method in class net.datastructures.BTNode
-
Returns the element stored at this position
- element() - Method in class net.datastructures.DNode
-
- element() - Method in interface net.datastructures.Position
-
Return the element stored at this position.
- element() - Method in class net.datastructures.TreeNode
-
Returns the element stored at this position
- element() - Method in interface support.graph.CS16Edge
-
Returns the integer weight corresponding to this edge.
- element() - Method in interface support.graph.CS16Vertex
-
Returns the element stored in this vertex.
- element() - Method in class support.graph.GraphEdge
-
- element() - Method in class support.graph.GraphVertex
-
- ElementIterator<E> - Class in net.datastructures
-
A simple iterator class for lists.
- ElementIterator(PositionList<E>) - Constructor for class net.datastructures.ElementIterator
-
Creates an element iterator over the given list.
- EmptyDequeException - Exception in net.datastructures
-
Runtime exception thrown when one tries to perform an access or
removal operation on an empty deque.
- EmptyDequeException(String) - Constructor for exception net.datastructures.EmptyDequeException
-
- EmptyListException - Exception in net.datastructures
-
Thrown when a list cannot fulfill the requested operation because
it is empty.
- EmptyListException(String) - Constructor for exception net.datastructures.EmptyListException
-
- EmptyPriorityQueueException - Exception in net.datastructures
-
Thrown when a priority queue cannot fulfill the requested operation
because it is empty.
- EmptyPriorityQueueException(String) - Constructor for exception net.datastructures.EmptyPriorityQueueException
-
- EmptyQueueException - Exception in net.datastructures
-
Runtime exception thrown when one tries to perform operation front
or dequeue on an empty queue.
- EmptyQueueException(String) - Constructor for exception net.datastructures.EmptyQueueException
-
- EmptyStackException - Exception in net.datastructures
-
Runtime exception thrown when one tries to perform operation top or
pop on an empty stack.
- EmptyStackException(String) - Constructor for exception net.datastructures.EmptyStackException
-
- EmptyTreeException - Exception in net.datastructures
-
Runtime exception thrown when one tries to access the root of an
empty tree.
- EmptyTreeException(String) - Constructor for exception net.datastructures.EmptyTreeException
-
- endVertices(Edge<E>) - Method in class net.datastructures.AdjacencyListGraph
-
Return the endvertices of a edge in an array of length 2
- endVertices(Edge<E>) - Method in interface net.datastructures.Graph
-
Returns the endvertices of a vertex as an array of length 2
- endVertices(CS16Edge<V>) - Method in interface support.graph.Graph
-
Returns the two Vertices that the Edge e is incident upon.
- enqueue(E) - Method in class net.datastructures.NodeQueue
-
- enqueue(E) - Method in interface net.datastructures.Queue
-
Inserts an element at the rear of the queue.
- entries() - Method in class net.datastructures.BinarySearchTree
-
Returns an iterator containing all entries in the tree.
- entries() - Method in interface net.datastructures.Dictionary
-
Returns an iterator containing all the entries in the dictionary.
- entries() - Method in class net.datastructures.HashTableMap
-
Returns an iterable object containing all of the entries.
- entries() - Method in interface net.datastructures.Map
-
Returns an iterable object containing all the entries in the map.
- Entry<K,V> - Interface in net.datastructures
-
Interface for a key-value pair entry
- equals(Object) - Method in class net.datastructures.HashTableMap.HashEntry
-
- equals(Object) - Method in class support.graph.GraphEdge
-
- EulerTour<E,R> - Class in net.datastructures
-
Template for algorithms traversing a binary tree using an Euler
tour.
- EulerTour() - Constructor for class net.datastructures.EulerTour
-
- EulerTour.TourResult<R> - Class in net.datastructures
-
- execute(Graph<V, E>, Vertex<V>, I) - Method in class net.datastructures.DFS
-
Execute a depth first search traversal on graph g, starting
from a start vertex s, passing in an information object (in)
- execute(Graph<V, E>, Vertex<V>, Object) - Method in class net.datastructures.Dijkstra
-
Executes Dijkstra's algorithm.
- execute(BinaryTree<E>) - Method in class net.datastructures.EulerTour
-
Execution of the traversal.
- expandExternal(Position<E>, E, E) - Method in class net.datastructures.LinkedBinaryTree
-
Expand an external node into an internal node with two external
node children