- net.datastructures - package net.datastructures
-
- next() - Method in class net.datastructures.ElementIterator
-
Returns the next object in the iterator.
- next(Position<E>) - Method in class net.datastructures.NodePositionList
-
Returns the position after the given one; O(1) time
- next(Position<E>) - Method in interface net.datastructures.PositionList
-
Returns the node after a given node in the list.
- Node<E> - Class in net.datastructures
-
Node of a singly linked list, which stores references to its
element and to the next node in the list.
- Node() - Constructor for class net.datastructures.Node
-
Creates a node with null references to its element and next node.
- Node(E, Node<E>) - Constructor for class net.datastructures.Node
-
Creates a node with the given element and next node.
- NodeDeque<E> - Class in net.datastructures
-
Implementation of the Deque interface by means of a doubly linked
list.
- NodeDeque() - Constructor for class net.datastructures.NodeDeque
-
Creates an empty deque.
- NodePositionList<E> - Class in net.datastructures
-
Realization of a PositionList using a doubly-linked list of nodes.
- NodePositionList() - Constructor for class net.datastructures.NodePositionList
-
Constructor that creates an empty list; O(1) time
- NodeQueue<E> - Class in net.datastructures
-
Realization of a queue by means of a singly-linked list of nodes.
- NodeQueue() - Constructor for class net.datastructures.NodeQueue
-
Creates an empty queue.
- NodeStack<E> - Class in net.datastructures
-
Implementation of the stack ADT by means of a singly linked list.
- NodeStack() - Constructor for class net.datastructures.NodeStack
-
Creates an empty stack.
- NonEmptyTreeException - Exception in net.datastructures
-
Runtime exception thrown when one tries to create the root of a
tree that is not empty.
- NonEmptyTreeException(String) - Constructor for exception net.datastructures.NonEmptyTreeException
-
- numEdges() - Method in class net.datastructures.AdjacencyListGraph
-
- numEdges() - Method in interface net.datastructures.Graph
-
Returns the number of edges of the graph
- numVertices() - Method in class net.datastructures.AdjacencyListGraph
-
- numVertices() - Method in interface net.datastructures.Graph
-
Returns the number of vertices of the graph