#include <lemon/suurballe.h>
Graph | The directed graph type the algorithm runs on. | |
LengthMap | The type of the length map (values should be nonnegative). |
Public Member Functions | |
Suurballe (Graph &_G, LengthMap &_length, Node _s, Node _t) | |
The constructor of the class. | |
int | run (int k) |
Runs the algorithm. | |
Length | totalLength () |
This function gives back the total length of the found paths. | |
const EdgeIntMap & | getFlow () const |
This function returns a const reference to the EdgeMap 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 edge-disjoint paths found from s to t.
|
|
This function returns a const reference to the NodeMap |
|
This function checks, whether the given solution is optimal. Currently this function only checks optimality, doesn't bother with feasibility. It is meant for testing purposes. |
|
This function gives back the
|