COIN-OR::LEMON - Graph Library

Changeset 956:141f9c0db4a3 in lemon for lemon/binomial_heap.h


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/binomial_heap.h

    r929 r956  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    259259      int p=_data[i].parent;
    260260      _data[i].prio=value;
    261      
     261
    262262      while( p!=-1 && _comp(value, _data[p].prio) ) {
    263263        _data[i].name=_data[p].name;
     
    323323
    324324  private:
    325    
     325
    326326    // Find the minimum of the roots
    327327    int findMin() {
     
    351351      }
    352352      if( _data[_head].right_neighbor==-1 ) return;
    353      
     353
    354354      int x=_head;
    355355      int x_prev=-1, x_next=_data[x].right_neighbor;
     
    385385      int curr=_data.size();
    386386      _data.push_back(Store());
    387      
     387
    388388      while( p!=-1 || q!=-1 ) {
    389389        if( q==-1 || ( p!=-1 && _data[p].degree<_data[q].degree ) ) {
     
    398398        }
    399399      }
    400      
     400
    401401      _head=_data.back().right_neighbor;
    402402      _data.pop_back();
Note: See TracChangeset for help on using the changeset viewer.