GODPAPER | All Packages | All Classes | Index | Frames No Frames |
de.polygonal.ds

Interfaces

| Interface | Description
--- | --- | ---
| Collection | A 'java-style' collection interface.
| Iterator | A 'java-style' iterator interface.
| LinkedList | A marker interface for linked list classes.
| LinkedListNode | A marker interface for the linked list nodes.

Classes

| Class | Description
--- | --- | ---
| Array2 | A two-dimensional array.
| Array3 | A three-dimensional array.
| ArrayedQueue | A queue based on an array (circular queue).
| ArrayedStack | An arrayed stack.
| BinarySearchTree | A Binary Search Tree (BST).
| BinaryTreeNode | A binary tree node from which you can build a binary tree.
| BitVector | A bit-vector.
| DLinkedList | A doubly linked list.
| DListIterator | A doubly linked list iterator.
| DListNode | A doubly linked list node.
| Graph | A linked uni-directional weighted graph structure.
| GraphArc | A weighted arc pointing to a graph node.
| GraphNode | A graph node.
| HashMap | A hash table using direct lookup (perfect hashing).
| HashTable | A hash table using linked overflow for collision resolving.
| Heap | A heap is a special kind of binary tree in which every node is greater than all of its children.
| LinkedQueue | A queue based on a linked list.
| LinkedStack | A stack based on a linked list.
| NullIterator | An do-nothing iterator for structures that don't support iterators.
| Prioritizable | All objects stored in a PriorityQueue have to extend this class.
| PriorityQueue | A priority queue to manage prioritized data.
| Set | A set is a collection of values, without any particular order and no repeated values.
| SLinkedList | A singly linked list.
| SListIterator | A singly linked list iterator.
| SListNode | A singly linked list node.
| TreeIterator | A tree iterator.
| TreeNode | A tree node for building a tree data structure.
| VectorUtils |

Thu Jan 16 2014, 01:13 PM +08:00