#define MTP_GRAPH_H
#include <iostream>
-#include <cmath>
using namespace std;
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
// 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