#include <suurballe.h>
Collaboration diagram for Suurballe:
Graph | The directed graph type the algorithm runs on. | |
LengthMap | The type of the length map (values should be nonnegative). |
Definition at line 58 of file suurballe.h.
Public Member Functions | |
Suurballe (Graph &_G, LengthMap &_length) | |
The constructor of the class. | |
int | run (Node s, Node t, int k) |
Runs the algorithm. | |
Length | totalLength () |
Returns the total length of the paths. | |
const EdgeIntMap & | getFlow () const |
Returns the found flow. | |
const EdgeIntMap & | getPotential () const |
Returns the optimal dual solution. | |
bool | checkComplementarySlackness () |
Checks whether the complementary slackness holds. | |
template<typename Path> void | getPath (Path &p, size_t j) |
Read the found paths. |
|
|
|
Runs the algorithm. Returns k if there are at least k edge-disjoint paths from s to t. Otherwise it returns the number of found edge-disjoint paths from s to t.
References MinCostFlow::getFlow(), lemon::INVALID, and MinCostFlow::run(). Here is the call graph for this function: ![]() |
|
This function gives back the total length of the found paths.
References MinCostFlow::totalLength(). Here is the call graph for this function: ![]() |
|
This function returns a const reference to the EdgeMap
References MinCostFlow::flow. |
|
This function returns a const reference to the NodeMap
References MinCostFlow::potential. |
|
This function checks, whether the given solution is optimal. It should return true after calling run() Currently this function only checks optimality, doesn't bother with feasibility It is meant for testing purposes. Definition at line 177 of file suurballe.h. References MinCostFlow::checkComplementarySlackness(). Here is the call graph for this function: ![]() |
|
This function gives back the
|