|
Grafalgo
Library of useful data structures and algorithms
|
| grafalgo::Adt | Base class from which other data structures in grafalgo are derived |
| altPath | |
| augPath | This class encapsulates data and routines used by the augmenting path algorithms for max flow |
| grafalgo::BalBstSet | Balanced binary search trees class |
| edmonds::BridgePair | |
| fastEdmonds::BridgePair | |
| grafalgo::BstSet::BstNode | |
| grafalgo::BstSet::BstPair | |
| grafalgo::BstSet | Data structure that represents a collection of "sorted sets" |
| capScale | |
| grafalgo::ClistSet | This class represents a collection of lists defined on a set of unique integers 1..n |
| cycRed | |
| grafalgo::Dheap | This class implements a heap data structure |
| grafalgo::DheapSet | This class implements a collection of heaps |
| grafalgo::DiffHeap | This class implements a heap data structure |
| grafalgo::Digraph | Data structure for undirected graph with edge weights |
| dinic | |
| dinicDtrees | |
| grafalgo::DkBstSet | This class represents a collection of binary search trees in which nodes have two different keys |
| grafalgo::Dlist | Data structure representing a list of indexes |
| grafalgo::Dtrees | This class implements a collection trees |
| grafalgo::Graph::EdgeInfo | |
| edmonds | |
| grafalgo::Exception | This class contains exceptions used within grafalgo |
| faltPath | |
| fastEdmonds | |
| grafalgo::FheapSet | Collection of Fibonacci heaps |
| grafalgo::Flograph | Class that represents a flograph |
| grafalgo::Flograph::FloInfo | |
| grafalgo::FheapSet::Fnode | |
| grafalgo::Graph | Data structure for undirected graph |
| grafalgo::HashMap | Maintains set of (key, value) pairs where key is a 64 bit value and value is a positive 32 bit integer |
| grafalgo::HashSet | Maintains a set, where an element is a 64 bit integer |
| grafalgo::HashTbl | Maintains set of (key, value) pairs where key is a 64 bit value and value is an index in a specified range |
| grafalgo::HeapSet | This class implements a collection of heaps |
| grafalgo::LheapSet::hnode | |
| grafalgo::IdMap | Data structure that assigns small integer identifiers to large keys |
| grafalgo::IllegalArgumentException | This exception is thrown by methods that detect illegal argument values |
| grafalgo::InputException | This exception is thrown by methods that encounter an error while attempting to read in a data structure |
| lcap | |
| grafalgo::LheapSet | Data structure that represents a collection of leftist heaps |
| grafalgo::List | Data structure representing a list of indexes |
| grafalgo::ListSet::listhdr | |
| grafalgo::RlistSet::ListNode | |
| grafalgo::ListSet | Header file for data structure representing a collection of lists defined over index values 1,2,.. |
| grafalgo::LlheapSet | Lazy Collection of leftist heaps This version uses implicit deletion |
| grafalgo::ClistSet::lnode | |
| LongestMatchPrefix | |
| maxCap | |
| grafalgo::Mflograph | Class representing a flow graph with minimum flow constraints |
| minFlow | |
| grafalgo::Nca | Class that computes nearest common ancestors in a tree |
| LongestMatchPrefix::nodeItem | |
| grafalgo::OutOfSpaceException | This exception is thrown by constructors (and other methods) that are unable to allocate space for the data structure because there is no memory left to allocate |
| grafalgo::Partition | Maintain a partition on positive integers 1..n |
| grafalgo::PathSet::PathCostPair | |
| grafalgo::PathSet::PathNode | |
| grafalgo::Dtrees::PathNodePair | |
| grafalgo::PathSet::PathPair | |
| grafalgo::PathSet | Data structure that represents a collection of paths |
| grafalgo::Partition::pnode | |
| ppFifo | PrePush class encapsulates data and methods used by the FIFO variant of the preflow-push method for computing maximum flows |
| ppHiLab | PpHiLab class encapsulates data and methods used by the highest label-first variant of the preflow-push method for finding maximum flows |
| prePush | PrePush class ecapsulates data and methods used by the preflow-push algorithms for maximum flow |
| grafalgo::RlistSet | Class representing a collection of reversible lists |
| grafalgo::SaBstSet | Class representing a collection of self-adjusting binary search trees |
| grafalgo::SaTreeMap | Maintains set of (key, value) pairs where key is a 64 bit value and value is a positive 32 bit integer |
| scale | |
| grafalgo::SetPair | Data structure that represents a pair of integer sets |
| shortPath | |
| grafalgo::StairFunc | This class implements a "staircase function" |
| grafalgo::TreeMap | Maintains set of (key, value) pairs where key is a 64 bit value and value is a positive 32 bit integer |
| Utest | Class to facilitate unit testing of other classes |
| grafalgo::Util | This class contains miscellaneous utility methods |
| grafalgo::Nca::VertexPair | |
| grafalgo::Wdigraph | Data structure for directed graph with edge lengths |
| grafalgo::Wflograph | Class representing a weighted flow graph |
| grafalgo::Wgraph | Data structure for undirected graph with edge weights |
1.7.4 
