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

A

AbstractGraph - Class in fi.uef.cs.tra

AbstractGraph.EdgeIteratorWrapper - Class in fi.uef.cs.tra

AbstractGraph.VertexIteratorWrapper - Class in fi.uef.cs.tra

add(float, E) - Method in class fi.uef.cs.tra.AssignablePriorityQueue

Deprecated.

Use add(E element, float priority) instead.

add(E, float) - Method in class fi.uef.cs.tra.AssignablePriorityQueue

Inserts a specified element to the priority queue with the specified priority.

add(E) - Method in class fi.uef.cs.tra.PriorityQueue

add(E) - Method in class fi.uef.cs.tra.TraSet

addAll(Collection<? extends E>) - Method in class fi.uef.cs.tra.TraSet

addEdge(Vertex, String, int, float) - Method in class fi.uef.cs.tra.Vertex

Attaches a new Edge between this Vertex and the specified one.

addEdge(Vertex, String, int) - Method in class fi.uef.cs.tra.Vertex

Attaches a new Edge between this Vertex and the specified one.

addEdge(Vertex, String) - Method in class fi.uef.cs.tra.Vertex

Attaches a new Edge between this Vertex and the specified one.

addEdge(Vertex) - Method in class fi.uef.cs.tra.Vertex

Attaches a new Edge between this Vertex and the specified one.

addEdge(Vertex, int, float) - Method in class fi.uef.cs.tra.Vertex

Attaches a new Edge between this Vertex and the specified one.

addEdge(Vertex, int) - Method in class fi.uef.cs.tra.Vertex

Attaches a new Edge between this Vertex and the specified one.

addEdge(Vertex, float) - Method in class fi.uef.cs.tra.Vertex

Attaches a new Edge between this Vertex and the specified one.

addFirst(E) - Method in class fi.uef.cs.tra.LinkedDeque

Inserts the given element to the front of this deque.

addLast(E) - Method in class fi.uef.cs.tra.LinkedDeque

Inserts the given element to the rear of this deque.

addVertex(String, int, float, int) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex(String, int, int) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex(String, int) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex(int) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex(int, float, int) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex(int, int) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex(float, int) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex(String, int, float) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex(String) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex() - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex(int, float) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

addVertex(float) - Method in class fi.uef.cs.tra.AbstractGraph

Adds a Vertex to this graph with the specified attributes.

AdjustablePriorityQueue<E extends java.lang.Comparable> - Class in fi.uef.cs.tra

Priority queue with operation to improve/demote the priority of an element (node).

AdjustablePriorityQueue() - Constructor for class fi.uef.cs.tra.AdjustablePriorityQueue

Default constructor.

AssignablePriorityQueue<E> - Class in fi.uef.cs.tra

AssignablePriorityQueue is a wrapper for java.util.PriorityQueue that allows specifying an float priority for each element.

AssignablePriorityQueue() - Constructor for class fi.uef.cs.tra.AssignablePriorityQueue

Creates an AssignablePriorityQueue with the default initial capacity (11) that orders its elements according to the natural ordering of their assigned priorities.

AssignablePriorityQueue(int) - Constructor for class fi.uef.cs.tra.AssignablePriorityQueue

Creates an AssignablePriorityQueue with the specified initial capacity (11) that orders its elements according to the natural ordering of their assigned priorities.

B

BLACK - Static variable in class fi.uef.cs.tra.AbstractGraph

Named constant (0)

BLUE - Static variable in class fi.uef.cs.tra.AbstractGraph

Named constant (5)

BTree<E> - Class in fi.uef.cs.tra

BTree is a wrapper class for a root BTreeNode.

BTree() - Constructor for class fi.uef.cs.tra.BTree

Creates an empty BTree.

BTree(BTreeNode<E>) - Constructor for class fi.uef.cs.tra.BTree

Creates a BTree with the specified BTreeNode as the root node.

BTreeNode<E> - Class in fi.uef.cs.tra

BTreeNode is a building block for basic BTrees.

BTreeNode(E) - Constructor for class fi.uef.cs.tra.BTreeNode

Creates a new BTreeNode with the specified element.

C

clear() - Method in class fi.uef.cs.tra.AssignablePriorityQueue

