}
_graph->find_best_paths(_edge_lengths, _edge_occupation);
- _graph->print_dot();
+ _graph->retrieve_paths();
+
+ for(int p = 0; p < _graph->nb_paths; p++) {
+ Path *path = _graph->paths[p];
+ cout << "PATH " << p << " [length " << path->length << "] " << path->nodes[0];
+ for(int n = 1; n < path->length; n++) {
+ cout << " -> " << path->nodes[n];
+ }
+ cout << endl;
+ }
+ // _graph->print_dot();
}
// void Tracker::track() {