X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?p=mtp.git;a=blobdiff_plain;f=mtp_graph.h;h=33a29f51b690bc510bff5a46343ff5a22950d2bc;hp=9f50ae48f1f7d8d97dedc64d03bbcb96d2713e37;hb=2228dec6631697204466df7e45b7ab3786f6308a;hpb=8a3940ee003a04bac70679bdd7b3e2e8bc45ae37

diff --git a/mtp_graph.h b/mtp_graph.h
index 9f50ae4..33a29f5 100644
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -26,7 +26,6 @@
 #define MTP_GRAPH_H
 
 #include <iostream>
-#include <cmath>
 
 using namespace std;
 
@@ -37,9 +36,6 @@ class Vertex;
 class Edge;
 
 class MTPGraph {
-  // Set the distance_from_source fields to the number of DP
-  // iterations needed to update it. Abort if the graph is not a DAG.
-  int compute_dp_ranks();
 
   // Uses the estimated vertex distances to the source to make all the
   // edge lengths positive, resulting in an identical added value to
@@ -75,12 +71,13 @@ class MTPGraph {
 
   // 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;
 
+  // Fills _dp_order
+  void compute_dp_ordering();
 public:
 
   // These variables are filled when retrieve_disjoint_paths is called