Cosmetics.

[mtp.git] / mtp_graph.h

diff --git a/mtp_graph.h b/mtp_graph.h
index b07e461..bad0df5 100644 (file)
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -37,22 +37,39 @@ class Vertex;
 class Edge;
 
 class MTPGraph {
+  // Uses the estimated vertex distances to the source to make all the
+  // edge lengths positive, resulting in an identical added value to
+  // all the paths from the same initial node to the same final node
+  // (in particular from source to sink)
   void update_positivized_lengths();
+
   // It may happen that numerical errors in update_positivized_lengths
   // make the resulting lengths negative, albeit very small. The
-  // following method force such length to zero, and print the
-  // correction when compiled in VERBOSE mode.
+  // following method forces all negative lengths to zero, and prints
+  // the total correction when compiled in VERBOSE mode.
   void force_positivized_lengths();
-  // Set the edge pred_edge_toward_source correspondingly to the path
-  // of shortest length. The current implementation is not Dijkstra's!
+
+  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
+  // Dijkstra with a Binary Heap (and not with Fibonnaci heap (yet))
   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.
+
+  // Follows the path starting on edge e and returns the number of
+  // nodes to reach the sink. If path is non-null, stores in it the
+  // 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
-  int is_dag();
 
-  Vertex **_front, **_new_front;
+  // 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 check_DAG_and_set_last_change();
 
   int _nb_vertices, _nb_edges;
   Vertex *_source, *_sink;
@@ -60,6 +77,14 @@ class MTPGraph {
   Edge *_edges;
   Vertex *_vertices;
 
+  // For Dijkstra
+  Vertex **_heap;
+  int _heap_size;
+
+  // Updating the distances from the source in that order will work in
+  // the original graph (which has to be a DAG)
+  Vertex **_dp_order;
+
 public:
 
   // These variables are filled when retrieve_disjoint_paths is called
@@ -71,7 +96,12 @@ public:
 
   ~MTPGraph();
 
+  // Compute the family of paths with minimum total length, set the
+  // edge occupied fields accordingly.
   void find_best_paths(scalar_t *lengths);
+
+  // Retrieve the paths corresponding to the occupied edges, and save
+  // the result in the nb_paths and paths fields.
   void retrieve_disjoint_paths();
 
   void print(ostream *os);