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
// Follows the path starting on edge e and returns the number of
// nodes to reach the sink. If path is non-null, stores in it the
// nodes met along the path, and computes path->length properly.
- int retrieve_one_path(Edge *e, Path *path);
+ int retrieve_one_path(Edge *e, Path *path, int *used_edges);
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
void find_best_paths(scalar_t *lengths);
// Retrieve the paths corresponding to the occupied edges, and save
- // the result in the nb_paths and paths fields.
+ // the result in the nb_paths and paths fields. If the paths are not
+ // node-disjoint, there are multiple families of paths that
+ // "explain" the edge occupancies, and this method picks one of them
+ // arbitrarily.
void retrieve_disjoint_paths();
void print(ostream *os);