31 int &num_visited_nodes);
void dijkstra_f(int vertex, vtx_data *graph, int n, float *dist)
void dijkstra(int vertex, vtx_data *graph, int n, DistType *dist)
Agraph_t * graph(char *name)
double dist(Site *s, Site *t)
int dijkstra_bounded(int vertex, vtx_data *graph, int n, DistType *dist, int bound, int *visited_nodes)