equal
deleted
inserted
replaced
124 T exc=0; |
124 T exc=0; |
125 |
125 |
126 InEdgeIt e; |
126 InEdgeIt e; |
127 for(G.first(e,v); G.valid(e); G.next(e)) exc+=flow[e]; |
127 for(G.first(e,v); G.valid(e); G.next(e)) exc+=flow[e]; |
128 OutEdgeIt f; |
128 OutEdgeIt f; |
129 for(G.first(f,v); G.valid(f); G.next(f)) exc-=flow[e]; |
129 for(G.first(f,v); G.valid(f); G.next(f)) exc-=flow[f]; |
130 |
130 |
131 excess.set(v,exc); |
131 excess.set(v,exc); |
132 |
132 |
133 //putting the active nodes into the stack |
133 //putting the active nodes into the stack |
134 int lev=level[v]; |
134 int lev=level[v]; |
470 void minCut(CutMap& M) { |
470 void minCut(CutMap& M) { |
471 minMinCut(M); |
471 minMinCut(M); |
472 } |
472 } |
473 |
473 |
474 |
474 |
475 void reset_target (Node _t) {t=_t;} |
475 |
476 void reset_source (Node _s) {s=_s;} |
476 void resetTarget (Node _t) {t=_t;} |
|
477 void resetSource (Node _s) {s=_s;} |
477 |
478 |
478 template<typename _CapMap> |
479 void resetCap (CapMap _cap) {capacity=_cap;} |
479 void reset_cap (_CapMap _cap) {capacity=_cap;} |
480 |
480 |
481 void resetFlow (FlowMap _flow, bool _constzero) { |
481 template<typename _FlowMap> |
|
482 void reset_cap (_FlowMap _flow, bool _constzero) { |
|
483 flow=_flow; |
482 flow=_flow; |
484 constzero=_constzero; |
483 constzero=_constzero; |
485 } |
484 } |
486 |
485 |
487 |
486 |
488 |
|
489 }; |
487 }; |
490 |
488 |
491 } //namespace hugo |
489 } //namespace hugo |
492 |
490 |
493 #endif //HUGO_PREFLOW_RES_H |
491 #endif //HUGO_PREFLOW_RES_H |