// the total correction when compiled in VERBOSE mode.
void force_positivized_lengths();
- 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();
+ // distance from the source
+ void dp_compute_distances();
// Set in every vertex pred_edge_toward_source correspondingly to
// the path of shortest length. The current implementation is
// Set the distance_from_source fields to the number of DP
// iterations needed to update it. Abort if the graph is not a DAG.
- int compute_dp_distances();
+ int compute_dp_ranks();
int _nb_vertices, _nb_edges;
Vertex *_source, *_sink;