- ifstream *file = new ifstream(argv[1]);
-
- int nb_edges, nb_vertices;
- int source, sink;
-
- if(file->good()) {
-
- (*file) >> nb_vertices >> nb_edges;
- (*file) >> source >> sink;
-
- cout << "INPUT nb_edges " << nb_edges << endl;
- cout << "INPUT nb_vertices " << nb_vertices << endl;
- cout << "INPUT source " << source << endl;
- cout << "INPUT sink " << sink << endl;
-
- scalar_t *el = new scalar_t[nb_edges];
- int *ea = new int[nb_edges];
- int *eb = new int[nb_edges];
-
- for(int e = 0; e < nb_edges; e++) {
- (*file) >> ea[e] >> eb[e] >> el[e];
- cout << "INPUT_EDGE " << ea[e] << " " << eb[e] << " " << el[e] << endl;
- }
-
- Graph graph(nb_vertices, nb_edges, ea, eb, el, source, sink);
-
- graph.find_best_paths();
- graph.print_occupied_edges();
-
- delete[] el;
- delete[] ea;
- delete[] eb;
-
- } else {
-
- cerr << "Can not open " << argv[1] << endl;
-
- delete file;
- exit(EXIT_FAILURE);
-
- }