equal
deleted
inserted
replaced
300 |
300 |
301 Node v=bfs_queue.front(); |
301 Node v=bfs_queue.front(); |
302 bfs_queue.pop(); |
302 bfs_queue.pop(); |
303 int l=level[v]+1; |
303 int l=level[v]+1; |
304 |
304 |
305 ResInEdgeIt e; |
305 /* ResInEdgeIt e; |
306 for(res_graph.first(e,s); res_graph.valid(e); |
306 for(res_graph.first(e,s); res_graph.valid(e); |
307 res_graph.next(e)) { |
307 res_graph.next(e)) { |
308 Node u=res_graph.tail(e); |
308 Node u=res_graph.tail(e); |
309 if ( level[u] >= n ) { |
309 if ( level[u] >= n ) { |
310 bfs_queue.push(u); |
310 bfs_queue.push(u); |
312 if ( excess[u] > 0 ) { |
312 if ( excess[u] > 0 ) { |
313 next.set(u,active[l]); |
313 next.set(u,active[l]); |
314 active[l]=u; |
314 active[l]=u; |
315 } |
315 } |
316 } |
316 } |
317 } |
317 }*/ |
318 /* InEdgeIt e; |
318 InEdgeIt e; |
319 for(G.first(e,v); G.valid(e); G.next(e)) { |
319 for(G.first(e,v); G.valid(e); G.next(e)) { |
320 if ( capacity[e] == flow[e] ) continue; |
320 if ( capacity[e] == flow[e] ) continue; |
321 Node u=G.tail(e); |
321 Node u=G.tail(e); |
322 if ( level[u] >= n ) { |
322 if ( level[u] >= n ) { |
323 bfs_queue.push(u); |
323 bfs_queue.push(u); |
339 if ( excess[u] > 0 ) { |
339 if ( excess[u] > 0 ) { |
340 next.set(u,active[l]); |
340 next.set(u,active[l]); |
341 active[l]=u; |
341 active[l]=u; |
342 } |
342 } |
343 } |
343 } |
344 }*/ |
344 } |
345 } |
345 } |
346 b=n-2; |
346 b=n-2; |
347 } |
347 } |
348 |
348 |
349 } |
349 } |