#include "mtp_graph.h"
-// #include <iostream>
#include <float.h>
using namespace std;
class Edge {
public:
- int id, occupied;
+ int occupied;
scalar_t length, positivized_length;
Vertex *origin_vertex, *terminal_vertex;
- // These are the links in the origin_vertex leaving edge list
+ // These fields are used for the linked list of a vertex's leaving
+ // edge list. We have to do insertions / deletions.
Edge *next_leaving_edge, *pred_leaving_edge;
inline void invert();
class Vertex {
public:
- int id;
Edge *leaving_edges;
scalar_t distance_from_source;
Edge *pred_edge_toward_source;
_source = &_vertices[source];
_sink = &_vertices[sink];
- for(int k = 0; k < _nb_vertices; k++) {
- _vertices[k].id = k;
- }
-
for(int e = 0; e < nb_edges; e++) {
_vertices[vertex_from[e]].add_leaving_edge(_edges + e);
_edges[e].occupied = 0;
- _edges[e].id = e;
_edges[e].origin_vertex = _vertices + vertex_from[e];
_edges[e].terminal_vertex = _vertices + vertex_to[e];
}
void MTPGraph::print(ostream *os) {
for(int k = 0; k < _nb_edges; k++) {
Edge *e = _edges + k;
- (*os) << e->origin_vertex->id
+ (*os) << e->origin_vertex - _vertices
<< " -> "
- << e->terminal_vertex->id
+ << e->terminal_vertex - _vertices
<< " "
<< e->length;
if(e->occupied) {
(*os) << " rankdir=\"LR\";" << endl;
(*os) << " node [shape=circle,width=0.75,fixedsize=true];" << endl;
(*os) << " edge [color=gray,arrowhead=open]" << endl;
- (*os) << " " << _source->id << " [peripheries=2];" << endl;
- (*os) << " " << _sink->id << " [peripheries=2];" << endl;
+ (*os) << " " << _source - _vertices << " [peripheries=2];" << endl;
+ (*os) << " " << _sink - _vertices << " [peripheries=2];" << endl;
for(int k = 0; k < _nb_edges; k++) {
Edge *e = _edges + k;
- // (*os) << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
- // << ";"
- // << endl;
- (*os) << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id
+ (*os) << " "
+ << e->origin_vertex - _vertices
+ << " -> "
+ << e->terminal_vertex - _vertices
<< " [";
if(e->occupied) {
(*os) << "style=bold,color=black,";
int front_size = _nb_vertices, pred_front_size;
do {
- // We set the iteration field of all vertex with incoming edges to
- // the current iteration value
+ // We set the last_change field of all the vertices with incoming
+ // edges to the current iteration value
for(int f = 0; f < front_size; f++) {
v = _front[f];
for(e = v->leaving_edges; e; e = e->next_leaving_edge) {
pred_front_size = front_size;
front_size = 0;
- // We remove all the vertices without incoming edge
+ // We keep all the vertices with incoming nodes
for(int f = 0; f < pred_front_size; f++) {
v = _front[f];
if(v->last_change == iteration) {
}
// This method does not change the edge occupation. It only set
-// properly for every vertex the fields distance_from_source and
+// properly, for every vertex, the fields distance_from_source and
// pred_edge_toward_source.
void MTPGraph::find_shortest_path() {
// Put back the graph in its original state (i.e. invert edges which
// have been inverted in the process)
for(int k = 0; k < _nb_edges; k++) {
- Edge *e = _edges + k;
+ e = _edges + k;
if(e->occupied) { e->invert(); }
}
}
int MTPGraph::retrieve_one_path(Edge *e, Path *path) {
Edge *f, *next = 0;
- int l = 0;
+ int l = 0, nb_occupied_next;
if(path) {
- path->nodes[l++] = e->origin_vertex->id;
+ path->nodes[l++] = e->origin_vertex - _vertices;
path->length = e->length;
} else l++;
while(e->terminal_vertex != _sink) {
if(path) {
- path->nodes[l++] = e->terminal_vertex->id;
+ path->nodes[l++] = e->terminal_vertex - _vertices;
path->length += e->length;
} else l++;
- int nb_choices = 0;
+
+ nb_occupied_next = 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();
- }
+ if(f->occupied) { nb_occupied_next++; next = f; }
+ }
+
+#ifdef DEBUG
+ if(nb_occupied_next == 0) {
+ cerr << "retrieve_one_path: Non-sink end point." << endl;
+ abort();
}
+
+ else if(nb_occupied_next > 1) {
+ cerr << "retrieve_one_path: Non node-disjoint paths." << endl;
+ abort();
+ }
+#endif
+
e = next;
}
if(path) {
- path->nodes[l++] = e->terminal_vertex->id;
+ path->nodes[l++] = e->terminal_vertex - _vertices;
path->length += e->length;
} else l++;
void MTPGraph::retrieve_disjoint_paths() {
Edge *e;
+ int p, l;
for(int p = 0; p < nb_paths; p++) delete paths[p];
delete[] paths;
paths = new Path *[nb_paths];
- int p = 0;
+ p = 0;
for(e = _source->leaving_edges; e; e = e->next_leaving_edge) {
if(e->occupied) {
- int l = retrieve_one_path(e, 0);
+ l = retrieve_one_path(e, 0);
paths[p] = new Path(l);
retrieve_one_path(e, paths[p]);
p++;