This group contains some data structures implemented in LEMON in order to make it easier to implement combinatorial algorithms.
Classes | |
| class | BinHeap< PR, IM, CMP > |
| A Binary Heap implementation. More... | |
| class | BucketHeap< IM, MIN > |
| A Bucket Heap implementation. More... | |
| class | SimpleBucketHeap< IM, MIN > |
| A Simplified Bucket Heap implementation. More... | |
| class | Elevator< GR, Item > |
| Class for handling "labels" in push-relabel type algorithms. More... | |
| class | LinkedElevator< GR, Item > |
| Class for handling "labels" in push-relabel type algorithms. More... | |
| class | FibHeap< PRIO, IM, CMP > |
| Fibonacci Heap. More... | |
| class | UnionFind< IM > |
| A Union-Find data structure implementation. More... | |
| class | UnionFindEnum< IM > |
| A Union-Find data structure implementation which is able to enumerate the components. More... | |
| class | ExtendFindEnum< IM > |
| A Extend-Find data structure implementation which is able to enumerate the components. More... | |
| class | HeapUnionFind< V, IM, Comp > |
| A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class. More... | |
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. | |
1.7.3
