- for(int e = 0; e < nb_edges; e++) {
- (*file) >> vertex_from[e] >> vertex_to[e] >> edge_lengths[e];
- }
-
- find_best_paths(nb_vertices, nb_edges,
- vertex_from, vertex_to, edge_lengths,
- source, sink,
- result_edge_occupation);
-
- dot_print(nb_vertices, nb_edges,
- vertex_from, vertex_to, edge_lengths,
- source, sink,
- result_edge_occupation);
-
- delete[] result_edge_occupation;
- delete[] edge_lengths;
- delete[] vertex_from;
- delete[] vertex_to;
+ ofstream out_dot("graph.dot");
+ tracker.print_graph_dot(&out_dot);
+ cout << "Wrote graph.dot" << endl;