Changeset 777:a82713ed19f3 in lemon0.x for src/work/marci/lg_vs_sg_vs_sg.cc
 Timestamp:
 08/31/04 19:54:22 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1070
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/marci/lg_vs_sg_vs_sg.cc
r762 r777 54 54 { 55 55 std::cout << "physical blocking flow augmentation ..." << std::endl; 56 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);56 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 57 57 ts.reset(); 58 58 int i=0; … … 76 76 { 77 77 std::cout << "onthefly blocking flow augmentation ..." << std::endl; 78 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);78 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 79 79 ts.reset(); 80 80 int i=0; … … 87 87 { 88 88 std::cout << "onthefly shortest path augmentation ..." << std::endl; 89 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);89 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 90 90 ts.reset(); 91 91 int i=0; … … 122 122 { 123 123 std::cout << "preflow ..." << std::endl; 124 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);124 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 125 125 ts.reset(); 126 126 max_flow_test.run(); … … 131 131 { 132 132 std::cout << "physical blocking flow augmentation ..." << std::endl; 133 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);133 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 134 134 ts.reset(); 135 135 int i=0; … … 153 153 { 154 154 std::cout << "onthefly blocking flow augmentation ..." << std::endl; 155 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);155 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 156 156 ts.reset(); 157 157 int i=0; … … 164 164 { 165 165 std::cout << "onthefly shortest path augmentation ..." << std::endl; 166 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);166 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 167 167 ts.reset(); 168 168 int i=0; … … 199 199 { 200 200 std::cout << "preflow ..." << std::endl; 201 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);201 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 202 202 ts.reset(); 203 203 max_flow_test.run(); … … 208 208 { 209 209 std::cout << "physical blocking flow augmentation ..." << std::endl; 210 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);210 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 211 211 ts.reset(); 212 212 int i=0; … … 230 230 { 231 231 std::cout << "onthefly blocking flow augmentation ..." << std::endl; 232 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);232 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 233 233 ts.reset(); 234 234 int i=0; … … 241 241 { 242 242 std::cout << "onthefly shortest path augmentation ..." << std::endl; 243 FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);243 for (Graph::EdgeIt e(g); e!=INVALID; ++e) flow.set(e, 0); 244 244 ts.reset(); 245 245 int i=0;
Note: See TracChangeset
for help on using the changeset viewer.