Auxiliary Data Structures
[Data Structures]


Detailed Description

This group describes some 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  elevator.h
 Elevator class.
file  fib_heap.h
 Fibonacci Heap implementation.
file  radix_heap.h
 Radix Heap implementation.
file  unionfind.h
 Union-Find data structures.

Classes

class  BinHeap
 A Binary Heap implementation. More...
class  BucketHeap
 A Bucket Heap implementation. More...
class  SimpleBucketHeap
 A Simplified Bucket Heap implementation. More...
class  Elevator
 Class for handling "labels" in push-relabel type algorithms. More...
class  LinkedElevator
 Class for handling "labels" in push-relabel type algorithms. 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...
class  ExtendFindEnum
 A Extend-Find data structure implementation which is able to enumerate the components. More...
class  HeapUnionFind
 A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class. More...


Generated on Sat Apr 19 14:16:56 2008 for LEMON by  doxygen 1.5.5