class MTPTracker {
MTPGraph *_graph;
+
+ // The edges will be ordered as follows: First the nb_locations *
+ // nb_time_steps edges inside the node pairs, which will have
+ // lengths equal to the opposite of the detection scores, then the
+ // edges between these node pairs, and finally the edges from source
+ // and to sink.
scalar_t *_edge_lengths;
int early_pair_node(int t, int l);