|
| AlternatingTree.h |
| Implementation of an Alternating Tree helper structure for the Blossom algorithm.
|
|
| AuxGraph.h |
| Implementation of the auxiliary graph as well as the edges and nodes of it for the Blossom V algorithm.
|
|
| BlossomHelper.h |
| Utility class for the Blossom algorithm, providiing access to all important data structures.
|
|
| BlossomVHelper.h |
| Utility class for the Blossom V algorithm.
|
|
| Cycle.h |
| Utility class representing a cycle in the Blossom algorithm.
|
|
| PQ.h |
| An extension of the standard priority queue with additional features.
|
|
| Pseudonode.h |
| Helper structure representing a pseudonode in the Blossom algorithm.
|
|
| utils.h |
| Utility functions and classes regarding map access and iteration.
|
|