Changeset 30:10a3f2e0928c in lemon-0.x for src/work/preflow_push_hl.hh
- Timestamp:
- 01/21/04 15:51:05 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@43
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/preflow_push_hl.hh
r20 r30 84 84 reverse_bfs<list_graph> bfs(G, t); 85 85 bfs.run(); 86 for(each_node_iterator v=G.first_node(); v. is_valid(); ++v) {86 for(each_node_iterator v=G.first_node(); v.valid(); ++v) { 87 87 level.put(v, bfs.dist(v)); 88 88 //std::cout << "the level of " << v << " is " << bfs.dist(v); … … 98 98 /* Starting flow. It is everywhere 0 at the moment. */ 99 99 100 for(out_edge_iterator i=G.first_out_edge(s); i. is_valid(); ++i)100 for(out_edge_iterator i=G.first_out_edge(s); i.valid(); ++i) 101 101 { 102 102 node_iterator w=G.head(i); … … 130 130 int newlevel=2*n-2; //In newlevel we maintain the next level of w. 131 131 132 for(out_edge_iterator e=G.first_out_edge(w); e. is_valid(); ++e) {132 for(out_edge_iterator e=G.first_out_edge(w); e.valid(); ++e) { 133 133 node_iterator v=G.head(e); 134 134 /*e is the edge wv.*/ … … 171 171 } //if (flow.get(e)<capacity.get(e)) 172 172 173 } //for(out_edge_iterator e=G.first_out_edge(w); e. is_valid(); ++e)173 } //for(out_edge_iterator e=G.first_out_edge(w); e.valid(); ++e) 174 174 175 175 176 176 177 for(in_edge_iterator e=G.first_in_edge(w); e. is_valid(); ++e) {177 for(in_edge_iterator e=G.first_in_edge(w); e.valid(); ++e) { 178 178 node_iterator v=G.tail(e); 179 179 /*e is the edge vw.*/ … … 289 289 queue.pop(); 290 290 291 for(in_edge_iterator e=G.first_in_edge(w) ; e. is_valid(); ++e) {291 for(in_edge_iterator e=G.first_in_edge(w) ; e.valid(); ++e) { 292 292 node_iterator v=G.tail(e); 293 293 if (mincutvector.get(v) && flow.get(e) < capacity.get(e) ) { … … 297 297 } // for 298 298 299 for(out_edge_iterator e=G.first_out_edge(w) ; e. is_valid(); ++e) {299 for(out_edge_iterator e=G.first_out_edge(w) ; e.valid(); ++e) { 300 300 node_iterator v=G.head(e); 301 301 if (mincutvector.get(v) && flow.get(e) > 0 ) {
Note: See TracChangeset
for help on using the changeset viewer.