#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();
void force_positivized_lengths();
- void find_shortest_path(Vertex **front, Vertex **new_front);
- int retrieve_one_path(Edge *e, int *nodes);
+ // 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;
public:
+ // These variables are filled when retrieve_disjoint_paths is called
int nb_paths;
Path **paths;