This group contains some data structures implemented in LEMON in order to make it easier to implement combinatorial algorithms.
Classes | |
| 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 | 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... | |
Modules | |
| Geometric Data Structures | |
Geometric data structures implemented in LEMON. | |
Files | |
| file | elevator.h |
Elevator class. | |
| file | unionfind.h |
Union-Find data structures. | |
1.7.3
