class Vertex;
class Edge;
+class Path {
+public:
+ int starting_time;
+ int duration;
+ int *nodes;
+};
+
class MTPGraph {
void initialize_positivized_lengths_with_min();
void update_positivized_lengths();
public:
+ 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 retrieve_paths();
+
void print();
void print_dot();
};