X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp_graph.h;h=ae0003ae8db2153b2a716cc5de638b1f43cbedf9;hb=490e09a973f2a1f6e8d28f381f858c8e29a541f5;hp=5feb20f33d4082e156a0af0346f797e4d776f56a;hpb=8946d0df4263aa20a670cedd5d61f9709b858fca;p=mtp.git

diff --git a/mtp_graph.h b/mtp_graph.h
index 5feb20f..ae0003a 100644
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -19,25 +19,26 @@
 #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();
   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;
 
@@ -49,6 +50,7 @@ class MTPGraph {
 
 public:
 
+  // These variables are filled when retrieve_disjoint_paths is called
   int nb_paths;
   Path **paths;
 
@@ -60,8 +62,8 @@ public:
   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