![]() |
abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
|
Skeleton classes and concept checking classes. More...
Topics | |
| Graph Structure Concepts | |
| Skeleton and concept checking classes for graph structures. | |
| Map Concepts | |
| Skeleton and concept checking classes for maps. | |
Files | |
| file | heap.h |
| file | max_flow.h |
| file | min_cost_flow.h |
| file | min_mean_cycle.h |
| file | path.h |
Classes | |
| class | Heap< PR , IM , CMP > |
| The heap concept. More... | |
| struct | MaxFlow< GR , CAP > |
| Checks the general interface of a max flow algorithm. More... | |
| class | MinCostFlow< GR , Value , Cost > |
| Check the interface of an MCF algorithm. More... | |
| struct | MinMeanCycle< GR , Cost > |
| Check the interface of an MMC algorithm. More... | |
| class | Path< GR > |
| A skeleton structure for representing directed paths in a digraph. More... | |
| class | PathDumper< GR > |
| A skeleton structure for path dumpers. More... | |
This group contains the data/algorithm skeletons and concept checking classes implemented in LEMON.
The purpose of the classes in this group is fourfold.