#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 Path {
-public:
- Path(int l);
- ~Path();
- int length;
- int *nodes;
-};
-
class MTPGraph {
void initialize_positivized_lengths_with_min();
void update_positivized_lengths();
public:
+ // These variables are filled when retrieve_disjoint_paths is called
int nb_paths;
Path **paths;
~MTPGraph();
- void find_best_paths(scalar_t *lengths, int *result_edge_occupation);
- void retrieve_paths();
+ void find_best_paths(scalar_t *lengths);
+ void retrieve_disjoint_paths();
- void print();
- void print_dot();
+ void print(ostream *os);
+ void print_dot(ostream *os);
};
#endif