// the total correction when compiled in VERBOSE mode.
void force_positivized_lengths();
- // Set the edge pred_edge_toward_source correspondingly to the path
- // of shortest length. The current implementation is not Dijkstra's!
+ // Set in every vertex pred_edge_toward_source correspondingly to
+ // the path of shortest length. The current implementation is not
+ // Dijkstra's!
void find_shortest_path();
// Follows the path starting on edge e and returns the number of