#define MTP_GRAPH_H
#include <iostream>
-#include <cmath>
using namespace std;
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();
+ void 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