}
}
-// Finds the shortest path in the graph and return in
-// result_edge_back, for each vertex the edge to follow back from it
+// Finds the shortest path in the graph and returns in
+// result_edge_back, for each vertex, the edge to follow back from it
// to reach the source with the shortest path, and in result_dist the
// distance to the source. The edge lengths have to be positive.
void find_shortest(int nb_vertices,