void dp_distance_propagation();
// 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
// Returns if the graph is a DAG, and set the last_change field of
// each vertex to the maximum number of iterations required to reach
// it
- int is_dag();
+ int check_DAG_and_set_last_change();
int _nb_vertices, _nb_edges;
Vertex *_source, *_sink;