1.1 --- a/src/lemon/min_cost_flow.h	Sat Nov 13 12:53:28 2004 +0000
     1.2 +++ b/src/lemon/min_cost_flow.h	Sat Nov 13 17:07:10 2004 +0000
     1.3 @@ -59,10 +59,10 @@
     1.4    template <typename Graph, typename LengthMap, typename CapacityMap>
     1.5    class MinCostFlow {
     1.6  
     1.7 -    typedef typename LengthMap::ValueType Length;
     1.8 +    typedef typename LengthMap::Value Length;
     1.9  
    1.10      //Warning: this should be integer type
    1.11 -    typedef typename CapacityMap::ValueType Capacity;
    1.12 +    typedef typename CapacityMap::Value Capacity;
    1.13      
    1.14      typedef typename Graph::Node Node;
    1.15      typedef typename Graph::NodeIt NodeIt;
    1.16 @@ -94,14 +94,14 @@
    1.17        const LengthMap &length;
    1.18        const NodeMap &pot;
    1.19      public :
    1.20 -      typedef typename LengthMap::KeyType KeyType;
    1.21 -      typedef typename LengthMap::ValueType ValueType;
    1.22 +      typedef typename LengthMap::Key Key;
    1.23 +      typedef typename LengthMap::Value Value;
    1.24  
    1.25        ModLengthMap(const ResGW& _g, 
    1.26  		   const LengthMap &_length, const NodeMap &_pot) : 
    1.27  	g(_g), /*rev(_rev),*/ length(_length), pot(_pot) { }
    1.28  	
    1.29 -      ValueType operator[](typename ResGW::Edge e) const {     
    1.30 +      Value operator[](typename ResGW::Edge e) const {     
    1.31  	if (g.forward(e))
    1.32  	  return  length[e]-(pot[g.target(e)]-pot[g.source(e)]);   
    1.33  	else