#include "cycle_cancelling.h"
Public Member Functions | |
CycleCancelling (AdjacencyMapGraph *graph, Statistics *stats) | |
void | PrepareState () |
bool | Run () |
Public Member Functions inherited from flowlessly::Solver | |
Solver (Statistics *stats) | |
void | LogStatistics () |
void | ResetStatistics () |
void | SetLatch (boost::latch *latch) |
Additional Inherited Members | |
Protected Attributes inherited from flowlessly::Solver | |
Statistics * | stats_ |
boost::latch * | latch_ |
Implements the cycle cancelling min cost maximum flow algorithm.
|
virtual |
Applies the Cycle cancelling algorithm to compute the min cost flow. The complexity is O(F * M + N * M^2 * C * U).
Implements flowlessly::Solver.