X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?p=mtp.git;a=blobdiff_plain;f=mtp_graph.h;h=b07e4618c62e44dd9c120ad261667e282898c71d;hp=916b60447083163f860a385129c976a7b0375bae;hb=90a6bc97162d199e3b840bf178f49854e5df91fa;hpb=de64ce0b1101045816e6731e03d2735356c33ef0

diff --git a/mtp_graph.h b/mtp_graph.h
index 916b604..b07e461 100644
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -38,13 +38,19 @@ class Edge;
 
 class MTPGraph {
   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.
   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;