Remove all elements from the priority queue.

clear() - Method in class fi.uef.cs.tra.LinkedDeque

Removes all the elements from this deque.

clear() - Method in class fi.uef.cs.tra.LinkedQueue

Removes all of the elements from this queue

clear() - Method in class fi.uef.cs.tra.LinkedStack

Removes all the elements from this stack.

clear() - Method in class fi.uef.cs.tra.PriorityQueue

clear() - Method in class fi.uef.cs.tra.TraSet

clone() - Method in class fi.uef.cs.tra.TraSet

comparator() - Method in class fi.uef.cs.tra.PriorityQueue

comparator() - Method in class fi.uef.cs.tra.TraSet

compareTo(Object) - Method in class fi.uef.cs.tra.Edge

Defined in Comparable.

compareTo(Object) - Method in class fi.uef.cs.tra.Vertex

Defined in Comparable.

contains(Object) - Method in class fi.uef.cs.tra.TraSet

D

decreasePriority(BTreeNode<E>) - Method in class fi.uef.cs.tra.AdjustablePriorityQueue

Fix the priority queue after the priority of the element in BTreeNode has been changed to worse one.

destroyNode(BTreeNode<E>) - Method in class fi.uef.cs.tra.BTree

Removes a single node.

destroyNode(TreeNode<E>) - Method in class fi.uef.cs.tra.Tree

Removes a single node.

difference(Collection<? extends E>) - Method in class fi.uef.cs.tra.TraSet

Returns the difference of this TraSet and the specified Collection.

DiGraph - Class in fi.uef.cs.tra

A DiGraph or a directed graph is an ordered pair G := (V, A) with V, a set of vertices and A, a set of directed edges.

DiGraph() - Constructor for class fi.uef.cs.tra.DiGraph

E

Edge - Class in fi.uef.cs.tra

Edges are objects that connect Vertices to form a graph.

edgeIterator() - Method in class fi.uef.cs.tra.AbstractGraph

Returns an Iterator over the edges of this graph.

edgeIterator() - Method in class fi.uef.cs.tra.Vertex

Returns an Iterator over the Edges attached to this Vertex.

EdgeIteratorWrapper() - Constructor for class fi.uef.cs.tra.AbstractGraph.EdgeIteratorWrapper

EdgeIteratorWrapper() - Constructor for class fi.uef.cs.tra.Vertex.EdgeIteratorWrapper

edges() - Method in class fi.uef.cs.tra.AbstractGraph

Returns an Iterable over this graph's edges.

edges() - Method in class fi.uef.cs.tra.Vertex

Returns an java.util.Iterable over this Vertex's Edges that can be used in a foreach construct.

element() - Method in class fi.uef.cs.tra.LinkedQueue

Retrieves, but does not remove, the head of this queue.

elementIterator() - Method in class fi.uef.cs.tra.TraLinkedList

Returns an Iterator over the elements of this list.

ElementIteratorWrapper() - Constructor for class fi.uef.cs.tra.TraLinkedList.ElementIteratorWrapper

elements() - Method in class fi.uef.cs.tra.TraLinkedList

Returns an Iterable covering the elements of this list for use with the foreach-construct.

ElementTypeMismatchException - Exception in fi.uef.cs.tra

ElementTypeMismatchException is a TreeException used to signal a mismatch in element classes.

EOL<E> - Class in fi.uef.cs.tra

EOL is a subclass of ListNode used to mark the end of the end of TraLinkedList.

EOL - Variable in class fi.uef.cs.tra.TraLinkedList

Denotes the end of the list.

equals(Collection<? extends E>) - Method in class fi.uef.cs.tra.TraSet

Checks if this TraSet and the specified Collection contain the same elements.

F

fi.uef.cs.tra - package fi.uef.cs.tra

find(ListNode<E>, E) - Method in class fi.uef.cs.tra.TraLinkedList

Returns the first ListNode with the specified element starting from the specified ListNode or null if none is found.

first() - Method in class fi.uef.cs.tra.TraLinkedList

Returns the first node of this list.

first() - Method in class fi.uef.cs.tra.TraSet

firstVertex() - Method in class fi.uef.cs.tra.AbstractGraph

