#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.
+ 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
// 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();
+ // 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
- // the path of shortest length. The current implementation is not
- // Dijkstra's!
+ // the path of shortest length. The current implementation is
+ // Dijkstra with a Binary Heap (and not with Fibonnaci heap (yet))
void find_shortest_path();
// Follows the path starting on edge e and returns the number of
// nodes met along the path, and computes path->length properly.
int retrieve_one_path(Edge *e, Path *path);
- // Returns if the graph is a DAG
- int is_dag();
-
- Vertex **_front, **_new_front;
-
int _nb_vertices, _nb_edges;
Vertex *_source, *_sink;
Edge *_edges;
Vertex *_vertices;
+ // 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;
+
public:
// These variables are filled when retrieve_disjoint_paths is called
~MTPGraph();
- // Compute the family of path with minimum total length, set the
+ // Compute the family of paths with minimum total length, set the
// edge occupied fields accordingly.
void find_best_paths(scalar_t *lengths);
- // Retrieve the path corresponding to the occupied edges, and save
+ // Retrieve the paths corresponding to the occupied edges, and save
// the result in the nb_paths and paths fields.
void retrieve_disjoint_paths();