COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
08/08/11 12:36:16 (8 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
1.1
Phase:
public
Tags:
r1.1.4
Message:

Unify sources

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/network_simplex.h

    r976 r1081  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2011
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    9696      UNBOUNDED
    9797    };
    98    
     98
    9999    /// \brief Constants for selecting the type of the supply constraints.
    100100    ///
     
    114114      LEQ
    115115    };
    116    
     116
    117117    /// \brief Constants for selecting the pivot rule.
    118118    ///
     
    157157      ALTERING_LIST
    158158    };
    159    
     159
    160160  private:
    161161
     
    224224
    225225  public:
    226  
     226
    227227    /// \brief Constant for infinite upper bounds (capacities).
    228228    ///
     
    645645      LEMON_ASSERT(std::numeric_limits<Cost>::is_signed,
    646646        "The cost type of NetworkSimplex must be signed");
    647        
     647
    648648      // Resize vectors
    649649      _node_num = countNodes(_graph);
     
    685685        if ((i += k) >= _arc_num) i = (i % k) + 1;
    686686      }
    687      
     687
    688688      // Initialize maps
    689689      for (int i = 0; i != _node_num; ++i) {
     
    810810      return *this;
    811811    }
    812    
     812
    813813    /// \brief Set the type of the supply constraints.
    814814    ///
     
    836836    /// This function runs the algorithm.
    837837    /// The paramters can be specified using functions \ref lowerMap(),
    838     /// \ref upperMap(), \ref costMap(), \ref supplyMap(), \ref stSupply(), 
     838    /// \ref upperMap(), \ref costMap(), \ref supplyMap(), \ref stSupply(),
    839839    /// \ref supplyType().
    840840    /// For example,
     
    10551055        _state[i] = STATE_LOWER;
    10561056      }
    1057      
     1057
    10581058      // Set data for the artificial root node
    10591059      _root = _node_num;
     
    12291229      for (int u = second; u != join; u = _parent[u]) {
    12301230        e = _pred[u];
    1231         d = _forward[u] ? 
     1231        d = _forward[u] ?
    12321232          (_cap[e] == INF ? INF : _cap[e] - _flow[e]) : _flow[e];
    12331233        if (d <= delta) {
     
    14361436        }
    14371437      }
    1438      
     1438
    14391439      // Check feasibility
    14401440      for (int e = _search_arc_num; e != _all_arc_num; ++e) {
     
    14531453        }
    14541454      }
    1455      
     1455
    14561456      // Shift potentials to meet the requirements of the GEQ/LEQ type
    14571457      // optimality conditions
Note: See TracChangeset for help on using the changeset viewer.