Returns the first Vertex in this graph.

G

getBalance() - Method in class fi.uef.cs.tra.BTreeNode

Returns this node's balance.

getBalance() - Method in class fi.uef.cs.tra.TreeNode

Returns this node's balance.

getColor() - Method in class fi.uef.cs.tra.Edge

Gets the color of this Edge.

getColor() - Method in class fi.uef.cs.tra.Vertex

Gets this Vertex's color.

getEdge(Vertex) - Method in class fi.uef.cs.tra.Vertex

Returns the edge from this Vertex to the specified one or null if one doesn't exist.

getElement() - Method in class fi.uef.cs.tra.BTreeNode

Returns this node's element.

getElement() - Method in class fi.uef.cs.tra.EOL

Always throws an TraLinkedListException.

getElement() - Method in class fi.uef.cs.tra.ListNode

Returns this ListNode's element.

getElement() - Method in class fi.uef.cs.tra.TreeNode

Returns this node's element.

getEndPoint(Vertex) - Method in class fi.uef.cs.tra.Edge

Returns the Vertex on the other end of the specified Edge.

getEndPoint() - Method in class fi.uef.cs.tra.Edge

Returns the end point of this Edge.

getFirst() - Method in class fi.uef.cs.tra.LinkedDeque

Returns but does not remove the element at the front of this deque.

getIndex() - Method in class fi.uef.cs.tra.Vertex

Gets this Vertex's index.

getLabel() - Method in class fi.uef.cs.tra.Edge

Gets the label of this Edge.

getLabel() - Method in class fi.uef.cs.tra.Vertex

Gets this Vertex's label.

getLast() - Method in class fi.uef.cs.tra.LinkedDeque

Returns but does not remove the element at the rear of this deque.

getLeftChild() - Method in class fi.uef.cs.tra.BTreeNode

Returns this node's leftmost child.

getLeftChild() - Method in class fi.uef.cs.tra.TreeNode

Returns this node's leftmost child.

getParent() - Method in class fi.uef.cs.tra.BTreeNode

Returns this node's parent node.

getParent() - Method in class fi.uef.cs.tra.TreeNode

Returns this node's parent node.

getRightChild() - Method in class fi.uef.cs.tra.BTreeNode

Returns this node's right child.

getRightSibling() - Method in class fi.uef.cs.tra.TreeNode

Returns this node's right sibling.

getRoot() - Method in class fi.uef.cs.tra.BTree

Returns the root of this BTree.

getRoot() - Method in class fi.uef.cs.tra.Tree

Returns the root of this Tree.

getStartPoint() - Method in class fi.uef.cs.tra.Edge

Returns the starting point of this Edge.

getWeight() - Method in class fi.uef.cs.tra.Edge

Gets the weight of this Edge.

getWeight() - Method in class fi.uef.cs.tra.Vertex

Gets this Vertex's weight.

goesOut(Vertex) - Method in class fi.uef.cs.tra.Edge

Determines whether this Edge goes out from the specified Vertex.

Graph - Class in fi.uef.cs.tra

A Graph or an undirected graph is an ordered pair G := (V, E) with V, a set of vertices and E, a set of undirected edges.

Graph() - Constructor for class fi.uef.cs.tra.Graph

GraphException - Exception in fi.uef.cs.tra

GraphException is a generic RuntimeException for Graph and DiGraph -related problems.

GRAY - Static variable in class fi.uef.cs.tra.AbstractGraph

Named constant (2)

GREEN - Static variable in class fi.uef.cs.tra.AbstractGraph

Named constant (4)

GREY - Static variable in class fi.uef.cs.tra.AbstractGraph

Named constant (2)

H

headSet(E) - Method in class fi.uef.cs.tra.TraSet

I

improvePriority(BTreeNode<E>) - Method in class fi.uef.cs.tra.AdjustablePriorityQueue

Fix the priority queue after the priority of the element in BTreeNode has been changed to better one.

insert(ListNode<E>, E) - Method in class fi.uef.cs.tra.TraLinkedList

Inserts a new ListNode with the specified element in front of the specified ListNode.

intersection(Collection<? extends E>) - Method in class fi.uef.cs.tra.TraSet

Returns the intersection of this TraSet and the specified Collection.

