The MCFClass Project
|
Definition of SPTree, a class deriving from MCFClass, and therefore conforming to the standard MCF interface defined therein, and implementing 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... | |
Namespaces | |
namespace | MCFClass_di_unipi_it |
The namespace MCFClass_di_unipi_it is defined to hold the MCFClass class and all the relative stuff. | |
Macros | |
#define | LABEL_SETTING 1 |
This macro decides which SPT algorithm has to be used. | |
#define | HeapCard 2 |
Number of sons of each node in the heap. | |
#define | ORDRD_NMS 1 |
Decides if arc names in MCFGetX() are ordered. | |
#define | DYNMC_MCF_SPT 0 |
Decides if the graph topology (arcs, nodes) can be changed. | |
Definition of SPTree, a class deriving from MCFClass, and therefore conforming to the standard MCF interface defined therein, and implementing 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.