/*
- * mtp is the ``Multi Tracked Path'', an implementation of the
- * k-shortest path algorithm for multi-target tracking.
+ * mtp is the ``Multi Tracked Paths'', an implementation of the
+ * k-shortest paths algorithm for multi-target tracking.
*
* Copyright (c) 2012 Idiap Research Institute, http://www.idiap.ch/
* Written by Francois Fleuret <francois.fleuret@idiap.ch>
void update_positivized_lengths();
void force_positivized_lengths();
// Set the edge pred_edge_toward_source correspondingly to the path
- // of shortest length.
+ // of shortest length. The current implementation is not Dijkstra's!
void find_shortest_path();
// Follows the path starting on edge e and returns its length. If
// nodes is non-null, stores in it the nodes met along the path.
int retrieve_one_path(Edge *e, Path *path);
+ // Returns if the graph is a DAG
+ int is_dag();
Vertex **_front, **_new_front;