isAdjacent(Vertex) - Method in class fi.uef.cs.tra.Vertex

Determines if the specified Vertex is adjacent to this one (whether they are connected with an Edge.)

isDiGraph() - Method in class fi.uef.cs.tra.AbstractGraph

isEmpty() - Method in class fi.uef.cs.tra.AdjustablePriorityQueue

Operation to check if priority queue is empty or not.

isEmpty() - Method in class fi.uef.cs.tra.BTree

Returns true if this BTree is empty.

isEmpty() - Method in class fi.uef.cs.tra.TraLinkedList

Returns true if this list is empty.

isEmpty() - Method in class fi.uef.cs.tra.TraSet

isEmpty() - Method in class fi.uef.cs.tra.Tree

Returns true if this Tree is empty.

iterator() - Method in class fi.uef.cs.tra.AbstractGraph.EdgeIteratorWrapper

iterator() - Method in class fi.uef.cs.tra.AbstractGraph

Returns an Iterator over the vertices of this graph.

iterator() - Method in class fi.uef.cs.tra.AbstractGraph.VertexIteratorWrapper

iterator() - Method in class fi.uef.cs.tra.AssignablePriorityQueue

Returns an iterator over the elements in this queue.

iterator() - Method in class fi.uef.cs.tra.PriorityQueue

iterator() - Method in class fi.uef.cs.tra.TraLinkedList.ElementIteratorWrapper

iterator() - Method in class fi.uef.cs.tra.TraLinkedList

Returns an Iterator over the elements of this list.

iterator() - Method in class fi.uef.cs.tra.TraLinkedList.NodeIteratorWrapper

iterator() - Method in class fi.uef.cs.tra.TraSet

iterator() - Method in class fi.uef.cs.tra.Vertex.EdgeIteratorWrapper

iterator() - Method in class fi.uef.cs.tra.Vertex

Returns an Iterator over the Edges attached to this Vertex.

iterator() - Method in class fi.uef.cs.tra.Vertex.NeighborIteratorWrapper

K

killNode(TreeNode<E>) - Method in class fi.uef.cs.tra.Tree

Kills a node.

L

last() - Method in class fi.uef.cs.tra.TraLinkedList

Returns the last node of this list.

last() - Method in class fi.uef.cs.tra.TraSet

LinkedDeque<E> - Class in fi.uef.cs.tra

LinkedDeque extends java.util.LinkedList to highlight Deque behaviour.

LinkedDeque() - Constructor for class fi.uef.cs.tra.LinkedDeque

Creates an empty list.

LinkedDeque(Collection<? extends E>) - Constructor for class fi.uef.cs.tra.LinkedDeque

Constructs a deque containing the elements of the specified collection, in the order they are returned by the collection's iterator.

LinkedQueue<E> - Class in fi.uef.cs.tra

LinkedQueue extends java.util.LinkedList to highlight java.util.Queue-defined behaviour.

LinkedQueue() - Constructor for class fi.uef.cs.tra.LinkedQueue

Creates an empty queue.

LinkedQueue(Collection<? extends E>) - Constructor for class fi.uef.cs.tra.LinkedQueue

Constructs a queue containing the elements of the specified collection, in the order they are returned by the collection's iterator.

LinkedStack<E> - Class in fi.uef.cs.tra

LinkedStack extends java.util.LinkedList with behaviour expected of a Stack.

LinkedStack() - Constructor for class fi.uef.cs.tra.LinkedStack

Creates an empty Stack.

LinkedStack(Collection<? extends E>) - Constructor for class fi.uef.cs.tra.LinkedStack

Constructs a stack containing the elements of the specified collection, in the order they are returned by the collection's iterator.

ListNode<E> - Class in fi.uef.cs.tra

ListNodes are the building blocks of the TraLinkedLists.

N

NaN - Static variable in class fi.uef.cs.tra.AbstractGraph

NaN is used to represent a missing color or weight.

neighborIterator() - Method in class fi.uef.cs.tra.Vertex

Returns an Iterator over this Vertex's neighbors.

NeighborIteratorWrapper() - Constructor for class fi.uef.cs.tra.Vertex.NeighborIteratorWrapper

