// EXAMPLE: ./mtp ./graph2.txt | dot -T pdf -o- | xpdf -
-// #define VERBOSE
+#define VERBOSE
#include <iostream>
#include <fstream>
Vertex *v, *tv;
scalar_t d;
+#ifdef VERBOSE
+ cout << "find_shortest_path" << endl;
+#endif
+
#ifdef DEBUG
+ scalar_t residual_error = 0.0;
+#endif
for(int n = 0; n < nb_vertices; n++) {
for(Edge *e = vertices[n].root_edge; e; e = e->next) {
if(e->work_length < 0) {
- cerr << "DEBUG error in find_shortest_path: Edge work lengths have to be positive."
- << endl;
- abort();
+#ifdef DEBUG
+ residual_error -= e->work_length;
+#endif
+ e->work_length = 0.0;
}
}
}
+#ifdef DEBUG
+ cout << "DEBUG residual_error " << residual_error << endl;
#endif
for(int v = 0; v < nb_vertices; v++) {
source, sink,
result_edge_occupation);
- dot_print(nb_vertices, nb_edges,
- vertex_from, vertex_to, edge_lengths,
- source, sink,
- result_edge_occupation);
+ // dot_print(nb_vertices, nb_edges,
+ // vertex_from, vertex_to, edge_lengths,
+ // source, sink,
+ // result_edge_occupation);
delete[] result_edge_occupation;
delete[] edge_lengths;