COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
03/06/10 15:35:12 (10 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Children:
957:f802439d2b58, 959:38213abd2911, 1041:f112c18bc304
Phase:
public
Message:

Unify the sources (#339)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/capacity_scaling.h

    r941 r956  
    1 /* -*- C++ -*-
     1/* -*- mode: C++; indent-tabs-mode: nil; -*-
    22 *
    3  * This file is a part of LEMON, a generic C++ optimization library
     3 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    134134      UNBOUNDED
    135135    };
    136  
     136
    137137  private:
    138138
     
    185185
    186186  public:
    187  
     187
    188188    /// \brief Constant for infinite upper bounds (capacities).
    189189    ///
     
    212212      CostVector &_pi;
    213213      IntVector &_pred;
    214      
     214
    215215      IntVector _proc_nodes;
    216216      CostVector _dist;
    217      
     217
    218218    public:
    219219
     
    440440      return *this;
    441441    }
    442    
     442
    443443    /// @}
    444444
     
    576576      _cost.resize(_res_arc_num);
    577577      _supply.resize(_node_num);
    578      
     578
    579579      _res_cap.resize(_res_arc_num);
    580580      _pi.resize(_node_num);
     
    620620        _reverse[bi] = fi;
    621621      }
    622      
     622
    623623      // Reset parameters
    624624      resetParams();
     
    729729      }
    730730      if (_sum_supply > 0) return INFEASIBLE;
    731      
     731
    732732      // Initialize vectors
    733733      for (int i = 0; i != _root; ++i) {
     
    777777        }
    778778      }
    779      
     779
    780780      // Handle GEQ supply type
    781781      if (_sum_supply < 0) {
     
    845845        for (int i = 0; i != _node_num; ++i) {
    846846          _pi[i] -= pr;
    847         }       
    848       }
    849      
     847        }
     848      }
     849
    850850      return pt;
    851851    }
Note: See TracChangeset for help on using the changeset viewer.