+ // Set the distance_from_source fields to the number of DP
+ // iterations needed to update it. Abort if the graph is not a DAG.
+ void compute_dp_ranks();
+
+ // Uses the estimated vertex distances to the source to make all the
+ // edge lengths positive, resulting in an identical added value to
+ // all the paths from the same initial node to the same final node
+ // (in particular from source to sink)