Grafalgo
Library of useful data structures and algorithms
|
PrePush class ecapsulates data and methods used by the preflow-push algorithms for maximum flow. More...
#include <prePush.h>
Public Member Functions | |
prePush (Flograph &, int &) | |
Protected Member Functions | |
bool | balance (vertex) |
void | initdist () |
int | minlabel (vertex) |
virtual void | newUnbal (vertex) |
int | flowValue () |
Protected Attributes | |
Flograph * | fg |
graph we're finding flow on | |
int * | d |
vector of distance labels | |
int * | excess |
excess flow entering vertex | |
edge * | nextedge |
pointer into adjacency list | |
int | satCount |
# of steps that saturate an edge | |
int | nonSatCount |
# that add flow but don't saturate edge | |
int | newDistCount |
# times new dist labels computed (batch) | |
int | relabCount |
# of node relabeling steps |
PrePush class ecapsulates data and methods used by the preflow-push algorithms for maximum flow.
Subclasses are defined for each specific algorithm. The base class defines elements common to all the subclasses.