+ _edge_lengths = new scalar_t[nb_edges];
+
+ // We put the in-node edges first, since these are the ones whose
+ // lengths we will have to change according to the detection score
+
+ for(int t = 0; t < _nb_time_steps; t++) {
+ for(int l = 0; l < _nb_locations; l++) {
+ node_from[e] = 1 + (2 * (t + 0) + 0) * _nb_locations + l;
+ node_to[e] = 1 + (2 * (t + 0) + 1) * _nb_locations + l;
+ e++;
+ }
+ }
+
+ // We put the other edges after
+