maxflow_ff.h

Go to the documentation of this file. Or view the newest version in sPHENIX GitHub for file maxflow_ff.h

/* This software is distributed under the GNU Lesser General Public License */
//==========================================================================
//
//   maxflow_ff.h
//
//==========================================================================
// $Id: maxflow_ff.h,v 1.5 2003/01/31 08:15:05 chris Exp $

#ifndef GTL_MAXFLOW_FF_H
#define GTL_MAXFLOW_FF_H

#include <GTL/GTL.h>
#include <GTL/graph.h>
#include <GTL/node_map.h>
#include <GTL/edge_map.h>
#include <GTL/algorithm.h>

#include <queue>

__GTL_BEGIN_NAMESPACE

class GTL_EXTERN maxflow_ff : public algorithm
{
public:
    maxflow_ff();

    virtual ~maxflow_ff();

    void set_vars(const edge_map<double>& edge_capacity);

    void set_vars(
        const edge_map<double>& edge_capacity, 
        const node& net_source, 
        const node& net_target);

    virtual int check(graph& G);
            
    int run(graph& G);
                
    double get_max_flow(const edge& e) const;

    double get_max_flow() const;
        
    double get_rem_cap(const edge& e) const;

    virtual void reset();
protected:
    enum {SP_FOUND = 2, NO_SP_FOUND = 3};

    bool artif_source_target;

    bool set_vars_executed;

    double max_graph_flow;

    node net_source;

    node net_target;

    list<edge> edges_not_org;

    edge_map<bool> edge_org;

    edge_map<bool> back_edge_exists;

    edge_map<edge> back_edge;

    edge_map<double> edge_capacity;

    edge_map<double> edge_max_flow;

    void create_artif_source_target(graph& G);

    void prepare_run(const graph& G);

    void comp_single_flow(graph& G, node_map<edge>& last_edge);

    int get_sp(const graph& G, node_map<edge>& last_edge);

    int comp_sp(
        const graph& G, 
        queue<node>& next_nodes, 
        node_map<bool>& visited, 
        node_map<edge>& last_edge);

    double extra_charge(const node_map<edge>& last_edge) const;

    void create_back_edge(graph& G, const edge& org_edge);

    void comp_max_flow(const graph& G);

    void restore_graph(graph& G);
};

__GTL_END_NAMESPACE

#endif // GTL_MAXFLOW_FF_H

//--------------------------------------------------------------------------
//   end of file
//--------------------------------------------------------------------------