1.1 --- a/lemon/fib_heap.h	Wed Jul 08 17:22:36 2009 +0200
     1.2 +++ b/lemon/fib_heap.h	Wed Jul 08 17:47:01 2009 +0200
     1.3 @@ -188,7 +188,7 @@
     1.4        if ( _data[_minimum].left_neighbor==_minimum ) {
     1.5          _data[_minimum].in=false;
     1.6          if ( _data[_minimum].degree!=0 ) {
     1.7 -          makeroot(_data[_minimum].child);
     1.8 +          makeRoot(_data[_minimum].child);
     1.9            _minimum=_data[_minimum].child;
    1.10            balance();
    1.11          }
    1.12 @@ -201,7 +201,7 @@
    1.13            int child=_data[_minimum].child;
    1.14            int last_child=_data[child].left_neighbor;
    1.15  
    1.16 -          makeroot(child);
    1.17 +          makeRoot(child);
    1.18  
    1.19            _data[left].right_neighbor=child;
    1.20            _data[child].left_neighbor=left;
    1.21 @@ -372,7 +372,7 @@
    1.22        } while ( s != m );
    1.23      }
    1.24  
    1.25 -    void makeroot(int c) {
    1.26 +    void makeRoot(int c) {
    1.27        int s=c;
    1.28        do {
    1.29          _data[s].parent=-1;