} while(_front_size > 0);
}
-void MTPGraph::find_best_paths(scalar_t *lengths, int *result_edge_occupation) {
+void MTPGraph::find_best_paths(scalar_t *lengths) {
scalar_t total_length;
Vertex *v;
Edge *e;
for(int k = 0; k < _nb_edges; k++) {
Edge *e = _edges + k;
if(e->occupied) { e->revert(); }
- result_edge_occupation[k] = e->occupied;
}
}
-
int MTPGraph::retrieve_one_path(Edge *e, int *nodes) {
Edge *f, *next;
int l = 0;
return l;
}
-void MTPGraph::retrieve_paths() {
+void MTPGraph::retrieve_disjoint_paths() {
Edge *e;
for(int p = 0; p < nb_paths; p++) delete paths[p];
p++;
}
}
-
- cout << "NB_PATHS " << nb_paths << endl;
}