lemon-0.x: comparison lemon/capacity

equal deleted inserted replaced

-:03ce9e455775
+:d3a88fa60e48
 ///	\c CapacityMap::Value and \c CapacityMap::Value must be
 ///	convertible to \c SupplyMap::Value.
 ///
 /// \author Peter Kovacs
 template < typename Graph,
-	   typename LowerMap = typename Graph::template EdgeMap<int>,
+	     typename LowerMap = typename Graph::template EdgeMap<int>,
-	   typename CapacityMap = LowerMap,
+	     typename CapacityMap = LowerMap,
-	   typename CostMap = typename Graph::template EdgeMap<int>,
+	     typename CostMap = typename Graph::template EdgeMap<int>,
-	   typename SupplyMap = typename Graph::template NodeMap
+	     typename SupplyMap = typename Graph::template NodeMap
-				<typename CapacityMap::Value> >
+				  <typename CapacityMap::Value> >
 class CapacityScaling
 {
 typedef typename Graph::Node Node;
 typedef typename Graph::NodeIt NodeIt;
 typedef typename Graph::Edge Edge;
 	  imbalance[t] += d;
 	  if (imbalance[s] < delta) ++next_node;
 	}
 }
 #ifdef _DEBUG_ITER_
-std::cout << "Cost Scaling algorithm finished with running Dijkstra algorithm "
+std::cout << "Capacity Scaling algorithm finished with running Dijkstra algorithm "
 	<< dijk_num << " times." << std::endl;
 #endif
 // Handling nonzero lower bounds
 if (lower) {