1.1 --- a/lemon/min_cost_max_flow.h	Thu Feb 21 13:06:33 2008 +0000
     1.2 +++ b/lemon/min_cost_max_flow.h	Mon Feb 25 12:35:06 2008 +0000
     1.3 @@ -140,7 +140,7 @@
     1.4      ///
     1.5      /// \pre \ref run() must be called before using this function.
     1.6      const FlowMap& flowMap() const {
     1.7 -      return _flow_result;
     1.8 +      return _flow;
     1.9      }
    1.10  
    1.11      /// \brief Returns a const reference to the node map storing the
    1.12 @@ -151,7 +151,7 @@
    1.13      ///
    1.14      /// \pre \ref run() must be called before using this function.
    1.15      const PotentialMap& potentialMap() const {
    1.16 -      return _potential_result;
    1.17 +      return _potential;
    1.18      }
    1.19  
    1.20      /// \brief Returns the total cost of the found flow.
    1.21 @@ -162,7 +162,7 @@
    1.22      /// \pre \ref run() must be called before using this function.
    1.23      Cost totalCost() const {
    1.24        Cost c = 0;
    1.25 -      for (typename Graph::EdgeIt e(graph); e != INVALID; ++e)
    1.26 +      for (typename Graph::EdgeIt e(_graph); e != INVALID; ++e)
    1.27          c += _flow[e] * _cost[e];
    1.28        return c;
    1.29      }