COIN-OR::LEMON - Graph Library

Changeset 2033:7bf1f64962c2 in lemon-0.x


Ignore:
Timestamp:
04/03/06 18:05:26 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2672
Message:

Small corrections

Location:
lemon
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • lemon/bfs.h

    r1993 r2033  
    282282    struct DefProcessedMapTraits : public Traits {
    283283      typedef T ProcessedMap;
    284       static ProcessedMap *createProcessedMap(const Graph &G)
     284      static ProcessedMap *createProcessedMap(const Graph &)
    285285      {
    286286        throw UninitializedParameter();
  • lemon/preflow.h

    r2024 r2033  
    160160    ///calling \ref source, \ref target, \ref capacityMap and \ref
    161161    ///flowMap, resp.
    162       Preflow(const Graph& _gr, Node _s, Node _t,
    163               const CapacityMap& _cap, FlowMap& _f,
    164               const Tolerance &_sr=Tolerance()) :
     162    Preflow(const Graph& _gr, Node _s, Node _t,
     163            const CapacityMap& _cap, FlowMap& _f,
     164            const Tolerance &_sr=Tolerance()) :
    165165        _g(&_gr), _source(_s), _target(_t), _capacity(&_cap),
    166166        _flow(&_f), _surely(_sr),
     
    169169        if ( _source==_target )
    170170          throw InvalidArgument();
    171       }
     171    }
    172172   
    173173    ///Give a reference to the tolerance handler class
  • lemon/radix_sort.h

    r1979 r2033  
    326326
    327327    int length = std::distance(first, last);
    328     Key* buffer;
    329     buffer = allocator.allocate(2 * length);
     328    Key* buffer = allocator.allocate(2 * length);
    330329    try {
    331330      bool dir = true;
     
    365364
    366365    int length = std::distance(first, last);
    367     Key *buffer;
    368     buffer = allocator.allocate(2 * length);
     366    Key *buffer = allocator.allocate(2 * length);
    369367    try {
    370368      bool dir = true;
     
    372370      for (int i = 0; i < (int)sizeof(Value); ++i) {
    373371        if (dir) {
    374           counterIntroSort(buffer, buffer + length, buffer + length, i, functor);
     372          counterIntroSort(buffer, buffer + length,
     373                           buffer + length, i, functor);
    375374        } else {
    376           counterIntroSort(buffer + length, buffer + 2 * length, buffer, i, functor);
     375          counterIntroSort(buffer + length, buffer + 2 * length,
     376                           buffer, i, functor);
    377377        }
    378378        dir = !dir;
Note: See TracChangeset for help on using the changeset viewer.