X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?p=mtp.git;a=blobdiff_plain;f=mtp_graph.h;h=5842671223347d25a924141723be11f63942f2e9;hp=f28e460be9ef99b9b9fdca50363fc36e6a0d4cab;hb=2b3a2e10ec226f1610b9c39abd20f0899a34a652;hpb=6c727bc27f1b594b5f3e5a756a0a01c3cb9b1cec

diff --git a/mtp_graph.h b/mtp_graph.h
index f28e460..5842671 100644
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -49,6 +49,13 @@ class MTPGraph {
   // the total correction when compiled in VERBOSE mode.
   void force_positivized_lengths();
 
+  void decrease_distance_in_heap(Vertex *v);
+  void increase_distance_in_heap(Vertex *v);
+
+  // Visit the vertices according to _dp_order and simply update their
+  // distance to the source
+  void dp_distance_propagation();
+
   // Set in every vertex pred_edge_toward_source correspondingly to
   // the path of shortest length. The current implementation is not
   // Dijkstra's!
@@ -59,17 +66,24 @@ class MTPGraph {
   // nodes met along the path, and computes path->length properly.
   int retrieve_one_path(Edge *e, Path *path);
 
-  // Returns if the graph is a DAG
+  // Returns if the graph is a DAG, and set the last_change field of
+  // each vertex to the maximum number of iterations required to reach
+  // it
   int is_dag();
 
-  Vertex **_front, **_new_front;
-
   int _nb_vertices, _nb_edges;
   Vertex *_source, *_sink;
 
   Edge *_edges;
   Vertex *_vertices;
 
+  // For the shortest path search
+
+  Vertex **_heap;
+  int _heap_size;
+
+  Vertex **_dp_order;
+
 public:
 
   // These variables are filled when retrieve_disjoint_paths is called