- tmp_front_size = new_front_size;
- new_front_size = front_size;
- front_size = tmp_front_size;
- } while(front_size > 0);
+ do {
+ // Get the closest to the source
+ v = _heap[0];
+
+ // Remove it from the heap (swap it with the last in the heap, and
+ // update the distance of that one)
+ _heap_size--;
+ a = _heap;
+ b = _heap + _heap_size;
+ swap(*a, *b); swap((*a)->heap_position, (*b)->heap_position);
+ increase_distance_in_heap(_heap[0]);
+
+ // Now update the neighbors of the currently closest to the source
+ for(e = v->leaving_edges; e; e = e->next_leaving_edge) {
+ d = v->distance_from_source + e->positivized_length;
+ tv = e->terminal_vertex;
+ if(d < tv->distance_from_source) {
+ ASSERT(tv->heap_position - _heap < _heap_size);
+ tv->distance_from_source = d;
+ tv->pred_edge_toward_source = e;
+ decrease_distance_in_heap(tv);
+ }
+ }
+ } while(_heap_size > 0);