marci@174: // -*- c++ -*-
marci@174: #ifndef EDMONDS_KARP_H
marci@174: #define EDMONDS_KARP_H
marci@174: 
marci@174: #include <algorithm>
marci@174: #include <list>
marci@174: #include <iterator>
marci@174: 
marci@174: #include <bfs_iterator.h>
marci@174: #include <invalid.h>
marci@174: 
marci@174: namespace hugo {
marci@174: 
marci@174:   template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@174:   class ResGraph {
marci@174:   public:
marci@174:     typedef typename Graph::Node Node;
marci@174:     typedef typename Graph::NodeIt NodeIt;
marci@174:   private:
marci@174:     typedef typename Graph::SymEdgeIt OldSymEdgeIt;
marci@174:     const Graph& G;
marci@174:     FlowMap& flow;
marci@174:     const CapacityMap& capacity;
marci@174:   public:
marci@174:     ResGraph(const Graph& _G, FlowMap& _flow, 
marci@174: 	     const CapacityMap& _capacity) : 
marci@174:       G(_G), flow(_flow), capacity(_capacity) { }
marci@174: 
marci@174:     class Edge; 
marci@174:     class OutEdgeIt; 
marci@174:     friend class Edge; 
marci@174:     friend class OutEdgeIt; 
marci@174: 
marci@174:     class Edge {
marci@174:       friend class ResGraph<Graph, Number, FlowMap, CapacityMap>;
marci@174:     protected:
marci@174:       const ResGraph<Graph, Number, FlowMap, CapacityMap>* resG;
marci@174:       OldSymEdgeIt sym;
marci@174:     public:
marci@174:       Edge() { } 
marci@174:       //Edge(const Edge& e) : resG(e.resG), sym(e.sym) { }
marci@174:       Number free() const { 
marci@174: 	if (resG->G.aNode(sym)==resG->G.tail(sym)) { 
marci@174: 	  return (resG->capacity.get(sym)-resG->flow.get(sym)); 
marci@174: 	} else { 
marci@174: 	  return (resG->flow.get(sym)); 
marci@174: 	}
marci@174:       }
marci@174:       bool valid() const { return sym.valid(); }
marci@174:       void augment(Number a) const {
marci@174: 	if (resG->G.aNode(sym)==resG->G.tail(sym)) { 
marci@174: 	  resG->flow.set(sym, resG->flow.get(sym)+a);
marci@174: 	  //resG->flow[sym]+=a;
marci@174: 	} else { 
marci@174: 	  resG->flow.set(sym, resG->flow.get(sym)-a);
marci@174: 	  //resG->flow[sym]-=a;
marci@174: 	}
marci@174:       }
marci@174:     };
marci@174: 
marci@174:     class OutEdgeIt : public Edge {
marci@174:       friend class ResGraph<Graph, Number, FlowMap, CapacityMap>;
marci@174:     public:
marci@174:       OutEdgeIt() { }
marci@174:       //OutEdgeIt(const OutEdgeIt& e) { resG=e.resG; sym=e.sym; }
marci@174:     private:
marci@174:       OutEdgeIt(const ResGraph<Graph, Number, FlowMap, CapacityMap>& _resG, Node v) { 
marci@174:       	resG=&_resG;
marci@174: 	sym=resG->G.template first<OldSymEdgeIt>(v);
marci@174: 	while( sym.valid() && !(free()>0) ) { ++sym; }
marci@174:       }
marci@174:     public:
marci@174:       OutEdgeIt& operator++() { 
marci@174: 	++sym; 
marci@174: 	while( sym.valid() && !(free()>0) ) { ++sym; }
marci@174: 	return *this; 
marci@174:       }
marci@174:     };
marci@174: 
marci@174:     void /*getF*/first(OutEdgeIt& e, Node v) const { 
marci@174:       e=OutEdgeIt(*this, v); 
marci@174:     }
marci@174:     void /*getF*/first(NodeIt& v) const { G./*getF*/first(v); }
marci@174:     
marci@174:     template< typename It >
marci@174:     It first() const { 
marci@174:       It e;      
marci@174:       /*getF*/first(e);
marci@174:       return e; 
marci@174:     }
marci@174: 
marci@174:     template< typename It >
marci@174:     It first(Node v) const { 
marci@174:       It e;
marci@174:       /*getF*/first(e, v);
marci@174:       return e; 
marci@174:     }
marci@174: 
marci@174:     Node tail(Edge e) const { return G.aNode(e.sym); }
marci@174:     Node head(Edge e) const { return G.bNode(e.sym); }
marci@174: 
marci@174:     Node aNode(OutEdgeIt e) const { return G.aNode(e.sym); }
marci@174:     Node bNode(OutEdgeIt e) const { return G.bNode(e.sym); }
marci@174: 
marci@174:     int id(Node v) const { return G.id(v); }
marci@174: 
marci@174:     template <typename S>
marci@174:     class NodeMap {
marci@174:       typename Graph::NodeMap<S> node_map; 
marci@174:     public:
marci@174:       NodeMap(const ResGraph<Graph, Number, FlowMap, CapacityMap>& _G) : node_map(_G.G) { }
marci@174:       NodeMap(const ResGraph<Graph, Number, FlowMap, CapacityMap>& _G, S a) : node_map(_G.G, a) { }
marci@174:       void set(Node nit, S a) { node_map.set(nit, a); }
marci@174:       S get(Node nit) const { return node_map.get(nit); }
marci@174:       S& operator[](Node nit) { return node_map[nit]; } 
marci@174:       const S& operator[](Node nit) const { return node_map[nit]; } 
marci@174:     };
marci@174: 
marci@174:   };
marci@174: 
marci@174: 
marci@174:   template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@174:   class ResGraph2 {
marci@174:   public:
marci@174:     typedef typename Graph::Node Node;
marci@174:     typedef typename Graph::NodeIt NodeIt;
marci@174:   private:
marci@174:     //typedef typename Graph::SymEdgeIt OldSymEdgeIt;
marci@174:     typedef typename Graph::OutEdgeIt OldOutEdgeIt;
marci@174:     typedef typename Graph::InEdgeIt OldInEdgeIt;
marci@174:     
marci@174:     const Graph& G;
marci@174:     FlowMap& flow;
marci@174:     const CapacityMap& capacity;
marci@174:   public:
marci@174:     ResGraph2(const Graph& _G, FlowMap& _flow, 
marci@174: 	     const CapacityMap& _capacity) : 
marci@174:       G(_G), flow(_flow), capacity(_capacity) { }
marci@174: 
marci@174:     class Edge; 
marci@174:     class OutEdgeIt; 
marci@174:     friend class Edge; 
marci@174:     friend class OutEdgeIt; 
marci@174: 
marci@174:     class Edge {
marci@174:       friend class ResGraph2<Graph, Number, FlowMap, CapacityMap>;
marci@174:     protected:
marci@174:       const ResGraph2<Graph, Number, FlowMap, CapacityMap>* resG;
marci@174:       //OldSymEdgeIt sym;
marci@174:       OldOutEdgeIt out;
marci@174:       OldInEdgeIt in;
marci@174:       bool out_or_in; //true, iff out
marci@174:     public:
marci@174:       Edge() : out_or_in(true) { } 
marci@174:       Number free() const { 
marci@174: 	if (out_or_in) { 
marci@174: 	  return (resG->capacity.get(out)-resG->flow.get(out)); 
marci@174: 	} else { 
marci@174: 	  return (resG->flow.get(in)); 
marci@174: 	}
marci@174:       }
marci@174:       bool valid() const { 
marci@174: 	return out_or_in && out.valid() || in.valid(); }
marci@174:       void augment(Number a) const {
marci@174: 	if (out_or_in) { 
marci@174: 	  resG->flow.set(out, resG->flow.get(out)+a);
marci@174: 	} else { 
marci@174: 	  resG->flow.set(in, resG->flow.get(in)-a);
marci@174: 	}
marci@174:       }
marci@174:     };
marci@174: 
marci@174:     class OutEdgeIt : public Edge {
marci@174:       friend class ResGraph2<Graph, Number, FlowMap, CapacityMap>;
marci@174:     public:
marci@174:       OutEdgeIt() { }
marci@174:     private:
marci@174:       OutEdgeIt(const ResGraph2<Graph, Number, FlowMap, CapacityMap>& _resG, Node v) { 
marci@174:       	resG=&_resG;
marci@174: 	out=resG->G.template first<OldOutEdgeIt>(v);
marci@174: 	while( out.valid() && !(free()>0) ) { ++out; }
marci@174: 	if (!out.valid()) {
marci@174: 	  out_or_in=0;
marci@174: 	  in=resG->G.template first<OldInEdgeIt>(v);
marci@174: 	  while( in.valid() && !(free()>0) ) { ++in; }
marci@174: 	}
marci@174:       }
marci@174:     public:
marci@174:       OutEdgeIt& operator++() { 
marci@174: 	if (out_or_in) {
marci@174: 	  Node v=resG->G.aNode(out);
marci@174: 	  ++out;
marci@174: 	  while( out.valid() && !(free()>0) ) { ++out; }
marci@174: 	  if (!out.valid()) {
marci@174: 	    out_or_in=0;
marci@174: 	    in=resG->G.template first<OldInEdgeIt>(v);
marci@174: 	    while( in.valid() && !(free()>0) ) { ++in; }
marci@174: 	  }
marci@174: 	} else {
marci@174: 	  ++in;
marci@174: 	  while( in.valid() && !(free()>0) ) { ++in; } 
marci@174: 	}
marci@174: 	return *this; 
marci@174:       }
marci@174:     };
marci@174: 
marci@174:     void /*getF*/first(OutEdgeIt& e, Node v) const { 
marci@174:       e=OutEdgeIt(*this, v); 
marci@174:     }
marci@174:     void /*getF*/first(NodeIt& v) const { G./*getF*/first(v); }
marci@174:     
marci@174:     template< typename It >
marci@174:     It first() const { 
marci@174:       It e;
marci@174:       /*getF*/first(e);
marci@174:       return e; 
marci@174:     }
marci@174: 
marci@174:     template< typename It >
marci@174:     It first(Node v) const { 
marci@174:       It e;
marci@174:       /*getF*/first(e, v);
marci@174:       return e; 
marci@174:     }
marci@174: 
marci@174:     Node tail(Edge e) const { 
marci@174:       return ((e.out_or_in) ? G.aNode(e.out) : G.aNode(e.in)); }
marci@174:     Node head(Edge e) const { 
marci@174:       return ((e.out_or_in) ? G.bNode(e.out) : G.bNode(e.in)); }
marci@174: 
marci@174:     Node aNode(OutEdgeIt e) const { 
marci@174:       return ((e.out_or_in) ? G.aNode(e.out) : G.aNode(e.in)); }
marci@174:     Node bNode(OutEdgeIt e) const { 
marci@174:       return ((e.out_or_in) ? G.bNode(e.out) : G.bNode(e.in)); }
marci@174: 
marci@174:     int id(Node v) const { return G.id(v); }
marci@174: 
marci@174:     template <typename S>
marci@174:     class NodeMap {
marci@174:       typename Graph::NodeMap<S> node_map; 
marci@174:     public:
marci@174:       NodeMap(const ResGraph2<Graph, Number, FlowMap, CapacityMap>& _G) : node_map(_G.G) { }
marci@174:       NodeMap(const ResGraph2<Graph, Number, FlowMap, CapacityMap>& _G, S a) : node_map(_G.G, a) { }
marci@174:       void set(Node nit, S a) { node_map.set(nit, a); }
marci@174:       S get(Node nit) const { return node_map.get(nit); }
marci@174:     };
marci@174:   };
marci@174: 
marci@174: 
marci@174:   template <typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@174:   class MaxFlow {
marci@174:   public:
marci@174:     typedef typename Graph::Node Node;
marci@174:     typedef typename Graph::Edge Edge;
marci@174:     typedef typename Graph::EdgeIt EdgeIt;
marci@174:     typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@174:     typedef typename Graph::InEdgeIt InEdgeIt;
marci@174: 
marci@174:   private:
marci@174:     const Graph* G;
marci@174:     Node s;
marci@174:     Node t;
marci@174:     FlowMap* flow;
marci@174:     const CapacityMap* capacity;
marci@174:     typedef ResGraphWrapper<Graph, Number, FlowMap, CapacityMap > AugGraph;
marci@174:     typedef typename AugGraph::OutEdgeIt AugOutEdgeIt;
marci@174:     typedef typename AugGraph::Edge AugEdge;
marci@174: 
marci@174:   public:
marci@174:     MaxFlow(const Graph& _G, Node _s, Node _t, FlowMap& _flow, const CapacityMap& _capacity) : 
marci@191:       G(&_G), s(_s), t(_t), flow(&_flow), capacity(&_capacity) { }
marci@174:     bool augmentOnShortestPath() {
marci@174:       AugGraph res_graph(*G, *flow, *capacity);
marci@174:       bool _augment=false;
marci@174:       
marci@174:       typedef typename AugGraph::NodeMap<bool> ReachedMap;
marci@174:       BfsIterator5< AugGraph, /*AugOutEdgeIt,*/ ReachedMap > res_bfs(res_graph);
marci@174:       res_bfs.pushAndSetReached(s);
marci@174: 	
marci@174:       typename AugGraph::NodeMap<AugEdge> pred(res_graph); 
marci@174:       pred.set(s, AugEdge(INVALID));
marci@174:       
marci@174:       typename AugGraph::NodeMap<Number> free(res_graph);
marci@174: 	
marci@174:       //searching for augmenting path
marci@174:       while ( !res_bfs.finished() ) { 
marci@191: 	AugOutEdgeIt e=res_bfs;
marci@174: 	if (res_graph.valid(e) && res_bfs.isBNodeNewlyReached()) {
marci@174: 	  Node v=res_graph.tail(e);
marci@174: 	  Node w=res_graph.head(e);
marci@174: 	  pred.set(w, e);
marci@174: 	  if (res_graph.valid(pred.get(v))) {
marci@174: 	    free.set(w, std::min(free.get(v), res_graph.free(e)));
marci@174: 	  } else {
marci@174: 	    free.set(w, res_graph.free(e)); 
marci@174: 	  }
marci@174: 	  if (res_graph.head(e)==t) { _augment=true; break; }
marci@174: 	}
marci@174: 	
marci@174: 	++res_bfs;
marci@174:       } //end of searching augmenting path
marci@174: 
marci@174:       if (_augment) {
marci@174: 	Node n=t;
marci@174: 	Number augment_value=free.get(t);
marci@174: 	while (res_graph.valid(pred.get(n))) { 
marci@174: 	  AugEdge e=pred.get(n);
marci@174: 	  res_graph.augment(e, augment_value); 
marci@174: 	  n=res_graph.tail(e);
marci@174: 	}
marci@174:       }
marci@174: 
marci@174:       return _augment;
marci@174:     }
marci@174: 
marci@191:     template<typename MutableGraph> bool augmentOnBlockingFlow() {      
marci@174:       bool _augment=false;
marci@174: 
marci@174:       AugGraph res_graph(*G, *flow, *capacity);
marci@174: 
marci@174:       typedef typename AugGraph::NodeMap<bool> ReachedMap;
marci@174:       BfsIterator4< AugGraph, AugOutEdgeIt, ReachedMap > bfs(res_graph);
marci@174: 
marci@174:       bfs.pushAndSetReached(s);
marci@174:       typename AugGraph::NodeMap<int> dist(res_graph); //filled up with 0's
marci@174:       while ( !bfs.finished() ) { 
marci@191: 	AugOutEdgeIt e=bfs;
marci@174: 	if (res_graph.valid(e) && bfs.isBNodeNewlyReached()) {
marci@174: 	  dist.set(res_graph.head(e), dist.get(res_graph.tail(e))+1);
marci@174: 	}
marci@174: 	
marci@174: 	++bfs;
marci@174:       } //computing distances from s in the residual graph
marci@174: 
marci@174:       MutableGraph F;
marci@174:       typename AugGraph::NodeMap<typename MutableGraph::Node> 
marci@174: 	res_graph_to_F(res_graph);
marci@174:       for(typename AugGraph::NodeIt n=res_graph.template first<typename AugGraph::NodeIt>(); res_graph.valid(n); res_graph.next(n)) {
marci@174: 	res_graph_to_F.set(n, F.addNode());
marci@174:       }
marci@174:       
marci@174:       typename MutableGraph::Node sF=res_graph_to_F.get(s);
marci@174:       typename MutableGraph::Node tF=res_graph_to_F.get(t);
marci@174: 
marci@174:       typename MutableGraph::EdgeMap<AugEdge> original_edge(F);
marci@174:       typename MutableGraph::EdgeMap<Number> residual_capacity(F);
marci@174: 
marci@174:       //Making F to the graph containing the edges of the residual graph 
marci@174:       //which are in some shortest paths
marci@174:       for(typename AugGraph::EdgeIt e=res_graph.template first<typename AugGraph::EdgeIt>(); res_graph.valid(e); res_graph.next(e)) {
marci@174: 	if (dist.get(res_graph.head(e))==dist.get(res_graph.tail(e))+1) {
marci@174: 	  typename MutableGraph::Edge f=F.addEdge(res_graph_to_F.get(res_graph.tail(e)), res_graph_to_F.get(res_graph.head(e)));
marci@174: 	  original_edge.update();
marci@174: 	  original_edge.set(f, e);
marci@174: 	  residual_capacity.update();
marci@174: 	  residual_capacity.set(f, res_graph.free(e));
marci@174: 	} 
marci@174:       }
marci@174: 
marci@174:       bool __augment=true;
marci@174: 
marci@174:       while (__augment) {
marci@174: 	__augment=false;
marci@174: 	//computing blocking flow with dfs
marci@174: 	typedef typename MutableGraph::NodeMap<bool> BlockingReachedMap;
marci@174: 	DfsIterator4< MutableGraph, typename MutableGraph::OutEdgeIt, BlockingReachedMap > dfs(F);
marci@174: 	typename MutableGraph::NodeMap<typename MutableGraph::Edge> pred(F);
marci@174: 	pred.set(sF, typename MutableGraph::Edge(INVALID));
marci@174: 	//invalid iterators for sources
marci@174: 
marci@174: 	typename MutableGraph::NodeMap<Number> free(F);
marci@174: 
marci@174: 	dfs.pushAndSetReached(sF);      
marci@174: 	while (!dfs.finished()) {
marci@174: 	  ++dfs;
marci@174: 	  if (F.valid(typename MutableGraph::OutEdgeIt(dfs))) {
marci@174: 	    if (dfs.isBNodeNewlyReached()) {
marci@174: 	      typename MutableGraph::Node v=F.aNode(dfs);
marci@174: 	      typename MutableGraph::Node w=F.bNode(dfs);
marci@174: 	      pred.set(w, dfs);
marci@174: 	      if (F.valid(pred.get(v))) {
marci@174: 		free.set(w, std::min(free.get(v), residual_capacity.get(dfs)));
marci@174: 	      } else {
marci@174: 		free.set(w, residual_capacity.get(dfs)); 
marci@174: 	      }
marci@174: 	      if (w==tF) { 
marci@174: 		__augment=true; 
marci@174: 		_augment=true;
marci@174: 		break; 
marci@174: 	      }
marci@174: 	      
marci@174: 	    } else {
marci@174: 	      F.erase(typename MutableGraph::OutEdgeIt(dfs));
marci@174: 	    }
marci@174: 	  } 
marci@174: 	}
marci@174: 
marci@174: 	if (__augment) {
marci@174: 	  typename MutableGraph::Node n=tF;
marci@174: 	  Number augment_value=free.get(tF);
marci@174: 	  while (F.valid(pred.get(n))) { 
marci@174: 	    typename MutableGraph::Edge e=pred.get(n);
marci@174: 	    res_graph.augment(original_edge.get(e), augment_value); 
marci@174: 	    n=F.tail(e);
marci@174: 	    if (residual_capacity.get(e)==augment_value) 
marci@174: 	      F.erase(e); 
marci@174: 	    else 
marci@174: 	      residual_capacity.set(e, residual_capacity.get(e)-augment_value);
marci@174: 	  }
marci@174: 	}
marci@174: 	
marci@174:       }
marci@174:             
marci@174:       return _augment;
marci@174:     }
marci@174:     bool augmentOnBlockingFlow2() {
marci@174:       bool _augment=false;
marci@174: 
marci@174:       //typedef ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> EAugGraph;
marci@174:       typedef FilterGraphWrapper< ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> > EAugGraph;
marci@174:       typedef typename EAugGraph::OutEdgeIt EAugOutEdgeIt;
marci@174:       typedef typename EAugGraph::Edge EAugEdge;
marci@174: 
marci@174:       EAugGraph res_graph(*G, *flow, *capacity);
marci@174: 
marci@174:       //typedef typename EAugGraph::NodeMap<bool> ReachedMap;
marci@174:       BfsIterator4< 
marci@174: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>, 
marci@175: 	typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt, 
marci@174: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<bool> > bfs(res_graph);
marci@174:       
marci@191:       bfs.pushAndSetReached(s);
marci@174: 
marci@174:       typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::
marci@174: 	NodeMap<int>& dist=res_graph.dist;
marci@174: 
marci@174:       while ( !bfs.finished() ) {
marci@175: 	typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt e=bfs;
marci@174: 	if (res_graph.valid(e) && bfs.isBNodeNewlyReached()) {
marci@174: 	  dist.set(res_graph.head(e), dist.get(res_graph.tail(e))+1);
marci@174: 	}
marci@174: 	++bfs;	
marci@174:       } //computing distances from s in the residual graph
marci@174: 
marci@174:       bool __augment=true;
marci@174: 
marci@174:       while (__augment) {
marci@174: 
marci@174: 	__augment=false;
marci@174: 	//computing blocking flow with dfs
marci@174: 	typedef typename EAugGraph::NodeMap<bool> BlockingReachedMap;
marci@174: 	DfsIterator4< EAugGraph, EAugOutEdgeIt, BlockingReachedMap > 
marci@174: 	  dfs(res_graph);
marci@174: 	typename EAugGraph::NodeMap<EAugEdge> pred(res_graph); 
marci@174: 	pred.set(s, EAugEdge(INVALID));
marci@174: 	//invalid iterators for sources
marci@174: 
marci@174: 	typename EAugGraph::NodeMap<Number> free(res_graph);
marci@174: 
marci@174: 	dfs.pushAndSetReached(s);
marci@174: 	while (!dfs.finished()) {
marci@174: 	  ++dfs;
marci@174: 	  if (res_graph.valid(EAugOutEdgeIt(dfs))) { 
marci@174: 	    if (dfs.isBNodeNewlyReached()) {
marci@174: 	  
marci@174: 	      typename EAugGraph::Node v=res_graph.aNode(dfs);
marci@174: 	      typename EAugGraph::Node w=res_graph.bNode(dfs);
marci@174: 
marci@174: 	      pred.set(w, EAugOutEdgeIt(dfs));
marci@174: 	      if (res_graph.valid(pred.get(v))) {
marci@191: 		free.set(w, std::min(free.get(v), res_graph.free(dfs)));
marci@174: 	      } else {
marci@191: 		free.set(w, res_graph.free(dfs)); 
marci@174: 	      }
marci@174: 	      
marci@174: 	      if (w==t) { 
marci@174: 		__augment=true; 
marci@174: 		_augment=true;
marci@174: 		break; 
marci@174: 	      }
marci@174: 	    } else {
marci@174: 	      res_graph.erase(dfs);
marci@174: 	    }
marci@174: 	  } 
marci@174: 
marci@174: 	}
marci@174: 
marci@174: 	if (__augment) {
marci@174: 	  typename EAugGraph::Node n=t;
marci@174: 	  Number augment_value=free.get(t);
marci@174: 	  while (res_graph.valid(pred.get(n))) { 
marci@174: 	    EAugEdge e=pred.get(n);
marci@174: 	    res_graph.augment(e, augment_value);
marci@174: 	    n=res_graph.tail(e);
marci@174: 	    if (res_graph.free(e)==0)
marci@174: 	      res_graph.erase(e);
marci@174: 	  }
marci@174: 	}
marci@174:       
marci@174:       }
marci@174:             
marci@174:       return _augment;
marci@174:     }
marci@174:     void run() {
marci@174:       //int num_of_augmentations=0;
marci@174:       while (augmentOnShortestPath()) { 
marci@174: 	//while (augmentOnBlockingFlow<MutableGraph>()) { 
marci@174: 	//std::cout << ++num_of_augmentations << " ";
marci@174: 	//std::cout<<std::endl;
marci@174:       } 
marci@174:     }
marci@174:     template<typename MutableGraph> void run() {
marci@174:       //int num_of_augmentations=0;
marci@174:       //while (augmentOnShortestPath()) { 
marci@174: 	while (augmentOnBlockingFlow<MutableGraph>()) { 
marci@174: 	//std::cout << ++num_of_augmentations << " ";
marci@174: 	//std::cout<<std::endl;
marci@174:       } 
marci@174:     }
marci@174:     Number flowValue() { 
marci@174:       Number a=0;
marci@174:       OutEdgeIt e;
marci@174:       for(G->/*getF*/first(e, s); G->valid(e); G->next(e)) {
marci@174: 	a+=flow->get(e);
marci@174:       }
marci@174:       return a;
marci@174:     }
marci@174:   };
marci@174: 
marci@193: 
marci@193:   template <typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@193:   class MaxMatching {
marci@193:   public:
marci@193:     typedef typename Graph::Node Node;
marci@194:     typedef typename Graph::NodeIt NodeIt;
marci@193:     typedef typename Graph::Edge Edge;
marci@193:     typedef typename Graph::EdgeIt EdgeIt;
marci@193:     typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@193:     typedef typename Graph::InEdgeIt InEdgeIt;
marci@193: 
marci@193:     typedef typename Graph::NodeMap<bool> SMap;
marci@193:     typedef typename Graph::NodeMap<bool> TMap;
marci@193:   private:
marci@193:     const Graph* G;
marci@193:     SMap* S;
marci@193:     TMap* T;
marci@193:     //Node s;
marci@193:     //Node t;
marci@193:     FlowMap* flow;
marci@193:     const CapacityMap* capacity;
marci@193:     typedef ResGraphWrapper<Graph, Number, FlowMap, CapacityMap > AugGraph;
marci@193:     typedef typename AugGraph::OutEdgeIt AugOutEdgeIt;
marci@193:     typedef typename AugGraph::Edge AugEdge;
marci@193: 
marci@193:   public:
marci@193:     MaxMatching(const Graph& _G, SMap& _S, TMap& _T, FlowMap& _flow, const CapacityMap& _capacity) : 
marci@193:       G(&_G), S(&_S), T(&_T), flow(&_flow), capacity(&_capacity) { }
marci@193:     bool augmentOnShortestPath() {
marci@193:       AugGraph res_graph(*G, *flow, *capacity);
marci@193:       bool _augment=false;
marci@193:       
marci@193:       typedef typename AugGraph::NodeMap<bool> ReachedMap;
marci@193:       BfsIterator5< AugGraph, /*AugOutEdgeIt,*/ ReachedMap > res_bfs(res_graph);
marci@193:       typename AugGraph::NodeMap<AugEdge> pred(res_graph); 
marci@193:       for(NodeIt s=G->template first<NodeIt>(); G->valid(s); G->next(s)) {
marci@196: 	if (S->get(s)) {
marci@197: 	  Number u=0;
marci@196: 	  for(OutEdgeIt e=G->template first<OutEdgeIt>(s); G->valid(e); G->next(e))
marci@197: 	    u+=flow->get(e);
marci@197: 	  if (u<1) {
marci@196: 	    res_bfs.pushAndSetReached(s);
marci@196: 	    pred.set(s, AugEdge(INVALID));
marci@196: 	  }
marci@193: 	}
marci@193:       }
marci@193:       
marci@193:       typename AugGraph::NodeMap<Number> free(res_graph);
marci@193: 	
marci@193:       Node n;
marci@193:       //searching for augmenting path
marci@193:       while ( !res_bfs.finished() ) { 
marci@193: 	AugOutEdgeIt e=res_bfs;
marci@193: 	if (res_graph.valid(e) && res_bfs.isBNodeNewlyReached()) {
marci@193: 	  Node v=res_graph.tail(e);
marci@193: 	  Node w=res_graph.head(e);
marci@193: 	  pred.set(w, e);
marci@193: 	  if (res_graph.valid(pred.get(v))) {
marci@193: 	    free.set(w, std::min(free.get(v), res_graph.free(e)));
marci@193: 	  } else {
marci@193: 	    free.set(w, res_graph.free(e)); 
marci@193: 	  }
marci@197: 	  n=res_graph.head(e);
marci@197: 	  if (T->get(n)) { 
marci@197: 	    Number u=0;
marci@197: 	    for(InEdgeIt f=G->template first<InEdgeIt>(n); G->valid(f); G->next(f))
marci@197: 	      u+=flow->get(f);
marci@197: 	    if (u<1) {
marci@197: 	      _augment=true; 
marci@197: 	      break; 
marci@197: 	    }
marci@193: 	  }
marci@193: 	}
marci@193: 	
marci@193: 	++res_bfs;
marci@193:       } //end of searching augmenting path
marci@193: 
marci@193:       if (_augment) {
marci@193: 	//Node n=t;
marci@194: 	Number augment_value=free.get(n);
marci@193: 	while (res_graph.valid(pred.get(n))) { 
marci@193: 	  AugEdge e=pred.get(n);
marci@193: 	  res_graph.augment(e, augment_value); 
marci@193: 	  n=res_graph.tail(e);
marci@193: 	}
marci@193:       }
marci@193: 
marci@193:       return _augment;
marci@193:     }
marci@193: 
marci@193: //     template<typename MutableGraph> bool augmentOnBlockingFlow() {      
marci@193: //       bool _augment=false;
marci@193: 
marci@193: //       AugGraph res_graph(*G, *flow, *capacity);
marci@193: 
marci@193: //       typedef typename AugGraph::NodeMap<bool> ReachedMap;
marci@193: //       BfsIterator4< AugGraph, AugOutEdgeIt, ReachedMap > bfs(res_graph);
marci@193: 
marci@197: 
marci@197: 
marci@197: 
marci@197: 
marci@197: //       //typename AugGraph::NodeMap<AugEdge> pred(res_graph); 
marci@197: //       for(NodeIt s=G->template first<NodeIt>(); G->valid(s); G->next(s)) {
marci@197: // 	if (S->get(s)) {
marci@197: // 	  Number u=0;
marci@197: // 	  for(OutEdgeIt e=G->template first<OutEdgeIt>(s); G->valid(e); G->next(e))
marci@197: // 	    u+=flow->get(e);
marci@197: // 	  if (u<1) {
marci@197: // 	    res_bfs.pushAndSetReached(s);
marci@197: // 	    //pred.set(s, AugEdge(INVALID));
marci@197: // 	  }
marci@197: // 	}
marci@197: //       }
marci@197: 
marci@197: 
marci@197: 
marci@197: 
marci@197: //       //bfs.pushAndSetReached(s);
marci@193: //       typename AugGraph::NodeMap<int> dist(res_graph); //filled up with 0's
marci@193: //       while ( !bfs.finished() ) { 
marci@193: // 	AugOutEdgeIt e=bfs;
marci@193: // 	if (res_graph.valid(e) && bfs.isBNodeNewlyReached()) {
marci@193: // 	  dist.set(res_graph.head(e), dist.get(res_graph.tail(e))+1);
marci@193: // 	}
marci@193: 	
marci@193: // 	++bfs;
marci@193: //       } //computing distances from s in the residual graph
marci@193: 
marci@193: //       MutableGraph F;
marci@193: //       typename AugGraph::NodeMap<typename MutableGraph::Node> 
marci@193: // 	res_graph_to_F(res_graph);
marci@193: //       for(typename AugGraph::NodeIt n=res_graph.template first<typename AugGraph::NodeIt>(); res_graph.valid(n); res_graph.next(n)) {
marci@193: // 	res_graph_to_F.set(n, F.addNode());
marci@193: //       }
marci@193:       
marci@193: //       typename MutableGraph::Node sF=res_graph_to_F.get(s);
marci@193: //       typename MutableGraph::Node tF=res_graph_to_F.get(t);
marci@193: 
marci@193: //       typename MutableGraph::EdgeMap<AugEdge> original_edge(F);
marci@193: //       typename MutableGraph::EdgeMap<Number> residual_capacity(F);
marci@193: 
marci@193: //       //Making F to the graph containing the edges of the residual graph 
marci@193: //       //which are in some shortest paths
marci@193: //       for(typename AugGraph::EdgeIt e=res_graph.template first<typename AugGraph::EdgeIt>(); res_graph.valid(e); res_graph.next(e)) {
marci@193: // 	if (dist.get(res_graph.head(e))==dist.get(res_graph.tail(e))+1) {
marci@193: // 	  typename MutableGraph::Edge f=F.addEdge(res_graph_to_F.get(res_graph.tail(e)), res_graph_to_F.get(res_graph.head(e)));
marci@193: // 	  original_edge.update();
marci@193: // 	  original_edge.set(f, e);
marci@193: // 	  residual_capacity.update();
marci@193: // 	  residual_capacity.set(f, res_graph.free(e));
marci@193: // 	} 
marci@193: //       }
marci@193: 
marci@193: //       bool __augment=true;
marci@193: 
marci@193: //       while (__augment) {
marci@193: // 	__augment=false;
marci@193: // 	//computing blocking flow with dfs
marci@193: // 	typedef typename MutableGraph::NodeMap<bool> BlockingReachedMap;
marci@193: // 	DfsIterator4< MutableGraph, typename MutableGraph::OutEdgeIt, BlockingReachedMap > dfs(F);
marci@193: // 	typename MutableGraph::NodeMap<typename MutableGraph::Edge> pred(F);
marci@193: // 	pred.set(sF, typename MutableGraph::Edge(INVALID));
marci@193: // 	//invalid iterators for sources
marci@193: 
marci@193: // 	typename MutableGraph::NodeMap<Number> free(F);
marci@193: 
marci@193: // 	dfs.pushAndSetReached(sF);      
marci@193: // 	while (!dfs.finished()) {
marci@193: // 	  ++dfs;
marci@193: // 	  if (F.valid(typename MutableGraph::OutEdgeIt(dfs))) {
marci@193: // 	    if (dfs.isBNodeNewlyReached()) {
marci@193: // 	      typename MutableGraph::Node v=F.aNode(dfs);
marci@193: // 	      typename MutableGraph::Node w=F.bNode(dfs);
marci@193: // 	      pred.set(w, dfs);
marci@193: // 	      if (F.valid(pred.get(v))) {
marci@193: // 		free.set(w, std::min(free.get(v), residual_capacity.get(dfs)));
marci@193: // 	      } else {
marci@193: // 		free.set(w, residual_capacity.get(dfs)); 
marci@193: // 	      }
marci@193: // 	      if (w==tF) { 
marci@193: // 		__augment=true; 
marci@193: // 		_augment=true;
marci@193: // 		break; 
marci@193: // 	      }
marci@193: 	      
marci@193: // 	    } else {
marci@193: // 	      F.erase(typename MutableGraph::OutEdgeIt(dfs));
marci@193: // 	    }
marci@193: // 	  } 
marci@193: // 	}
marci@193: 
marci@193: // 	if (__augment) {
marci@193: // 	  typename MutableGraph::Node n=tF;
marci@193: // 	  Number augment_value=free.get(tF);
marci@193: // 	  while (F.valid(pred.get(n))) { 
marci@193: // 	    typename MutableGraph::Edge e=pred.get(n);
marci@193: // 	    res_graph.augment(original_edge.get(e), augment_value); 
marci@193: // 	    n=F.tail(e);
marci@193: // 	    if (residual_capacity.get(e)==augment_value) 
marci@193: // 	      F.erase(e); 
marci@193: // 	    else 
marci@193: // 	      residual_capacity.set(e, residual_capacity.get(e)-augment_value);
marci@193: // 	  }
marci@193: // 	}
marci@193: 	
marci@193: //       }
marci@193:             
marci@193: //       return _augment;
marci@193: //     }
marci@197:     bool augmentOnBlockingFlow2() {
marci@197:       bool _augment=false;
marci@193: 
marci@197:       //typedef ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> EAugGraph;
marci@197:       typedef FilterGraphWrapper< ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> > EAugGraph;
marci@197:       typedef typename EAugGraph::OutEdgeIt EAugOutEdgeIt;
marci@197:       typedef typename EAugGraph::Edge EAugEdge;
marci@193: 
marci@197:       EAugGraph res_graph(*G, *flow, *capacity);
marci@193: 
marci@197:       //typedef typename EAugGraph::NodeMap<bool> ReachedMap;
marci@197:       BfsIterator4< 
marci@197: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>, 
marci@197: 	typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt, 
marci@197: 	ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<bool> > bfs(res_graph);
marci@197: 
marci@197: 
marci@197:       //typename AugGraph::NodeMap<AugEdge> pred(res_graph); 
marci@197:       for(NodeIt s=G->template first<NodeIt>(); G->valid(s); G->next(s)) {
marci@197: 	if (S->get(s)) {
marci@197: 	  Number u=0;
marci@197: 	  for(OutEdgeIt e=G->template first<OutEdgeIt>(s); G->valid(e); G->next(e))
marci@197: 	    u+=flow->get(e);
marci@197: 	  if (u<1) {
marci@197: 	    bfs.pushAndSetReached(s);
marci@197: 	    //pred.set(s, AugEdge(INVALID));
marci@197: 	  }
marci@197: 	}
marci@197:       }
marci@197: 
marci@193:       
marci@197:       //bfs.pushAndSetReached(s);
marci@193: 
marci@197:       typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::
marci@197: 	NodeMap<int>& dist=res_graph.dist;
marci@193: 
marci@197:       while ( !bfs.finished() ) {
marci@197: 	typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt e=bfs;
marci@197: 	if (res_graph.valid(e) && bfs.isBNodeNewlyReached()) {
marci@197: 	  dist.set(res_graph.head(e), dist.get(res_graph.tail(e))+1);
marci@197: 	}
marci@197: 	++bfs;	
marci@197:       } //computing distances from s in the residual graph
marci@193: 
marci@197:       bool __augment=true;
marci@193: 
marci@197:       while (__augment) {
marci@193: 
marci@197: 	__augment=false;
marci@197: 	//computing blocking flow with dfs
marci@197: 	typedef typename EAugGraph::NodeMap<bool> BlockingReachedMap;
marci@197: 	DfsIterator4< EAugGraph, EAugOutEdgeIt, BlockingReachedMap > 
marci@197: 	  dfs(res_graph);
marci@197: 	typename EAugGraph::NodeMap<EAugEdge> pred(res_graph, INVALID); 
marci@197: 	//pred.set(s, EAugEdge(INVALID));
marci@197: 	//invalid iterators for sources
marci@193: 
marci@197: 	typename EAugGraph::NodeMap<Number> free(res_graph);
marci@193: 
marci@197: 
marci@197: 	//typename AugGraph::NodeMap<AugEdge> pred(res_graph); 
marci@197:       for(NodeIt s=G->template first<NodeIt>(); G->valid(s); G->next(s)) {
marci@197: 	if (S->get(s)) {
marci@197: 	  Number u=0;
marci@197: 	  for(OutEdgeIt e=G->template first<OutEdgeIt>(s); G->valid(e); G->next(e))
marci@197: 	    u+=flow->get(e);
marci@197: 	  if (u<1) {
marci@197: 	    dfs.pushAndSetReached(s);
marci@197: 	    //pred.set(s, AugEdge(INVALID));
marci@197: 	  }
marci@197: 	}
marci@197:       }
marci@197: 
marci@197: 
marci@197: 
marci@197:       //dfs.pushAndSetReached(s);
marci@197:       typename EAugGraph::Node n;
marci@197: 	while (!dfs.finished()) {
marci@197: 	  ++dfs;
marci@197: 	  if (res_graph.valid(EAugOutEdgeIt(dfs))) { 
marci@197: 	    if (dfs.isBNodeNewlyReached()) {
marci@193: 	  
marci@197: 	      typename EAugGraph::Node v=res_graph.aNode(dfs);
marci@197: 	      typename EAugGraph::Node w=res_graph.bNode(dfs);
marci@193: 
marci@197: 	      pred.set(w, EAugOutEdgeIt(dfs));
marci@197: 	      if (res_graph.valid(pred.get(v))) {
marci@197: 		free.set(w, std::min(free.get(v), res_graph.free(dfs)));
marci@197: 	      } else {
marci@197: 		free.set(w, res_graph.free(dfs)); 
marci@197: 	      }
marci@197: 	     
marci@197: 	      n=w;
marci@197: 	      if (T->get(w)) {
marci@197: 		Number u=0;
marci@197: 		for(InEdgeIt f=G->template first<InEdgeIt>(n); G->valid(f); G->next(f))
marci@197: 		  u+=flow->get(f);
marci@197: 		if (u<1) {
marci@197: 		  __augment=true; 
marci@197: 		  _augment=true;
marci@197: 		  break; 
marci@197: 		}
marci@197: 	      }
marci@197: 	    } else {
marci@197: 	      res_graph.erase(dfs);
marci@197: 	    }
marci@197: 	  } 
marci@193: 
marci@197: 	}
marci@193: 
marci@197: 	if (__augment) {
marci@197: 	  // typename EAugGraph::Node n=t;
marci@197: 	  Number augment_value=free.get(n);
marci@197: 	  while (res_graph.valid(pred.get(n))) { 
marci@197: 	    EAugEdge e=pred.get(n);
marci@197: 	    res_graph.augment(e, augment_value);
marci@197: 	    n=res_graph.tail(e);
marci@197: 	    if (res_graph.free(e)==0)
marci@197: 	      res_graph.erase(e);
marci@197: 	  }
marci@197: 	}
marci@193:       
marci@197:       }
marci@193:             
marci@197:       return _augment;
marci@197:     }
marci@193:     void run() {
marci@193:       //int num_of_augmentations=0;
marci@193:       while (augmentOnShortestPath()) { 
marci@193: 	//while (augmentOnBlockingFlow<MutableGraph>()) { 
marci@193: 	//std::cout << ++num_of_augmentations << " ";
marci@193: 	//std::cout<<std::endl;
marci@193:       } 
marci@193:     }
marci@194: //     template<typename MutableGraph> void run() {
marci@194: //       //int num_of_augmentations=0;
marci@194: //       //while (augmentOnShortestPath()) { 
marci@194: // 	while (augmentOnBlockingFlow<MutableGraph>()) { 
marci@194: // 	//std::cout << ++num_of_augmentations << " ";
marci@194: // 	//std::cout<<std::endl;
marci@194: //       } 
marci@194: //     } 
marci@193:     Number flowValue() { 
marci@193:       Number a=0;
marci@194:       EdgeIt e;
marci@194:       for(G->/*getF*/first(e); G->valid(e); G->next(e)) {
marci@193: 	a+=flow->get(e);
marci@193:       }
marci@193:       return a;
marci@193:     }
marci@193:   };
marci@193: 
marci@193: 
marci@193: 
marci@193: 
marci@193: 
marci@174:   
marci@174: //   template <typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@174: //   class MaxFlow2 {
marci@174: //   public:
marci@174: //     typedef typename Graph::Node Node;
marci@174: //     typedef typename Graph::Edge Edge;
marci@174: //     typedef typename Graph::EdgeIt EdgeIt;
marci@174: //     typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@174: //     typedef typename Graph::InEdgeIt InEdgeIt;
marci@174: //   private:
marci@174: //     const Graph& G;
marci@174: //     std::list<Node>& S;
marci@174: //     std::list<Node>& T;
marci@174: //     FlowMap& flow;
marci@174: //     const CapacityMap& capacity;
marci@174: //     typedef ResGraphWrapper<Graph, Number, FlowMap, CapacityMap > AugGraph;
marci@174: //     typedef typename AugGraph::OutEdgeIt AugOutEdgeIt;
marci@174: //     typedef typename AugGraph::Edge AugEdge;
marci@174: //     typename Graph::NodeMap<bool> SMap;
marci@174: //     typename Graph::NodeMap<bool> TMap;
marci@174: //   public:
marci@174: //     MaxFlow2(const Graph& _G, std::list<Node>& _S, std::list<Node>& _T, FlowMap& _flow, const CapacityMap& _capacity) : G(_G), S(_S), T(_T), flow(_flow), capacity(_capacity), SMap(_G), TMap(_G) { 
marci@174: //       for(typename std::list<Node>::const_iterator i=S.begin(); 
marci@174: // 	  i!=S.end(); ++i) { 
marci@174: // 	SMap.set(*i, true); 
marci@174: //       }
marci@174: //       for (typename std::list<Node>::const_iterator i=T.begin(); 
marci@174: // 	   i!=T.end(); ++i) { 
marci@174: // 	TMap.set(*i, true); 
marci@174: //       }
marci@174: //     }
marci@174: //     bool augment() {
marci@174: //       AugGraph res_graph(G, flow, capacity);
marci@174: //       bool _augment=false;
marci@174: //       Node reached_t_node;
marci@174:       
marci@174: //       typedef typename AugGraph::NodeMap<bool> ReachedMap;
marci@174: //       BfsIterator4< AugGraph, AugOutEdgeIt, ReachedMap > res_bfs(res_graph);
marci@174: //       for(typename std::list<Node>::const_iterator i=S.begin(); 
marci@174: // 	  i!=S.end(); ++i) {
marci@174: // 	res_bfs.pushAndSetReached(*i);
marci@174: //       }
marci@174: //       //res_bfs.pushAndSetReached(s);
marci@174: 	
marci@174: //       typename AugGraph::NodeMap<AugEdge> pred(res_graph); 
marci@174: //       //filled up with invalid iterators
marci@174:       
marci@174: //       typename AugGraph::NodeMap<Number> free(res_graph);
marci@174: 	
marci@174: //       //searching for augmenting path
marci@174: //       while ( !res_bfs.finished() ) { 
marci@174: // 	AugOutEdgeIt e=/*AugOutEdgeIt*/(res_bfs);
marci@174: // 	if (e.valid() && res_bfs.isBNodeNewlyReached()) {
marci@174: // 	  Node v=res_graph.tail(e);
marci@174: // 	  Node w=res_graph.head(e);
marci@174: // 	  pred.set(w, e);
marci@174: // 	  if (pred.get(v).valid()) {
marci@174: // 	    free.set(w, std::min(free.get(v), e.free()));
marci@174: // 	  } else {
marci@174: // 	    free.set(w, e.free()); 
marci@174: // 	  }
marci@174: // 	  if (TMap.get(res_graph.head(e))) { 
marci@174: // 	    _augment=true; 
marci@174: // 	    reached_t_node=res_graph.head(e);
marci@174: // 	    break; 
marci@174: // 	  }
marci@174: // 	}
marci@174: 	
marci@174: // 	++res_bfs;
marci@174: //       } //end of searching augmenting path
marci@174: 
marci@174: //       if (_augment) {
marci@174: // 	Node n=reached_t_node;
marci@174: // 	Number augment_value=free.get(reached_t_node);
marci@174: // 	while (pred.get(n).valid()) { 
marci@174: // 	  AugEdge e=pred.get(n);
marci@174: // 	  e.augment(augment_value); 
marci@174: // 	  n=res_graph.tail(e);
marci@174: // 	}
marci@174: //       }
marci@174: 
marci@174: //       return _augment;
marci@174: //     }
marci@174: //     void run() {
marci@174: //       while (augment()) { } 
marci@174: //     }
marci@174: //     Number flowValue() { 
marci@174: //       Number a=0;
marci@174: //       for(typename std::list<Node>::const_iterator i=S.begin(); 
marci@174: // 	  i!=S.end(); ++i) { 
marci@174: // 	for(OutEdgeIt e=G.template first<OutEdgeIt>(*i); e.valid(); ++e) {
marci@174: // 	  a+=flow.get(e);
marci@174: // 	}
marci@174: // 	for(InEdgeIt e=G.template first<InEdgeIt>(*i); e.valid(); ++e) {
marci@174: // 	  a-=flow.get(e);
marci@174: // 	}
marci@174: //       }
marci@174: //       return a;
marci@174: //     }
marci@174: //   };
marci@174: 
marci@174: 
marci@174: 
marci@174: } // namespace hugo
marci@174: 
marci@174: #endif //EDMONDS_KARP_H