- // to the sink (in every time frames but the first for the source,
- // and last for the exits)
+ // to the sink (in every time frames but the first for the
+ // entrances, and last for the exits)
(_nb_time_steps - 1) * nb_motions +
// The edges inside the duplicated nodes
_nb_locations * _nb_time_steps;
(_nb_time_steps - 1) * nb_motions +
// The edges inside the duplicated nodes
_nb_locations * _nb_time_steps;
- cout << "PATH " << p << " [length " << path->length << "] " << path->nodes[0];
- for(int n = 1; n < path->length; n++) {
+ cout << "PATH " << p << " [length " << path->nb_nodes << "] " << path->nodes[0];
+ for(int n = 1; n < path->nb_nodes; n++) {
int Tracker::trajectory_entrance_time(int k) {
return (_graph->paths[k]->nodes[1] - 1) / (2 * _nb_locations);
}
int Tracker::trajectory_duration(int k) {
int Tracker::trajectory_entrance_time(int k) {
return (_graph->paths[k]->nodes[1] - 1) / (2 * _nb_locations);
}
int Tracker::trajectory_duration(int k) {
-int Tracker::trajectory_location(int k, int time) {
- return (_graph->paths[k]->nodes[2 * time + 1] - 1) % _nb_locations;
+int Tracker::trajectory_location(int k, int time_from_entry) {
+ return (_graph->paths[k]->nodes[2 * time_from_entry + 1] - 1) % _nb_locations;