X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=mtp_graph.h;h=9093a8b465d5b4b094d0c8e2cab425db5e2649b0;hb=2862b6274624729936ac877247029409a60137cf;hp=916b60447083163f860a385129c976a7b0375bae;hpb=de64ce0b1101045816e6731e03d2735356c33ef0;p=mtp.git

diff --git a/mtp_graph.h b/mtp_graph.h
index 916b604..9093a8b 100644
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -40,11 +40,13 @@ 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.
   int retrieve_one_path(Edge *e, Path *path);
+  // Returns if the graph is a DAG
+  int is_dag();
 
   Vertex **_front, **_new_front;