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();
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:
+ 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 find_best_paths(scalar_t *lengths);
+ void retrieve_disjoint_paths();
+
void print();
void print_dot();
};