cost(struct arc c[][10],int n)
{
int i,j,wt;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{
printf("\t Enter weight of arc [%d][%d] : ",i,j);
scanf("%d",&wt);
joinwt(c,i,j,wt);
}
printf("\n");
return (0);
}
int best_route_distance(Flight query, Flight direct_flights[], struct input line) {
GRAPH *graph;
graph = init_graph();
int i, j, num_df;
num_df = line.direct_flights;
for(i = 0; i < num_df; i++) {
for(j = 0; j < num_df; j++) {
joinwt(graph,
direct_flights[i].origin.id,
direct_flights[i].destination.id,
direct_flights[i].distance
);
}
}
return dijkstra(graph, query.origin.id, query.destination.id);
}