neighbors() - Method in class fi.uef.cs.tra.Vertex

Returns an java.util.Iterable over this Vertex's neighbors that can be used in a foreach construct.

next() - Method in class fi.uef.cs.tra.EOL

Always throws a TraLinkedListException.

next() - Method in class fi.uef.cs.tra.ListNode

Returns this ListNode's next node.

next(ListNode<E>) - Method in class fi.uef.cs.tra.TraLinkedList

Returns the specified ListNode's next ListNode or EOL if none exists.

nodeIterator() - Method in class fi.uef.cs.tra.TraLinkedList

Returns an Iterator over the nodes of this list.

NodeIteratorWrapper() - Constructor for class fi.uef.cs.tra.TraLinkedList.NodeIteratorWrapper

nodes() - Method in class fi.uef.cs.tra.TraLinkedList

Returns an Iterable covering the nodes of this list for use with the foreach-construct.

O

offer(E) - Method in class fi.uef.cs.tra.AdjustablePriorityQueue

Inserts an element to priority queue.

offer(E) - Method in class fi.uef.cs.tra.LinkedQueue

Inserts the specified element into the rear of this queue.

P

peek() - Method in class fi.uef.cs.tra.AssignablePriorityQueue

Retrieves, but does not remove, the head of this queue, returning null if this queue is empty.

peek() - Method in class fi.uef.cs.tra.LinkedQueue

Retrieves, but does not remove, the head of this queue, returning null if this queue is empty.

peek() - Method in class fi.uef.cs.tra.LinkedStack

Returns but does not remove the element at the top of this stack.

poll() - Method in class fi.uef.cs.tra.AdjustablePriorityQueue

Remove and return the most important element of the priority queue.

poll() - Method in class fi.uef.cs.tra.AssignablePriorityQueue

Removes and returns the head of this queue, or null if this queue is empty.

poll() - Method in class fi.uef.cs.tra.LinkedQueue

Retrieves and removes the head of this queue, or null if this queue is empty.

poll() - Method in class fi.uef.cs.tra.PriorityQueue

pop() - Method in class fi.uef.cs.tra.LinkedStack

Removes and returns the element at the top of this stack.

previous() - Method in class fi.uef.cs.tra.EOL

Always throws an TraLinkedListException.

previous() - Method in class fi.uef.cs.tra.ListNode

Returns this ListNode's previous node.

previous(ListNode<E>) - Method in class fi.uef.cs.tra.TraLinkedList

Returns the specified ListNode's previous ListNode or null if none exists.

PriorityQueue<E> - Class in fi.uef.cs.tra

PriorityQueue is a convenience extension of java.util.PriorityQueue for relocation.

PriorityQueue() - Constructor for class fi.uef.cs.tra.PriorityQueue

Creates a PriorityQueue with the default initial capacity (11) that orders its elements according to their natural ordering (using java.util.Comparable).

PriorityQueue(int) - Constructor for class fi.uef.cs.tra.PriorityQueue

Creates a PriorityQueue with the specified initial capacity that orders its elements according to their natural ordering (using java.util.Comparable).

PriorityQueue(int, Comparator<? super E>) - Constructor for class fi.uef.cs.tra.PriorityQueue

Creates a PriorityQueue with the specified initial capacity that orders its elements according to the specified comparator.

PriorityQueue(Collection<? extends E>) - Constructor for class fi.uef.cs.tra.PriorityQueue

Creates a PriorityQueue containing the elements in the specified collection.

PriorityQueue(PriorityQueue<? extends E>) - Constructor for class fi.uef.cs.tra.PriorityQueue

Creates a PriorityQueue containing the elements in the specified collection.

PriorityQueue(SortedSet<? extends E>) - Constructor for class fi.uef.cs.tra.PriorityQueue

Creates a PriorityQueue containing the elements in the specified collection.

push(E) - Method in class fi.uef.cs.tra.LinkedStack

Pushes an element onto the top of this stack.

R

RED - Static variable in class fi.uef.cs.tra.AbstractGraph

Named constant (3)

remove() - Method in class fi.uef.cs.tra.LinkedQueue

Retrieves and removes the head of this queue.

remove(Object) - Method in class fi.uef.cs.tra.PriorityQueue

