Class | Description |
---|---|
AbstractGraph | |
AdjustablePriorityQueue<E extends java.lang.Comparable> |
Priority queue with operation to improve/demote the priority of an element (node).
|
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
BTree s. |
DiGraph | |
Edge |
Edges are objects that connect
Vertices to form a graph.
|
EOL<E> | |
Graph | |
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.
|
TraLinkedList<E> |
TraLinkedList is a simple
linked list composed of
fi.uef.cs.tra.Listnodes.
|
TraSet<E> |
fi.uef.cs.tra.TraSet extends
java.util.TreeSet
with comparison methods.
|
Tree<E> |
Tree is a wrapper class for a root
TreeNode . |
TreeNode<E> |
TreeNode is a building block for basic
Tree s. |
Vertex |
Vertices are objects that are connected to other vertices by
Edge s to form a graph. |
Exception | Description |
---|---|
ElementTypeMismatchException |
ElementTypeMismatchException is a
TreeException used to signal a mismatch
in element classes. |
GraphException | |
TraLinkedListException |
TraLinkedListExceeption is a generic
RuntimeException for
TraLinkedList -related problems. |
TreeException |
TreeException is a generic
RuntimeException for
Tree -related problems. |