// nodes met along the path, and computes path->length properly.
int retrieve_one_path(Edge *e, Path *path);
- // Returns if the graph is a DAG, and set the last_change field of
- // each vertex to the maximum number of iterations required to reach
- // it
- int check_DAG_and_set_last_change();
+ // 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 _nb_vertices, _nb_edges;
Vertex *_source, *_sink;