remove(ListNode<E>) - Method in class fi.uef.cs.tra.TraLinkedList

Removes a ListNode from this TraLinkedList.

remove(Object) - Method in class fi.uef.cs.tra.TraSet

removeEdge(Edge) - Method in class fi.uef.cs.tra.Vertex

Removes the specified Edge.

removeEdges() - Method in class fi.uef.cs.tra.Vertex

Removes all the Edges attached to this Vertex.

removeFirst() - Method in class fi.uef.cs.tra.LinkedDeque

Removes and returns the element at the front of this deque.

removeLast() - Method in class fi.uef.cs.tra.LinkedDeque

Removes and returns the element at the rear of this deque.

removeLeftChild() - Method in class fi.uef.cs.tra.BTreeNode

Removes this node's left child.

removeLeftChild() - Method in class fi.uef.cs.tra.TreeNode

Removes this node's left child.

removeRightChild() - Method in class fi.uef.cs.tra.BTreeNode

Removes this node's right child.

removeRightSibling() - Method in class fi.uef.cs.tra.TreeNode

Removes this node's right sibling.

removeVertex(Vertex) - Method in class fi.uef.cs.tra.AbstractGraph

Removes the specified Vertex and all attached Edges from this graph.

S

setBalance(int) - Method in class fi.uef.cs.tra.BTreeNode

Sets this node's balance.

setBalance(int) - Method in class fi.uef.cs.tra.TreeNode

Sets this node's balance.

setColor(int) - Method in class fi.uef.cs.tra.Edge

Sets the color of this Edge.

setColor(int) - Method in class fi.uef.cs.tra.Vertex

Sets this Vertex's color.

setElement(E) - Method in class fi.uef.cs.tra.BTreeNode

Sets this node's element.

setElement(E) - Method in class fi.uef.cs.tra.TreeNode

Sets this node's element.

setIndex(int) - Method in class fi.uef.cs.tra.Vertex

Sets this Vertex's index.

setLabel(String) - Method in class fi.uef.cs.tra.Edge

Sets the label of this Edge.

setLabel(String) - Method in class fi.uef.cs.tra.Vertex

Sets this Vertex's label.

setLeftChild(BTreeNode<E>) - Method in class fi.uef.cs.tra.BTreeNode

Sets this node's left child.

setLeftChild(BTree<E>) - Method in class fi.uef.cs.tra.BTreeNode

Sets this node's left child to be the root node of the specified BTree.

setLeftChild(TreeNode<E>) - Method in class fi.uef.cs.tra.TreeNode

Sets this node's left child.

setLeftChild(Tree<E>) - Method in class fi.uef.cs.tra.TreeNode

Sets this node's left child to be the root node of the specified Tree.

setParent(TreeComponent<E>) - Method in class fi.uef.cs.tra.BTreeNode

Sets this node's parent.

setRightChild(BTreeNode<E>) - Method in class fi.uef.cs.tra.BTreeNode

Sets this node's right child.

setRightChild(BTree<E>) - Method in class fi.uef.cs.tra.BTreeNode

Sets this node's right child to be the root node of the specified BTree.

setRightSibling(TreeNode<E>) - Method in class fi.uef.cs.tra.TreeNode

Sets this node's right sibling.

setRightSibling(Tree<E>) - Method in class fi.uef.cs.tra.TreeNode

Sets this node's right sibling to be the root node of the specified Tree.

setRoot(BTreeNode<E>) - Method in class fi.uef.cs.tra.BTree

Sets the root of this BTree.

setRoot(TreeNode<E>) - Method in class fi.uef.cs.tra.Tree

Sets the root of this Tree.

setWeight(float) - Method in class fi.uef.cs.tra.Edge

Sets the weight of this Edge.

setWeight(float) - Method in class fi.uef.cs.tra.Vertex

Sets this Vertex's weight.

size() - Method in class fi.uef.cs.tra.AbstractGraph

Returns the number of vertices in this graph.

size() - Method in class fi.uef.cs.tra.AssignablePriorityQueue

Returns the number of elements in this queue.

size() - Method in class fi.uef.cs.tra.PriorityQueue

size() - Method in class fi.uef.cs.tra.TraSet

subSet(E, E) - Method in class fi.uef.cs.tra.TraSet

