LEMON 1.0.7
|
This group describes some data structures implemented in LEMON in order to make it easier to implement combinatorial algorithms.
Classes | |
class | BinHeap< _Prio, _ItemIntMap, _Compare > |
A Binary Heap implementation. More... | |
class | UnionFind< _ItemIntMap > |
A Union-Find data structure implementation. More... | |
class | UnionFindEnum< _ItemIntMap > |
A Union-Find data structure implementation which is able to enumerate the components. More... | |
class | ExtendFindEnum< _ItemIntMap > |
A Extend-Find data structure implementation which is able to enumerate the components. More... | |
class | HeapUnionFind< _Value, _ItemIntMap, _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 | unionfind.h |
Union-Find data structures. |