Changeset 877:141f9c0db4a3 in lemon-main for lemon/binomial_heap.h
- Timestamp:
- 03/06/10 15:35:12 (14 years ago)
- Branch:
- default
- Children:
- 879:38213abd2911, 931:f112c18bc304
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/binomial_heap.h
r855 r877 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-20 095 * Copyright (C) 2003-2010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 259 259 int p=_data[i].parent; 260 260 _data[i].prio=value; 261 261 262 262 while( p!=-1 && _comp(value, _data[p].prio) ) { 263 263 _data[i].name=_data[p].name; … … 323 323 324 324 private: 325 325 326 326 // Find the minimum of the roots 327 327 int findMin() { … … 351 351 } 352 352 if( _data[_head].right_neighbor==-1 ) return; 353 353 354 354 int x=_head; 355 355 int x_prev=-1, x_next=_data[x].right_neighbor; … … 385 385 int curr=_data.size(); 386 386 _data.push_back(Store()); 387 387 388 388 while( p!=-1 || q!=-1 ) { 389 389 if( q==-1 || ( p!=-1 && _data[p].degree<_data[q].degree ) ) { … … 398 398 } 399 399 } 400 400 401 401 _head=_data.back().right_neighbor; 402 402 _data.pop_back();
Note: See TracChangeset
for help on using the changeset viewer.