#ifndef MTP_GRAPH_H
#define MTP_GRAPH_H
+#include <iostream>
+#include <cmath>
+
+using namespace std;
+
#include "misc.h"
+#include "path.h"
class Vertex;
class Edge;
class MTPGraph {
- void initialize_work_lengths();
- void update_work_lengths();
- void force_positive_work_lengths();
- void find_shortest_path(Vertex **front, Vertex **new_front);
+ void update_positivized_lengths();
+ void force_positivized_lengths();
+ // Set the edge pred_edge_toward_source correspondingly to the path
+ // of shortest length.
+ void find_shortest_path();
+ // Follows the path starting on edge e and returns its length. If
+ // nodes is non-null, stores in it the nodes met along the path.
+ int retrieve_one_path(Edge *e, Path *path);
+
+ Vertex **_front, **_new_front;
int _nb_vertices, _nb_edges;
Vertex *_source, *_sink;
- Vertex **_front, **_new_front;
+
+ Edge *_edges;
+ Vertex *_vertices;
+
public:
- Edge *edges;
- Vertex *vertices;
+
+ // These variables are filled when retrieve_disjoint_paths is called
+ int nb_paths;
+ Path **paths;
MTPGraph(int nb_vertices, int nb_edges, int *from, int *to,
int source, int sink);
~MTPGraph();
- void find_best_paths(scalar_t *lengths, int *result_edge_occupation);
- void print();
- void print_dot();
+ void find_best_paths(scalar_t *lengths);
+ void retrieve_disjoint_paths();
+
+ void print(ostream *os);
+ void print_dot(ostream *os);
};
#endif