+ for(int t = 0; t < _nb_time_steps; t++) {
+ for(int l = 0; l < _nb_locations; l++) {
+ if(_entrances[l]) {
+ node_from[e] = source;
+ node_to[e] = 1 + (2 * (t + 0) + 0) * _nb_locations + l;
+ _edge_lengths[e] = 0.0;
+ e++;
+ }
+ if(_exits[l]) {
+ node_from[e] = 1 + (2 * (t + 0) + 1) * _nb_locations + l;
+ node_from[e] = sink;
+ _edge_lengths[e] = 0.0;
+ e++;
+ }
+ }
+ }
+