Package fi.joensuu.cs.tra

Class Summary

AbstractGraph
AssignablePriorityQueue<E>	AssignablePriorityQueue is a wrapper for java.util.PriorityQueue that allows specifying an float priority for each element.
BTree<E>	BTree is a wrapper class for a root BTreeNode.
BTreeNode<E>	BTreeNode is a building block for basic BTrees.
DiGraph	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.
Edge	Edges are objects that connect Vertices to form a graph.
EOL<E>	EOL is a subclass of ListNode used to mark the end of the end of TraLinkedList.
Graph	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.
LinkedDeque<E>	LinkedDeque extends java.util.LinkedList to highlight Deque behaviour.
LinkedQueue<E>	LinkedQueue extends java.util.LinkedList to highlight java.util.Queue-defined behaviour.
LinkedStack<E>	LinkedStack extends java.util.LinkedList with behaviour expected of a Stack.
ListNode<E>	ListNodes are the building blocks of the TraLinkedLists.
PriorityQueue<E>	PriorityQueue is a convenience extension of java.util.PriorityQueue for relocation.
Set<E>	fi.joensuu.cs.tra.Set extends java.util.TreeSet with comparison methods.
TraLinkedList<E>	TraLinkedList is a simple linked list composed of fi.joensuu.cs.tra.Listnodes.
Tree<E>	Tree is a wrapper class for a root TreeNode.
TreeNode<E>	TreeNode is a building block for basic Trees.
Vertex	Vertices are objects that are connected to other vertices by Edges to form a graph.

Exception Summary

ElementTypeMismatchException	ElementTypeMismatchException is a TreeException used to signal a mismatch in element classes.
GraphException	GraphException is a generic RuntimeException for Graph and DiGraph -related problems.
TraLinkedListException	TraLinkedListExceeption is a generic RuntimeException for TraLinkedList -related problems.
TreeException	TreeException is a generic RuntimeException for Tree -related problems.