Grafalgo
Library of useful data structures and algorithms
|
This class encapsulates data and routines used by the augmenting path algorithms for max flow. More...
#include <augPath.h>
Public Member Functions | |
augPath (Flograph &, int &) | |
Find maximum flow in a flow graph. | |
Protected Member Functions | |
int | augment () |
virtual bool | findPath ()=0 |
find augmenting path | |
Protected Attributes | |
Flograph * | fg |
graph we're finding flow on | |
edge * | pEdge |
pEdge[u] is edge to parent of u in spt |
This class encapsulates data and routines used by the augmenting path algorithms for max flow.
This serves as a base class for specific variants of the augmenting path algorithm.
augPath::augPath | ( | Flograph & | fg1, |
int & | flow_value | ||
) |
Find maximum flow in a flow graph.
Base class constructor initializes dynamic data common to all algorithms. Constructors for derived classes actually implement specific algorithms.
Definition at line 18 of file augPath.cpp.