1.1 --- a/lemon/capacity_scaling.h	Tue Dec 04 18:51:35 2007 +0000
     1.2 +++ b/lemon/capacity_scaling.h	Wed Dec 05 01:43:02 2007 +0000
     1.3 @@ -66,12 +66,12 @@
     1.4    ///
     1.5    /// \author Peter Kovacs
     1.6  
     1.7 -template < typename Graph,
     1.8 -	   typename LowerMap = typename Graph::template EdgeMap<int>,
     1.9 -	   typename CapacityMap = LowerMap,
    1.10 -	   typename CostMap = typename Graph::template EdgeMap<int>,
    1.11 -	   typename SupplyMap = typename Graph::template NodeMap
    1.12 -				<typename CapacityMap::Value> >
    1.13 +  template < typename Graph,
    1.14 +	     typename LowerMap = typename Graph::template EdgeMap<int>,
    1.15 +	     typename CapacityMap = LowerMap,
    1.16 +	     typename CostMap = typename Graph::template EdgeMap<int>,
    1.17 +	     typename SupplyMap = typename Graph::template NodeMap
    1.18 +				  <typename CapacityMap::Value> >
    1.19    class CapacityScaling
    1.20    {
    1.21      typedef typename Graph::Node Node;
    1.22 @@ -638,7 +638,7 @@
    1.23  	}
    1.24        }
    1.25  #ifdef _DEBUG_ITER_
    1.26 -      std::cout << "Cost Scaling algorithm finished with running Dijkstra algorithm "
    1.27 +      std::cout << "Capacity Scaling algorithm finished with running Dijkstra algorithm "
    1.28  	<< dijk_num << " times." << std::endl;
    1.29  #endif
    1.30