equal
deleted
inserted
replaced
195 |
195 |
196 private: |
196 private: |
197 |
197 |
198 template <typename ResGraph> |
198 template <typename ResGraph> |
199 void findMinCut(const Node& target, bool out, ResGraph& res_graph) { |
199 void findMinCut(const Node& target, bool out, ResGraph& res_graph) { |
200 typedef typename Graph::Node Node; |
|
201 typedef typename ResGraph::Edge ResEdge; |
200 typedef typename ResGraph::Edge ResEdge; |
202 typedef typename ResGraph::OutEdgeIt ResOutEdgeIt; |
201 typedef typename ResGraph::OutEdgeIt ResOutEdgeIt; |
203 |
202 |
204 for (typename Graph::EdgeIt it(*_graph); it != INVALID; ++it) { |
203 for (typename Graph::EdgeIt it(*_graph); it != INVALID; ++it) { |
205 (*_preflow)[it] = 0; |
204 (*_preflow)[it] = 0; |
325 Node old_target = _target; |
324 Node old_target = _target; |
326 (*_wake)[_target] = false; |
325 (*_wake)[_target] = false; |
327 --_level_size[(*_dist)[_target]]; |
326 --_level_size[(*_dist)[_target]]; |
328 _dormant[0].push_front(_target); |
327 _dormant[0].push_front(_target); |
329 (*_source_set)[_target] = true; |
328 (*_source_set)[_target] = true; |
330 if ((int)_dormant[0].size() == _node_num){ |
329 if (int(_dormant[0].size()) == _node_num){ |
331 _dormant[0].clear(); |
330 _dormant[0].clear(); |
332 return false; |
331 return false; |
333 } |
332 } |
334 |
333 |
335 bool wake_was_empty = false; |
334 bool wake_was_empty = false; |