X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp_graph.h;h=9093a8b465d5b4b094d0c8e2cab425db5e2649b0;hb=2862b6274624729936ac877247029409a60137cf;hp=945f3872bab707081454e3f4f19d689aa4a668f9;hpb=34022d5e987cf13ff6db31a6d7263e9266a8b1c0;p=mtp.git

diff --git a/mtp_graph.h b/mtp_graph.h
index 945f387..9093a8b 100644
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -40,7 +40,7 @@ class MTPGraph {
   void update_positivized_lengths();
   void force_positivized_lengths();
   // Set the edge pred_edge_toward_source correspondingly to the path
-  // of shortest length.
+  // of shortest length. The current implementation is not Dijkstra's!
   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.