Changeset 330:7ac0d4e8a31c in lemon-0.x for src/work/marci/edmonds_karp_demo.cc
- Timestamp:
- 04/15/04 16:41:20 (21 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@448
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/marci/edmonds_karp_demo.cc
r317 r330 105 105 106 106 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 107 max_flow_test(G, s, t, flow, cap);107 max_flow_test(G, s, t, cap, flow); 108 108 int i=0; 109 109 while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { … … 133 133 134 134 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 135 max_flow_test(G, s, t, flow, cap);135 max_flow_test(G, s, t, cap, flow); 136 136 int i=0; 137 137 while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) { … … 161 161 162 162 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 163 max_flow_test(G, s, t, flow, cap);163 max_flow_test(G, s, t, cap, flow); 164 164 int i=0; 165 165 while (max_flow_test.augmentOnBlockingFlow2()) { … … 189 189 190 190 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 191 max_flow_test(G, s, t, flow, cap);191 max_flow_test(G, s, t, cap, flow); 192 192 int i=0; 193 193 while (max_flow_test.augmentOnShortestPath()) {
Note: See TracChangeset
for help on using the changeset viewer.