#define MTP_GRAPH_H
#include <iostream>
-#include <cmath>
using namespace std;
class Edge;
class MTPGraph {
+
// Uses the estimated vertex distances to the source to make all the
// edge lengths positive, resulting in an identical added value to
// all the paths from the same initial node to the same final node
// the total correction when compiled in VERBOSE mode.
void force_positivized_lengths();
- void decrease_distance_in_heap(Vertex *v);
- void increase_distance_in_heap(Vertex *v);
-
- // Visit the vertices according to _dp_order and simply update their
- // distance to the source
+ // Visit the vertices according to _dp_order and update their
+ // distance from the source
void dp_compute_distances();
// Set in every vertex pred_edge_toward_source correspondingly to
// nodes met along the path, and computes path->length properly.
int retrieve_one_path(Edge *e, Path *path);
- // 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_distances();
-
int _nb_vertices, _nb_edges;
Vertex *_source, *_sink;
// 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