// Follows the path starting on edge e and returns the number of
// nodes to reach the sink. If path is non-null, stores in it the
// nodes met along the path, and computes path->length properly.
- int retrieve_one_path(Edge *e, Path *path);
+ int retrieve_one_path(Edge *e, Path *path, int *used_edges);
int _nb_vertices, _nb_edges;
Vertex *_source, *_sink;
void find_best_paths(scalar_t *lengths);
// Retrieve the paths corresponding to the occupied edges, and save
- // the result in the nb_paths and paths fields.
+ // the result in the nb_paths and paths fields. If the paths are not
+ // node-disjoint, there are multiple families of paths that
+ // "explain" the edge occupancies, and this method picks one of them
+ // arbitrarily.
void retrieve_disjoint_paths();
void print(ostream *os);