diff -r 584270fba752 -r c3187cafcabf src/hugo/minlengthpaths.h
--- a/src/hugo/minlengthpaths.h	Thu Sep 02 15:30:50 2004 +0000
+++ b/src/hugo/minlengthpaths.h	Thu Sep 02 16:56:33 2004 +0000
@@ -12,7 +12,6 @@
 #include <hugo/maps.h>
 #include <vector>
 #include <hugo/mincostflows.h>
-#include <for_each_macros.h>
 
 namespace hugo {
 
@@ -83,10 +82,8 @@
       //The name here suggests that the flow has only 0/1 values.
       EdgeIntMap reversed(G); 
 
-      //FOR_EACH_LOC(typename Graph::EdgeIt, e, G){
-      for(typename Graph::EdgeIt e=loopFirst(typename Graph::EdgeIt(), (G)); e!=INVALID; ++e){
+      for(typename Graph::EdgeIt e(G); e!=INVALID; ++e) 
 	reversed[e] = mincost_flow.getFlow()[e];
-      }
       
       paths.clear();
       //total_length=0;