CNDSM
1.00
|
Implementation of several "classic" Shortest Path Tree algorithms to solve uncapacitated single-source Min Cost Flow problems. More...
#include "MCFClass.h"
Classes | |
class | SPTree |
The SPTree class derives from the abstract base class MCFClass, thus sharing its (standard) interface, and implements Shortest Path Tree algorithms for solving "uncapacitated" (Linear) Min Cost Flow problems with one source node. More... | |
Macros | |
#define | SPT_ALGRTM 0 |
This macro decides which SPT algorithm has to be used. More... | |
#define | LABEL_SETTING 0 |
this is a label-correcting SPT algorithm | |
#define | ORDRD_NMS 1 |
Decides if arc names in MCFGetX() are ordered. More... | |
#define | SAME_GRPH_SPT 0 |
Decides if all MCFClass instances share the same graph. More... | |
#define | DYNMC_MCF_SPT 0 |
Decides if the graph topology (arcs, nodes) can be changed. More... | |
Implementation of several "classic" Shortest Path Tree algorithms to solve uncapacitated single-source Min Cost Flow problems.
The actual algorithm can be chosen at compile time by setting a proper switch. Conforms to the standard MCF interface defined in MCFClass.h.