equal
deleted
inserted
replaced
224 |
224 |
225 void findMinCutOut() { |
225 void findMinCutOut() { |
226 |
226 |
227 for (NodeIt n(_graph); n != INVALID; ++n) { |
227 for (NodeIt n(_graph); n != INVALID; ++n) { |
228 (*_excess)[n] = 0; |
228 (*_excess)[n] = 0; |
|
229 (*_source_set)[n] = false; |
229 } |
230 } |
230 |
231 |
231 for (ArcIt a(_graph); a != INVALID; ++a) { |
232 for (ArcIt a(_graph); a != INVALID; ++a) { |
232 (*_flow)[a] = 0; |
233 (*_flow)[a] = 0; |
233 } |
234 } |
523 |
524 |
524 void findMinCutIn() { |
525 void findMinCutIn() { |
525 |
526 |
526 for (NodeIt n(_graph); n != INVALID; ++n) { |
527 for (NodeIt n(_graph); n != INVALID; ++n) { |
527 (*_excess)[n] = 0; |
528 (*_excess)[n] = 0; |
|
529 (*_source_set)[n] = false; |
528 } |
530 } |
529 |
531 |
530 for (ArcIt a(_graph); a != INVALID; ++a) { |
532 for (ArcIt a(_graph); a != INVALID; ++a) { |
531 (*_flow)[a] = 0; |
533 (*_flow)[a] = 0; |
532 } |
534 } |