Update with the Dijkstra using a Binary Heap for the min-priority queue.

[mtp.git] / mtp_graph.h

diff --git a/mtp_graph.h b/mtp_graph.h
index 5842671..2bc5933 100644 (file)
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -57,8 +57,8 @@ class MTPGraph {
   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!
+  // 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 the number of
@@ -69,7 +69,7 @@ class MTPGraph {
   // 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();
+  int check_DAG_and_set_last_change();
 
   int _nb_vertices, _nb_edges;
   Vertex *_source, *_sink;