1.1 --- a/src/work/jacint/dijkstra.h	Sat Mar 20 19:39:42 2004 +0000
     1.2 +++ b/src/work/jacint/dijkstra.h	Sat Mar 20 20:06:23 2004 +0000
     1.3 @@ -80,7 +80,7 @@
     1.4        while ( !heap.empty() ) {
     1.5  	
     1.6  	Node v=heap.top(); 
     1.7 -	T oldvalue=heap[v];
     1.8 +	T oldvalue=heap.get(v);
     1.9  	heap.pop();
    1.10  	distance.set(v, oldvalue);
    1.11  	scanned.set(v,true);
    1.12 @@ -94,7 +94,7 @@
    1.13  	      reach.set(w,true);
    1.14  	      heap.push(w,oldvalue+length[e]); 
    1.15  	      predecessor.set(w,e);
    1.16 -	    } else if ( oldvalue+length[e] < heap[w] ) {
    1.17 +	    } else if ( oldvalue+length[e] < heap.get(w) ) {
    1.18  	      predecessor.set(w,e);
    1.19  	      heap.decrease(w, oldvalue+length[e]); 
    1.20  	    }