- // Set the edge pred_edge_toward_source correspondingly to the path
- // of shortest length. The current implementation is not Dijkstra's!
+
+ void decrease_distance_in_heap(Vertex *v);
+ void increase_distance_in_heap(Vertex *v);
+
+ // Visit the vertices according to _dp_order and simply update their
+ // distance to the source
+ void dp_distance_propagation();
+
+ // Set in every vertex pred_edge_toward_source correspondingly to
+ // the path of shortest length. The current implementation is
+ // Dijkstra with a Binary Heap (and not with Fibonnaci heap (yet))