COIN-OR::LEMON - Graph Library

Changeset 2507:6520edb2c3f3 in lemon-0.x for lemon


Ignore:
Timestamp:
11/07/07 22:52:57 (12 years ago)
Author:
Peter Kovacs
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3361
Message:

Small bug fix.

Location:
lemon
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • lemon/capacity_scaling.h

    r2471 r2507  
    365365        for (OutEdgeIt e(graph, n); e != INVALID; ++e)
    366366          s -= _lower[e];
    367         supply[n] = imbalance[n] = s;
     367        supply[n] = s;
    368368        sum += s;
    369369      }
     
    446446        for (OutEdgeIt e(graph, n); e != INVALID; ++e)
    447447          s -= _lower[e];
    448         supply[n] = imbalance[n] = s;
     448        supply[n] = s;
    449449      }
    450450      valid_supply = true;
     
    534534    bool init() {
    535535      if (!valid_supply) return false;
     536      imbalance = supply;
    536537
    537538      // Initalizing Dijkstra class
  • lemon/min_cost_max_flow.h

    r2440 r2507  
    7676    /// \brief The type of the flow map.
    7777    typedef typename Graph::template EdgeMap<Capacity> FlowMap;
     78    typedef typename CostMap::Value Cost;
    7879
    7980  private:
     
    134135    Cost totalCost() const {
    135136      Cost c = 0;
    136       for (EdgeIt e(graph); e != INVALID; ++e)
     137      for (typename Graph::EdgeIt e(graph); e != INVALID; ++e)
    137138        c += flow[e] * cost[e];
    138139      return c;
Note: See TracChangeset for help on using the changeset viewer.