Removed compute_dp_ranks, added compute_dp_ordering instead.

[mtp.git] / mtp_graph.h

diff --git a/mtp_graph.h b/mtp_graph.h
index 9f50ae4..e0f40e9 100644 (file)
--- 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
@@ -81,6 +77,8 @@ class MTPGraph {
   // 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