Auxiliary Data Structures
The same group on the Doxygen site.
- group Auxiliary Data Structures
Auxiliary data structures implemented in LEMON.
This group contains some data structures implemented in LEMON in order to make it easier to implement combinatorial algorithms.
Subgroups
Group |
Description |
|---|---|
Geometric data structures implemented in LEMON. |
|
Two dimensional data storages implemented in LEMON. |
Classes
Class |
Description |
|---|---|
Class for handling “labels” in push-relabel type algorithms. |
|
Class for handling “labels” in push-relabel type algorithms. |
|
A Union-Find data structure implementation. |
|
A Union-Find data structure implementation which is able to enumerate the components. |
|
A Extend-Find data structure implementation which is able to enumerate the components. |
|
A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class. |