#include <iostream>
#include <float.h>
+#include <stdlib.h>
using namespace std;
//////////////////////////////////////////////////////////////////////
+Path::Path(int l) {
+ length = l;
+ nodes = new int[length];
+}
+
+Path::~Path() {
+ delete[] nodes;
+}
+
+//////////////////////////////////////////////////////////////////////
+
MTPGraph::MTPGraph(int nb_vertices, int nb_edges,
int *from, int *to,
int source, int sink) {
} 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;
}
}
-void MTPGraph::retrieve_paths() {
+int MTPGraph::retrieve_one_path(Edge *e, int *nodes) {
+ Edge *f, *next;
+ 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 << "Non-sink path end point?!" << endl;
+ abort();
+ }
+ if(nb_choices > 1) {
+ cerr << "Non node-disjoint path, can not retrieve." << 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];
int p = 0;
for(e = _source->leaving_edges; e; e = e->next_leaving_edge) {
if(e->occupied) {
- paths[p] = new Path();
+ int l = retrieve_one_path(e, 0);
+ paths[p] = new Path(l);
+ retrieve_one_path(e, paths[p]->nodes);
p++;
}
}
-
- cout << "NB_PATHS " << nb_paths << endl;
}