+ if(e->occupied) { e->invert(); }
+ }
+}
+
+int MTPGraph::retrieve_one_path(Edge *e, int *nodes) {
+ Edge *f, *next = 0;
+ int l = 0;
+
+ if(nodes) { nodes[l++] = e->origin_vertex->id; }
+ else l++;
+
+ while(e->terminal_vertex != _sink) {
+ if(nodes) { nodes[l++] = e->terminal_vertex->id; }
+ else l++;
+ int nb_choices = 0;
+ for(f = e->terminal_vertex->leaving_edges; f; f = f->next_leaving_edge) {
+ if(f->occupied) { nb_choices++; next = f; }
+ if(nb_choices == 0) {
+ cerr << "retrieve_one_path: Non-sink end point." << endl;
+ abort();
+ }
+ if(nb_choices > 1) {
+ cerr << "retrieve_one_path: Non node-disjoint paths." << endl;
+ abort();
+ }
+ }
+ e = next;
+ }
+
+ if(nodes) { nodes[l++] = e->terminal_vertex->id; }
+ else l++;
+
+ return l;
+}
+
+void MTPGraph::retrieve_disjoint_paths() {
+ Edge *e;
+
+ for(int p = 0; p < nb_paths; p++) delete paths[p];
+ delete[] paths;
+
+ nb_paths = 0;
+ for(e = _source->leaving_edges; e; e = e->next_leaving_edge) {
+ if(e->occupied) { nb_paths++; }
+ }
+
+ paths = new Path *[nb_paths];
+
+ int p = 0;
+ for(e = _source->leaving_edges; e; e = e->next_leaving_edge) {
+ if(e->occupied) {
+ int l = retrieve_one_path(e, 0);
+ paths[p] = new Path(l);
+ retrieve_one_path(e, paths[p]->nodes);
+ p++;
+ }