1.1 --- a/src/hugo/mincostflows.h	Tue May 25 13:13:52 2004 +0000
     1.2 +++ b/src/hugo/mincostflows.h	Tue May 25 15:11:11 2004 +0000
     1.3 @@ -11,7 +11,7 @@
     1.4  #include <hugo/graph_wrapper.h>
     1.5  #include <hugo/maps.h>
     1.6  #include <vector>
     1.7 -#include <for_each_macros.h>
     1.8 +#include <hugo/for_each_macros.h>
     1.9  
    1.10  namespace hugo {
    1.11  
    1.12 @@ -90,7 +90,8 @@
    1.13      //To store the flow
    1.14      EdgeIntMap flow; 
    1.15      //To store the potentila (dual variables)
    1.16 -    typename Graph::template NodeMap<Length> potential;
    1.17 +    typedef typename Graph::template NodeMap<Length> PotentialMap;
    1.18 +    PotentialMap potential;
    1.19      
    1.20  
    1.21      Length total_length;
    1.22 @@ -184,7 +185,7 @@
    1.23  
    1.24    ///Returns a const reference to the NodeMap \c potential (the dual solution).
    1.25      /// \pre \ref run() must be called before using this function.
    1.26 -    const EdgeIntMap &getPotential() const { return potential;}
    1.27 +    const PotentialMap &getPotential() const { return potential;}
    1.28  
    1.29      ///This function checks, whether the given solution is optimal
    1.30      ///Running after a \c run() should return with true