X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp_graph.h;h=ae0003ae8db2153b2a716cc5de638b1f43cbedf9;hb=b55dae20c1b56dac452dda6ab2831ea6388c079b;hp=072eeeca2decc5408cce45d2cc679bf1064b7213;hpb=0f54e5005de0f05d4bc400f23181301eb40f469e;p=mtp.git

diff --git a/mtp_graph.h b/mtp_graph.h
index 072eeec..ae0003a 100644
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -19,28 +19,51 @@
 #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();
-  void update_work_length();
-  void find_shortest_path(Vertex **front, Vertex **new_front);
+  void update_positivized_lengths();
+  void force_positivized_lengths();
+  // 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;
 
   int _nb_vertices, _nb_edges;
-  Edge *edge_heap;
-  Vertex *vertices;
-  Vertex *source, *sink;
+  Vertex *_source, *_sink;
+
+  Edge *_edges;
+  Vertex *_vertices;
+
 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 find_best_paths(scalar_t *lengths);
+  void retrieve_disjoint_paths();
+
+  void print(ostream *os);
+  void print_dot(ostream *os);
 };
 
 #endif