class Path {
public:
- int starting_time;
- int duration;
+ Path(int l);
+ ~Path();
+ int length;
int *nodes;
};
void update_positivized_lengths();
void force_positivized_lengths();
void find_shortest_path(Vertex **front, Vertex **new_front);
+ int retrieve_one_path(Edge *e, int *nodes);
Vertex **_front, **_new_front;