/Users/jst/src/grafalgo/cpp/include/lcap.h

// lcapc class encapsulates data and routines used by least cost aug path
// algorithm for min cost flow. Use constructor to invoke algorithm.

#ifndef LCAP_H
#define LCAP_H

#include "stdinc.h"
#include "Wflograph.h"
#include "List.h"
#include "Dheap.h"

using namespace grafalgo;

class lcap {
public:
        lcap(Wflograph&, flow&, floCost&, bool);
protected:
        Wflograph* wfg;         // graph we're finding flow on
        int*    lab;            // lab[u] is label used to transform costs
        edge*   pEdge;          // pEdge[u] is edge to parent of u in spt

        void pathRcapCost(flow&,floCost&); // return path res cap and cost
        void augment(flow&);            // add flow to augmenting path
        void initLabels();      // initialize labels for transformed costs
        bool findpath();        // find a least cost augmenting path
};

#endif