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

I

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

Return an iterator over the edges incident on a vertex

incidentEdges(Vertex<V>) - Method in interface net.datastructures.Graph

Returns the edges incident on a vertex as an iterable collection

IndexList<E> - Interface in net.datastructures

An interface for array lists.

indexOf(Position<E>) - Method in interface net.datastructures.Sequence

Returns the index of the element stored at the given position.

insert(K, V) - Method in class net.datastructures.AVLTree

Inserts an item into the dictionary and returns the newly created entry.

insert(K, V) - Method in class net.datastructures.BinarySearchTree

Inserts an entry into the tree and returns the newly created entry.

insert(K, V) - Method in interface net.datastructures.Dictionary

Inserts an item into the dictionary.

insert(K, V) - Method in class net.datastructures.HeapAdaptablePriorityQueue

Inserts a key-value pair and returns the entry created.

insert(K, V) - Method in class net.datastructures.HeapPriorityQueue

Inserts a key-value pair and returns the entry created

insert(K, V) - Method in interface net.datastructures.PriorityQueue

Inserts a key-value pair and return the entry created.

insert(K, V) - Method in class net.datastructures.RBTree

Inserts an item into the dictionary and returns the newly created entry.

insert(K, V) - Method in class net.datastructures.SortedListAdaptablePriorityQueue

Inserts a key-value pair and returns the entry created

insert(K, V) - Method in class net.datastructures.SortedListPriorityQueue

Inserts a key-value pair and return the entry created.

insertEdge(Vertex<V>, Vertex<V>, E) - Method in class net.datastructures.AdjacencyListGraph

Insert and return a new edge with a given element between two vertices

insertEdge(Vertex<V>, Vertex<V>, E) - Method in interface net.datastructures.Graph

Inserts and return a new edge with a given element between two vertices

insertLeft(Position<E>, E) - Method in class net.datastructures.LinkedBinaryTree

Inserts a left child at a given node.

insertRight(Position<E>, E) - Method in class net.datastructures.LinkedBinaryTree

Inserts a right child at a given node.

insertVertex(V) - Method in class net.datastructures.AdjacencyListGraph

Insert and return a new vertex with a given element

insertVertex(V) - Method in interface net.datastructures.Graph

Inserts and return a new vertex with a given element

InvalidEntryException - Exception in net.datastructures

Thrown when an entry is discovered to be invalid.

InvalidEntryException(String) - Constructor for exception net.datastructures.InvalidEntryException

InvalidKeyException - Exception in net.datastructures

Thrown when a key is determined to be invalid.

InvalidKeyException(String) - Constructor for exception net.datastructures.InvalidKeyException

InvalidPositionException - Exception in net.datastructures

Thrown when a position is determined to be invalid.

InvalidPositionException(String) - Constructor for exception net.datastructures.InvalidPositionException

InvalidPositionException() - Constructor for exception net.datastructures.InvalidPositionException

isEmpty() - Method in class net.datastructures.ArrayIndexList

Returns whether the indexed list is empty.

isEmpty() - Method in class net.datastructures.ArrayListCompleteBinaryTree

Returns whether the tree is empty.

isEmpty() - Method in class net.datastructures.ArrayStack

Testes whether the stack is empty.

isEmpty() - Method in class net.datastructures.BinarySearchTree

Returns whether the tree is empty.

isEmpty() - Method in interface net.datastructures.Deque

Returns whether the deque is empty.

isEmpty() - Method in interface net.datastructures.Dictionary

Returns whether the dictionary is empty.

isEmpty() - Method in class net.datastructures.HashTableMap

Returns whether or not the table is empty.

isEmpty() - Method in class net.datastructures.HeapPriorityQueue

Returns whether the heap is empty

isEmpty() - Method in interface net.datastructures.IndexList

Returns whether the list is empty.

isEmpty() - Method in class net.datastructures.LinkedBinaryTree

Returns whether the tree is empty.

isEmpty() - Method in class net.datastructures.LinkedTree

Returns whether the tree is empty.

isEmpty() - Method in interface net.datastructures.Map

Returns whether the map is empty.

isEmpty() - Method in class net.datastructures.NodeDeque

This function returns true if and only if the deque is empty

isEmpty() - Method in class net.datastructures.NodePositionList

Returns whether the list is empty; O(1) time

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

Returns whether the queue is empty.

isEmpty() - Method in class net.datastructures.NodeStack

Return whether the stack is empty.

isEmpty() - Method in interface net.datastructures.PositionList

Returns whether the list is empty.

isEmpty() - Method in interface net.datastructures.PriorityQueue

Returns whether the priority queue is empty.

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

Returns whether the queue is empty.

isEmpty() - Method in class net.datastructures.SortedListPriorityQueue

Returns whether the priority queue is empty.

isEmpty() - Method in interface net.datastructures.Stack

Return whether the stack is empty.

isEmpty() - Method in interface net.datastructures.Tree

Returns whether the tree is empty.

isExternal(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree

Returns whether v is an external node.

isExternal(Position<E>) - Method in class net.datastructures.LinkedBinaryTree

Returns whether a node is external.

isExternal(Position<E>) - Method in class net.datastructures.LinkedTree

Returns whether a node is external.

isExternal(Position<E>) - Method in interface net.datastructures.Tree

Returns whether a given node is external.

isFirst(Position<E>) - Method in class net.datastructures.NodePositionList

Returns whether a position is the first one; O(1) time

isInternal(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree

Returns whether v is an internal node.

isInternal(Position<E>) - Method in class net.datastructures.LinkedBinaryTree

Returns whether a node is internal.

isInternal(Position<E>) - Method in class net.datastructures.LinkedTree

Returns whether a node is internal.

isInternal(Position<E>) - Method in interface net.datastructures.Tree

Returns whether a given node is internal.

isLast(Position<E>) - Method in class net.datastructures.NodePositionList

Returns whether a position is the last one; O(1) time

isRoot(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree

Returns whether v is the root node.

isRoot(Position<E>) - Method in class net.datastructures.LinkedBinaryTree

Returns whether a node is the root.

isRoot(Position<E>) - Method in class net.datastructures.LinkedTree

Returns whether a node is the root.

isRoot(Position<E>) - Method in interface net.datastructures.Tree

Returns whether a given node is the root of the tree.

iterator() - Method in class net.datastructures.ArrayListCompleteBinaryTree

Returns an iterator of the elements stored at all nodes in the tree.

iterator() - Method in class net.datastructures.LinkedBinaryTree

Returns an iterator of the elements stored at the nodes

iterator() - Method in class net.datastructures.LinkedTree

Returns an iterator of the elements stored at the nodes

iterator() - Method in class net.datastructures.NodePositionList

Returns an iterator of all the elements in the list.

iterator() - Method in interface net.datastructures.PositionList

Returns an iterator of all the elements in the list.

iterator() - Method in interface net.datastructures.Tree

Returns an iterator of the elements stored in the tree.