- for(int f = 0; f < _front_size; f++) {
- v = _front[f];
- for(Edge *e = v->root_edge; e; e = e->next) {
- d = v->distance_from_source + e->work_length;
- tv = e->terminal_vertex;
- if(d < tv->distance_from_source) {
- tv->distance_from_source = d;
- tv->pred_vertex = v;
- tv->pred_edge = e;
- if(tv->iteration < iteration) {
- _new_front[_new_front_size++] = tv;
- tv->iteration = iteration;
- }
- }
+ } while(nb_active < pred_nb_active);
+
+ delete[] active;
+
+ return nb_active == 0;
+}
+
+void MTPGraph::decrease_distance_in_heap(Vertex *v) {
+ Vertex **p, **h;
+ // There is some beauty in that
+ h = v->heap_slot;
+ while(h > _heap &&
+ (p = _heap + (h - _heap + 1) / 2 - 1,
+ (*p)->distance_from_source > (*h)->distance_from_source)) {
+ swap(*p, *h);
+ swap((*p)->heap_slot, (*h)->heap_slot);
+ h = p;
+ }
+}
+
+void MTPGraph::increase_distance_in_heap(Vertex *v) {
+ Vertex **c1, **c2, **h;
+ // There is some beauty in that
+ h = v->heap_slot;
+ while(c1 = _heap + 2 * (h - _heap + 1) - 1, c2 = c1 + 1,
+ (c1 < _heap + _heap_size && (*c1)->distance_from_source < (*h)->distance_from_source)
+ ||
+ (c2 < _heap + _heap_size && (*c2)->distance_from_source < (*h)->distance_from_source)
+ ) {
+ if(c1 < _heap + _heap_size &&
+ !(c2 < _heap + _heap_size && (*c2)->distance_from_source < (*c1)->distance_from_source)){
+ swap(*c1, *h);
+ swap((*c1)->heap_slot, (*h)->heap_slot);
+ h = c1;
+ } else {
+ swap(*c2, *h);
+ swap((*c2)->heap_slot, (*h)->heap_slot);
+ h = c2;
+ }
+ }
+}
+
+void MTPGraph::dp_distance_propagation() {
+ Vertex *v, *tv;
+ Edge *e;
+ scalar_t d;
+
+ for(int k = 0; k < _nb_vertices; k++) {
+ _vertices[k].distance_from_source = FLT_MAX;
+ _vertices[k].pred_edge_toward_source = 0;
+ }
+
+ _source->distance_from_source = 0;
+
+ for(int k = 0; k < _nb_vertices; k++) {
+ v = _dp_order[k];
+ 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) {
+ tv->distance_from_source = d;
+ tv->pred_edge_toward_source = e;
+ decrease_distance_in_heap(tv);