|
||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
Interface Summary | |
---|---|
DirectedGraph | The interface describing directed graphs. |
DoubleFunction | |
Filter | grep filter moved from FiniteVariable 20081110 |
Graph | The interface describing undirected graphs. |
Class Summary | |
---|---|
AbstractDirectedGraph | Convenience class for implementing DirectedGraph. |
DepthFirstIterator | |
DirectedEdge | |
Edge | |
Graphs | A set of static routines for Graphs and DirectedGraphs. |
HashDirectedGraph | An implementation of a dirrected graph which stores the nodes and edges in a hash table to allow O(1) testing for inclusion, insertion, removal etc. |
HashGraph | An implementation of a Graph which stores the nodes and edges in a hash table to allow O(1) testing for inclusion,insertion, removal etc. |
Heap | A class implementing a binary heap. |
Heap.HeapElement | Helper class for implementing an object priority pair. |
IdentityArrayMap | Cheap but slow. |
IntDirectedGraph | |
IntGraph | |
MappedList | A List of unique values which can be indexed as a list and the index can be efficiently determined( O(1) time). |
RecursiveDepthFirstIterator | |
SetOperation | |
UnionFind | Implements a union find set. |
|
||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |