1.1 --- a/src/work/edmonds_karp.hh	Mon Mar 01 14:43:07 2004 +0000
     1.2 +++ b/src/work/edmonds_karp.hh	Mon Mar 01 16:32:50 2004 +0000
     1.3 @@ -528,7 +528,7 @@
     1.4  	
     1.5        //searching for augmenting path
     1.6        while ( !res_bfs.finished() ) { 
     1.7 -	AugOutEdgeIt e=AugOutEdgeIt(res_bfs);
     1.8 +	AugOutEdgeIt e=/*AugOutEdgeIt*/(res_bfs);
     1.9  	if (e.valid() && res_bfs.isBNodeNewlyReached()) {
    1.10  	  NodeIt v=res_graph.tail(e);
    1.11  	  NodeIt w=res_graph.head(e);
    1.12 @@ -556,6 +556,7 @@
    1.13  
    1.14        return _augment;
    1.15      }
    1.16 +
    1.17      template<typename MutableGraph> bool augmentOnBlockingFlow() {
    1.18        bool _augment=false;
    1.19  
    1.20 @@ -567,7 +568,7 @@
    1.21        bfs.pushAndSetReached(s);
    1.22        typename AugGraph::NodeMap<int> dist(res_graph); //filled up with 0's
    1.23        while ( !bfs.finished() ) { 
    1.24 -	AugOutEdgeIt e=AugOutEdgeIt(bfs);
    1.25 +	AugOutEdgeIt e=/*AugOutEdgeIt*/(bfs);
    1.26  	if (e.valid() && bfs.isBNodeNewlyReached()) {
    1.27  	  dist.set(res_graph.head(e), dist.get(res_graph.tail(e))+1);
    1.28  	}
    1.29 @@ -793,7 +794,7 @@
    1.30  	
    1.31        //searching for augmenting path
    1.32        while ( !res_bfs.finished() ) { 
    1.33 -	AugOutEdgeIt e=AugOutEdgeIt(res_bfs);
    1.34 +	AugOutEdgeIt e=/*AugOutEdgeIt*/(res_bfs);
    1.35  	if (e.valid() && res_bfs.isBNodeNewlyReached()) {
    1.36  	  NodeIt v=res_graph.tail(e);
    1.37  	  NodeIt w=res_graph.head(e);