#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_with_min();
- void update_work_lengths();
- void force_positive_work_lengths();
+ void initialize_positivized_lengths_with_min();
+ void update_positivized_lengths();
+ void force_positivized_lengths();
void find_shortest_path(Vertex **front, Vertex **new_front);
+ int retrieve_one_path(Edge *e, int *nodes);
Vertex **_front, **_new_front;
public:
+ // 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