-#endif
-
- for(int v = 0; v < nb_vertices; v++) {
- vertices[v].distance_from_source = FLT_MAX;
- vertices[v].pred_vertex = 0;
- vertices[v].pred_edge = 0;
- }
-
- int front_size = 0, new_front_size;
- front[front_size++] = source;
- source->distance_from_source = 0;
-
- do {
- new_front_size = 0;
- for(int f = 0; f < front_size; f++) {
- v = front[f];
- for(Edge *e = v->root_edge; e; e = e->next) {
- d = v->distance_from_source + e->work_length;
- tv = e->terminal_vertex;
- if(d < tv->distance_from_source) {
- tv->distance_from_source = d;
- tv->pred_vertex = v;
- tv->pred_edge = e;
- new_front[new_front_size++] = tv;
- }
- }
- }
-
- tmp_front = new_front;
- new_front = front;
- front = tmp_front;
-
- tmp_front_size = new_front_size;
- new_front_size = front_size;
- front_size = tmp_front_size;
- } while(front_size > 0);
-}
-
-void Graph::find_best_paths(int *result_edge_occupation) {
- Vertex **front = new Vertex *[nb_vertices];
- Vertex **new_front = new Vertex *[nb_vertices];