Changeset 2533:aea952a1af99 in lemon0.x
 Timestamp:
 12/05/07 02:43:02 (12 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3410
 Location:
 lemon
 Files:

 6 edited
Legend:
 Unmodified
 Added
 Removed

lemon/capacity_scaling.h
r2509 r2533 67 67 /// \author Peter Kovacs 68 68 69 template < typename Graph,70 typename LowerMap = typename Graph::template EdgeMap<int>,71 typename CapacityMap = LowerMap,72 typename CostMap = typename Graph::template EdgeMap<int>,73 typename SupplyMap = typename Graph::template NodeMap74 <typename CapacityMap::Value> >69 template < typename Graph, 70 typename LowerMap = typename Graph::template EdgeMap<int>, 71 typename CapacityMap = LowerMap, 72 typename CostMap = typename Graph::template EdgeMap<int>, 73 typename SupplyMap = typename Graph::template NodeMap 74 <typename CapacityMap::Value> > 75 75 class CapacityScaling 76 76 { … … 639 639 } 640 640 #ifdef _DEBUG_ITER_ 641 std::cout << "C ostScaling algorithm finished with running Dijkstra algorithm "641 std::cout << "Capacity Scaling algorithm finished with running Dijkstra algorithm " 642 642 << dijk_num << " times." << std::endl; 643 643 #endif 
lemon/circulation.h
r2527 r2533 374 374 } 375 375 376 /// \name Execution control The simplest way to execute the377 /// algorithm is to use one of the member functions called \c378 /// run().376 /// \name Execution control 377 /// The simplest way to execute the algorithm is to use one of the 378 /// member functions called \c run(). 379 379 /// \n 380 380 /// If you need more control on initial solution or execution then 
lemon/cycle_canceling.h
r2526 r2533 87 87 /// \author Peter Kovacs 88 88 89 template < typename Graph,90 91 92 93 94 89 template < typename Graph, 90 typename LowerMap = typename Graph::template EdgeMap<int>, 91 typename CapacityMap = LowerMap, 92 typename CostMap = typename Graph::template EdgeMap<int>, 93 typename SupplyMap = typename Graph::template NodeMap 94 <typename CapacityMap::Value> > 95 95 class CycleCanceling 96 96 { … … 324 324 325 325 // Finding a feasible flow 326 Circulation< Graph, C apacity, ConstMap<Edge, Capacity>,327 CapacityRefMap, SupplyMap >::DefFlowMap<FlowMap>::Create328 circulation( graph, constMap<Edge>((Capacity)0), 329 capacity, supply);330 circulation.flowMap(flow Map);331 return circulation.run() ;326 Circulation< Graph, ConstMap<Edge, Capacity>, CapacityRefMap, 327 SupplyMap > 328 circulation( graph, constMap<Edge>((Capacity)0), capacity, 329 supply ); 330 circulation.flowMap(flow); 331 return circulation.run() == 1; 332 332 } 333 333 
lemon/min_cost_flow.h
r2509 r2533 64 64 /// \author Peter Kovacs 65 65 66 template < typename Graph,67 68 69 70 71 66 template < typename Graph, 67 typename LowerMap = typename Graph::template EdgeMap<int>, 68 typename CapacityMap = LowerMap, 69 typename CostMap = typename Graph::template EdgeMap<int>, 70 typename SupplyMap = typename Graph::template NodeMap 71 <typename CapacityMap::Value> > 72 72 class MinCostFlow : 73 73 public NetworkSimplex< Graph, 
lemon/min_cost_max_flow.h
r2515 r2533 58 58 /// \author Peter Kovacs 59 59 60 template < typename Graph,61 typename CapacityMap = typename Graph::template EdgeMap<int>,62 typename CostMap = typename Graph::template EdgeMap<int> >60 template < typename Graph, 61 typename CapacityMap = typename Graph::template EdgeMap<int>, 62 typename CostMap = typename Graph::template EdgeMap<int> > 63 63 class MinCostMaxFlow 64 64 { 
lemon/network_simplex.h
r2509 r2533 94 94 /// \author Peter Kovacs 95 95 96 template < typename Graph,97 98 99 100 101 96 template < typename Graph, 97 typename LowerMap = typename Graph::template EdgeMap<int>, 98 typename CapacityMap = LowerMap, 99 typename CostMap = typename Graph::template EdgeMap<int>, 100 typename SupplyMap = typename Graph::template NodeMap 101 <typename CapacityMap::Value> > 102 102 class NetworkSimplex 103 103 {
Note: See TracChangeset
for help on using the changeset viewer.