Detailed Description
This group describes some data structures implemented in LEMON in order to make it easier to implement combinatorial algorithms.
|
Classes |
class | BinHeap |
| A Binary Heap implementation. 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...
|
Files |
file | bin_heap.h |
| Binary Heap implementation.
|
file | unionfind.h |
| Union-Find data structures.
|