1.1 --- a/src/hugo/minlengthpaths.h	Thu Sep 02 15:30:50 2004 +0000
     1.2 +++ b/src/hugo/minlengthpaths.h	Thu Sep 02 16:56:33 2004 +0000
     1.3 @@ -12,7 +12,6 @@
     1.4  #include <hugo/maps.h>
     1.5  #include <vector>
     1.6  #include <hugo/mincostflows.h>
     1.7 -#include <for_each_macros.h>
     1.8  
     1.9  namespace hugo {
    1.10  
    1.11 @@ -83,10 +82,8 @@
    1.12        //The name here suggests that the flow has only 0/1 values.
    1.13        EdgeIntMap reversed(G); 
    1.14  
    1.15 -      //FOR_EACH_LOC(typename Graph::EdgeIt, e, G){
    1.16 -      for(typename Graph::EdgeIt e=loopFirst(typename Graph::EdgeIt(), (G)); e!=INVALID; ++e){
    1.17 +      for(typename Graph::EdgeIt e(G); e!=INVALID; ++e) 
    1.18  	reversed[e] = mincost_flow.getFlow()[e];
    1.19 -      }
    1.20        
    1.21        paths.clear();
    1.22        //total_length=0;