Auxiliary Data Structures
[Data Structures]


Detailed Description

This group describes the data structures implemented in LEMON in order to make it easier to implement combinatorial algorithms.


Files

file  bin_heap.h
 Binary Heap implementation.
file  bucket_heap.h
 Bucket Heap implementation.
file  fib_heap.h
 Fibonacci Heap implementation.
file  radix_heap.h
 Radix Heap implementation.
file  unionfind.h
 Union-Find data structures.

Modules

 Tools to Make It Easier to Make Graphs
 Tools to Make It Easier to Make Graphs.

Classes

class  BinHeap
 A Binary Heap implementation. More...
class  BucketHeap
 A Bucket Heap implementation. More...
class  SimpleBucketHeap
 A Simplified Bucket Heap implementation. More...
class  FibHeap
 Fibonacci Heap. More...
class  UnionFind
 A Union-Find data structure implementation. More...
class  UnionFindEnum
 A Union-Find data structure implementation which is able to enumerate the components. More...


Generated on Tue Oct 31 09:49:38 2006 for LEMON by  doxygen 1.5.1