T

tailSet(E) - Method in class fi.uef.cs.tra.TraSet

toString() - Method in class fi.uef.cs.tra.AbstractGraph

Returns the string representation of this graph.

toString() - Method in class fi.uef.cs.tra.AdjustablePriorityQueue

String representation of priority queue.

toString() - Method in class fi.uef.cs.tra.BTreeNode

Returns (element) as String.

toString() - Method in class fi.uef.cs.tra.Edge

Produces a String representation of this Edge.

toString() - Method in class fi.uef.cs.tra.EOL

toString() - Method in class fi.uef.cs.tra.ListNode

Returns the element's toString().

toString() - Method in class fi.uef.cs.tra.Vertex

Returns a String representation of this Vertex.

toString(boolean) - Method in class fi.uef.cs.tra.Vertex

Returns a String representation of this Vertex and optionally its neighbors and their connecting Edges.

TraLinkedList<E> - Class in fi.uef.cs.tra

TraLinkedList is a simple linked list composed of fi.uef.cs.tra.Listnodes.

TraLinkedList() - Constructor for class fi.uef.cs.tra.TraLinkedList

Creates an empty list.

TraLinkedList(String) - Constructor for class fi.uef.cs.tra.TraLinkedList

Creates an empty list and uses elements instead of "nodes" in iterator exceptions.

TraLinkedList.ElementIteratorWrapper - Class in fi.uef.cs.tra

TraLinkedList.NodeIteratorWrapper - Class in fi.uef.cs.tra

TraLinkedListException - Exception in fi.uef.cs.tra

TraLinkedListExceeption is a generic RuntimeException for TraLinkedList -related problems.

TraSet<E> - Class in fi.uef.cs.tra

fi.uef.cs.tra.TraSet extends java.util.TreeSet with comparison methods.

TraSet() - Constructor for class fi.uef.cs.tra.TraSet

Constructs a new, empty set, sorted according to the elements' natural order.

TraSet(Collection<? extends E>) - Constructor for class fi.uef.cs.tra.TraSet

Constructs a new set containing the elements in the specified collection, sorted according to the elements' natural order.

TraSet(Comparator<? super E>) - Constructor for class fi.uef.cs.tra.TraSet

Constructs a new, empty set, sorted according to the specified comparator.

TraSet(SortedSet<E>) - Constructor for class fi.uef.cs.tra.TraSet

Constructs a new set containing the same elements as the specified sorted set, sorted according to the same ordering.

Tree<E> - Class in fi.uef.cs.tra

Tree is a wrapper class for a root TreeNode.

Tree() - Constructor for class fi.uef.cs.tra.Tree

Creates an empty Tree.

Tree(TreeNode<E>) - Constructor for class fi.uef.cs.tra.Tree

Creates a Tree with the specified TreeNode as the root node.

TreeException - Exception in fi.uef.cs.tra

TreeException is a generic RuntimeException for Tree -related problems.

TreeNode<E> - Class in fi.uef.cs.tra

TreeNode is a building block for basic Trees.

TreeNode(E) - Constructor for class fi.uef.cs.tra.TreeNode

Creates a new TreeNode with the specified element.

U

union(Collection<? extends E>) - Method in class fi.uef.cs.tra.TraSet

Returns the union of this TraSet and the specified Collection.

V

Vertex - Class in fi.uef.cs.tra

Vertices are objects that are connected to other vertices by Edges to form a graph.

Vertex.EdgeIteratorWrapper - Class in fi.uef.cs.tra

Vertex.NeighborIteratorWrapper - Class in fi.uef.cs.tra

vertexCount() - Method in class fi.uef.cs.tra.AbstractGraph

Returns the number of vertices in this graph.

vertexIterator() - Method in class fi.uef.cs.tra.AbstractGraph

Returns an Iterator over the vertices of this graph.

VertexIteratorWrapper() - Constructor for class fi.uef.cs.tra.AbstractGraph.VertexIteratorWrapper

vertices() - Method in class fi.uef.cs.tra.AbstractGraph

Returns an Iterable over this graph's vertices.

W

WHITE - Static variable in class fi.uef.cs.tra.AbstractGraph

Named constant (1)

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