|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
| Uses of InvalidPositionException in net.datastructures |
|---|
| Methods in net.datastructures that throw InvalidPositionException | ||
|---|---|---|
void |
PositionList.addAfter(Position<E> p,
E e)
Inserts an element after the given node in the list. |
|
void |
NodePositionList.addAfter(Position<E> p,
E element)
Insert the given element after the given position; O(1) time |
|
void |
PositionList.addBefore(Position<E> p,
E e)
Inserts an element before the given node in the list. |
|
void |
NodePositionList.addBefore(Position<E> p,
E element)
Insert the given element before the given position; O(1) time |
|
boolean |
Graph.areAdjacent(Vertex<V> u,
Vertex<V> v)
Tests whether two vertices are adjacent |
|
boolean |
AdjacencyListGraph.areAdjacent(Vertex<V> u,
Vertex<V> v)
Test whether two vertices are adjacent |
|
void |
LinkedBinaryTree.attach(Position<E> v,
BinaryTree<E> T1,
BinaryTree<E> T2)
Attaches two trees to be subtrees of an external node. |
|
java.lang.Iterable<Position<E>> |
Tree.children(Position<E> v)
Returns an iterable collection of the children of a given node. |
|
java.lang.Iterable<Position<E>> |
LinkedTree.children(Position<E> v)
Returns an iterable collection of the children of a node. |
|
java.lang.Iterable<Position<E>> |
LinkedBinaryTree.children(Position<E> v)
Returns an iterable collection of the children of a node. |
|
java.lang.Iterable<Position<E>> |
ArrayListCompleteBinaryTree.children(Position<E> v)
Returns an iterable collection of the children of v. |
|
E |
DNode.element()
|
|
Vertex[] |
Graph.endVertices(Edge<E> e)
Returns the endvertices of a vertex as an array of length 2 |
|
Vertex<V>[] |
AdjacencyListGraph.endVertices(Edge<E> e)
Return the endvertices of a edge in an array of length 2 |
|
void |
LinkedBinaryTree.expandExternal(Position<E> v,
E l,
E r)
Expand an external node into an internal node with two external node children |
|
boolean |
LinkedBinaryTree.hasLeft(Position<E> v)
Returns whether a node has a left child. |
|
boolean |
BinaryTree.hasLeft(Position<E> v)
Returns whether a node has a left child. |
|
boolean |
ArrayListCompleteBinaryTree.hasLeft(Position<E> v)
Returns whether v has a left child. |
|
boolean |
LinkedBinaryTree.hasRight(Position<E> v)
Returns whether a node has a right child. |
|
boolean |
BinaryTree.hasRight(Position<E> v)
Returns whether a node has a right child. |
|
boolean |
ArrayListCompleteBinaryTree.hasRight(Position<E> v)
Returns whether v has a right child. |
|
java.lang.Iterable<Edge<E>> |
Graph.incidentEdges(Vertex<V> v)
Returns the edges incident on a vertex as an iterable collection |
|
java.lang.Iterable<Edge<E>> |
AdjacencyListGraph.incidentEdges(Vertex<V> v)
Return an iterator over the edges incident on a vertex |
|
int |
Sequence.indexOf(Position<E> p)
Returns the index of the element stored at the given position. |
|
Edge<E> |
Graph.insertEdge(Vertex<V> u,
Vertex<V> v,
E o)
Inserts and return a new edge with a given element between two vertices |
|
Edge<E> |
AdjacencyListGraph.insertEdge(Vertex<V> v,
Vertex<V> w,
E o)
Insert and return a new edge with a given element between two vertices |
|
Position<E> |
LinkedBinaryTree.insertLeft(Position<E> v,
E e)
Inserts a left child at a given node. |
|
Position<E> |
LinkedBinaryTree.insertRight(Position<E> v,
E e)
Inserts a right child at a given node. |
|
boolean |
Tree.isExternal(Position<E> v)
Returns whether a given node is external. |
|
boolean |
LinkedTree.isExternal(Position<E> v)
Returns whether a node is external. |
|
boolean |
LinkedBinaryTree.isExternal(Position<E> v)
Returns whether a node is external. |
|
boolean |
ArrayListCompleteBinaryTree.isExternal(Position<E> v)
Returns whether v is an external node. |
|
boolean |
NodePositionList.isFirst(Position<E> p)
Returns whether a position is the first one; O(1) time |
|
boolean |
Tree.isInternal(Position<E> v)
Returns whether a given node is internal. |
|
boolean |
LinkedTree.isInternal(Position<E> v)
Returns whether a node is internal. |
|
boolean |
LinkedBinaryTree.isInternal(Position<E> v)
Returns whether a node is internal. |
|
boolean |
ArrayListCompleteBinaryTree.isInternal(Position<E> v)
Returns whether v is an internal node. |
|
boolean |
NodePositionList.isLast(Position<E> p)
Returns whether a position is the last one; O(1) time |
|
boolean |
Tree.isRoot(Position<E> v)
Returns whether a given node is the root of the tree. |
|
boolean |
LinkedTree.isRoot(Position<E> v)
Returns whether a node is the root. |
|
boolean |
LinkedBinaryTree.isRoot(Position<E> v)
Returns whether a node is the root. |
|
boolean |
ArrayListCompleteBinaryTree.isRoot(Position<E> v)
Returns whether v is the root node. |
|
Position<E> |
LinkedBinaryTree.left(Position<E> v)
Returns the left child of a node. |
|
Position<E> |
BinaryTree.left(Position<E> v)
Returns the left child of a node. |
|
Position<E> |
ArrayListCompleteBinaryTree.left(Position<E> v)
Returns the left child of v. |
|
Position<E> |
PositionList.next(Position<E> p)
Returns the node after a given node in the list. |
|
Position<E> |
NodePositionList.next(Position<E> p)
Returns the position after the given one; O(1) time |
|
Vertex<V> |
Graph.opposite(Vertex<V> v,
Edge<E> e)
Returns the other endvertex of an incident edge |
|
Vertex<V> |
AdjacencyListGraph.opposite(Vertex<V> v,
Edge<E> e)
Return the other endvertex of an incident edge |
|
Position<E> |
Tree.parent(Position<E> v)
Returns the parent of a given node. |
|
Position<E> |
LinkedTree.parent(Position<E> v)
Returns the parent of a node. |
|
Position<E> |
LinkedBinaryTree.parent(Position<E> v)
Returns the parent of a node. |
|
Position<E> |
ArrayListCompleteBinaryTree.parent(Position<E> v)
Returns the parent of v. |
|
Position<E> |
PositionList.prev(Position<E> p)
Returns the node before a given node in the list. |
|
Position<E> |
NodePositionList.prev(Position<E> p)
Returns the position before the given one; O(1) time |
|
E |
PositionList.remove(Position<E> p)
Removes a node from the list, returning the element stored there. |
|
E |
NodePositionList.remove(Position<E> p)
Remove the given position from the list; O(1) time |
|
E |
LinkedBinaryTree.remove(Position<E> v)
Removes a node with zero or one child. |
|
void |
LinkedBinaryTree.removeAboveExternal(Position<E> v)
Remove an external node v and replace its parent with v's sibling |
|
E |
Graph.removeEdge(Edge<E> e)
Removes an edge and return its element |
|
E |
AdjacencyListGraph.removeEdge(Edge<E> e)
Remove an edge and return its element |
|
V |
Graph.removeVertex(Vertex<V> v)
Removes a vertex and all its incident edges and returns the element stored at the removed vertex |
|
V |
AdjacencyListGraph.removeVertex(Vertex<V> v)
Remove a vertex and all its incident edges and return the element stored at the removed vertex |
|
E |
Graph.replace(Edge<E> p,
E o)
Replaces the element of a given edge with a new element and returns the old element |
|
E |
AdjacencyListGraph.replace(Edge<E> p,
E o)
|
|
E |
Tree.replace(Position<E> v,
E e)
Replaces the element stored at a given node. |
|
E |
LinkedTree.replace(Position<E> v,
E o)
Replaces the element at a node. |
|
E |
LinkedBinaryTree.replace(Position<E> v,
E o)
Replaces the element at a node. |
|
E |
ArrayListCompleteBinaryTree.replace(Position<E> v,
E o)
Replaces the element at v. |
|
|
AdjacencyListGraph.replace(Position<T> p,
T o)
Replace the element a given position (vertex or edge) with a new element and return the old element |
|
V |
Graph.replace(Vertex<V> p,
V o)
Replaces the element of a given vertex with a new element and returns the old element |
|
V |
AdjacencyListGraph.replace(Vertex<V> p,
V o)
|
|
Position<E> |
LinkedBinaryTree.right(Position<E> v)
Returns the right child of a node. |
|
Position<E> |
BinaryTree.right(Position<E> v)
Returns the right child of a node. |
|
Position<E> |
ArrayListCompleteBinaryTree.right(Position<E> v)
Returns the right child of v. |
|
E |
PositionList.set(Position<E> p,
E e)
Replaces the element stored at the given node, returning old element. |
|
E |
NodePositionList.set(Position<E> p,
E element)
Replace the element at the given position with the new element and return the old element; O(1) time |
|
Position<E> |
LinkedBinaryTree.sibling(Position<E> v)
Return the sibling of a node |
|
Position<E> |
ArrayListCompleteBinaryTree.sibling(Position<E> v)
Returns the sibling of v. |
|
void |
NodePositionList.swapElements(Position<E> a,
Position<E> b)
Swap the elements of two give positions; O(1) time |
|
void |
LinkedTree.swapElements(Position<E> v,
Position<E> w)
Swap the elements at two nodes |
|
void |
LinkedBinaryTree.swapElements(Position<E> v,
Position<E> w)
Swap the elements at two nodes |
|
void |
ArrayListCompleteBinaryTree.swapElements(Position<E> v,
Position<E> w)
Swaps the elements at two nodes. |
|
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||