class Edge;
class MTPGraph {
- void initialize_positivized_lengths_with_min();
void update_positivized_lengths();
void force_positivized_lengths();
- void find_shortest_path(Vertex **front, Vertex **new_front);
+ 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);
Vertex **_front, **_new_front;