equal
deleted
inserted
replaced
154 |
154 |
155 ///Constructor |
155 ///Constructor |
156 |
156 |
157 ///\todo Document, please. |
157 ///\todo Document, please. |
158 /// |
158 /// |
159 MaxFlowNoStack(const Graph& _G, Node _s, Node _t, const CapMap& _capacity, |
159 MaxFlowNoStack(const Graph& _G, Node _s, Node _t, |
160 FlowMap& _flow) : |
160 const CapMap& _capacity, FlowMap& _flow) : |
161 g(&_G), s(_s), t(_t), capacity(&_capacity), |
161 g(&_G), s(_s), t(_t), capacity(&_capacity), |
162 flow(&_flow), n(_G.nodeNum()), level(_G), excess(_G,0), |
162 flow(&_flow), n(_G.nodeNum()), level(_G), excess(_G,0), |
163 status(AFTER_NOTHING), number_of_augmentations(0) { } |
163 status(AFTER_NOTHING), number_of_augmentations(0) { } |
164 |
164 |
165 ///Runs a maximum flow algorithm. |
165 ///Runs a maximum flow algorithm. |
411 |
411 |
412 /// Resets the edge map of the capacities to _cap. |
412 /// Resets the edge map of the capacities to _cap. |
413 |
413 |
414 /// Resets the edge map of the capacities to _cap. |
414 /// Resets the edge map of the capacities to _cap. |
415 /// |
415 /// |
416 void resetCap(const CapMap& _cap) { capacity=&_cap; status=AFTER_NOTHING; } |
416 void resetCap(const CapMap& _cap) |
|
417 { capacity=&_cap; status=AFTER_NOTHING; } |
417 |
418 |
418 /// Resets the edge map of the flows to _flow. |
419 /// Resets the edge map of the flows to _flow. |
419 |
420 |
420 /// Resets the edge map of the flows to _flow. |
421 /// Resets the edge map of the flows to _flow. |
421 /// |
422 /// |