Description: void ShortestPath_DIJ( Node a ,Status i ,Status v0 ,Status*D ,Status*pre )
{
int v,w,j,l=1
Status*final
Status min
final=(Status*)malloc( sizeof(Status)*i )
for(v=0 v<i v++)
{
final[v]=FALSE
pre[v]=FALSE
D[v]=a[v0][v]
if(D[v]<10000)
pre[v]=v0
}
File list (Check if you may need any files):
Dijkstra.c
Download