class MTPGraph {
void update_positivized_lengths();
void force_positivized_lengths();
+ // Set the edge pred_edge_toward_source correspondingly to the path
+ // of shortest length.
void find_shortest_path();
- // Retrieve the path starting on edge e and return its length. If
- // nodes is non-null, stores the node met along the path in it.
- int retrieve_one_path(Edge *e, int *nodes);
+ // Follows the path starting on edge e and returns its length. If
+ // nodes is non-null, stores in it the nodes met along the path.
+ int retrieve_one_path(Edge *e, Path *path);
Vertex **_front, **_new_front;