#include <iostream>
#include <float.h>
+#include <stdlib.h>
using namespace std;
//////////////////////////////////////////////////////////////////////
-void MTPGraph::print() {
- for(int k = 0; k < _nb_edges; k++) {
- Edge *e = _edges + k;
- cout << e->origin_vertex->id
- << " -> "
- << e->terminal_vertex->id
- << " "
- << e->length;
- if(e->occupied) {
- cout << " *";
- }
- cout << endl;
- }
+Path::Path(int l) {
+ length = l;
+ nodes = new int[length];
}
-void MTPGraph::print_dot() {
- cout << "digraph {" << endl;
- cout << " node[shape=circle];" << endl;
- for(int k = 0; k < _nb_edges; k++) {
- Edge *e = _edges + k;
- if(e->occupied) {
- cout << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
- << " [style=bold,color=black,label=\"" << -e->length << "\"];" << endl;
- } else {
- cout << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
- << " [color=gray,label=\"" << e->length << "\"];" << endl;
- }
- }
- cout << "}" << endl;
+Path::~Path() {
+ delete[] nodes;
}
+//////////////////////////////////////////////////////////////////////
+
MTPGraph::MTPGraph(int nb_vertices, int nb_edges,
int *from, int *to,
int source, int sink) {
_edges[e].terminal_vertex = _vertices + to[e];
}
+ paths = 0;
+ nb_paths = 0;
}
MTPGraph::~MTPGraph() {
delete[] _edges;
delete[] _front;
delete[] _new_front;
+ for(int p = 0; p < nb_paths; p++) delete paths[p];
+ delete[] paths;
}
+//////////////////////////////////////////////////////////////////////
+
+void MTPGraph::print() {
+ for(int k = 0; k < _nb_edges; k++) {
+ Edge *e = _edges + k;
+ cout << e->origin_vertex->id
+ << " -> "
+ << e->terminal_vertex->id
+ << " "
+ << e->length;
+ if(e->occupied) {
+ cout << " *";
+ }
+ cout << endl;
+ }
+}
+
+void MTPGraph::print_dot() {
+ cout << "digraph {" << endl;
+ cout << " node[shape=circle];" << endl;
+ for(int k = 0; k < _nb_edges; k++) {
+ Edge *e = _edges + k;
+ if(e->occupied) {
+ cout << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
+ << " [style=bold,color=black,label=\"" << -e->length << "\"];" << endl;
+ } else {
+ cout << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
+ << " [color=gray,label=\"" << e->length << "\"];" << endl;
+ }
+ }
+ cout << "}" << endl;
+}
+
+//////////////////////////////////////////////////////////////////////
+
void MTPGraph::initialize_positivized_lengths_with_min() {
scalar_t length_min = 0;
for(int n = 0; n < _nb_vertices; n++) {
} 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;
+
+ 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];
+ 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++;
+ }
}
}