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

Geometric data structures implemented in LEMON.

Matrices

Two dimensional data storages implemented in LEMON.

Classes

Class

Description

Elevator

Class for handling “labels” in push-relabel type algorithms.

LinkedElevator

Class for handling “labels” in push-relabel type algorithms.

UnionFind

A Union-Find data structure implementation.

UnionFindEnum

A Union-Find data structure implementation which is able to enumerate the components.

ExtendFindEnum

A Extend-Find data structure implementation which is able to enumerate the components.

HeapUnionFind

A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class.