Data Structures and Algorithms (English) - 6-17 Shortest Path [4]（25 分）

void ShortestDist( MGraph Graph, int dist[], int path[], Vertex S )
{
    int vis[MaxVertexNum], num[MaxVertexNum];
    for(int i=0;i<Graph->Nv;i++) num[i]=vis[i]=0, dist[i]=INFINITY, path[i]=-1;
    dist[S]=0;
 
    while(1)
    {
        int mi=INFINITY; S=-1;
        for(int i=0;i<Graph->Nv;i++)
            if(!vis[i] && mi>dist[i]) mi=dist[i], S=i;
 
        if(S==-1) break;
        vis[S]=1;
 
        for(int i=0;i<Graph->Nv;i++)
        {
            if(!vis[i] && Graph->G[S][i]+mi<dist[i])
            {
                dist[i]=Graph->G[S][i]+mi;
                num[i]=num[S]+1;
                path[i]=S;
            }
            else if(!vis[i] && Graph->G[S][i]+mi==dist[i] && Graph->G[S][i]!=INFINITY)
            {
                if(num[S]+1<num[i])
                {
                    num[i]=num[S]+1;
                    path[i]=S;
                }
            }
        }
    }
 
    for(int i=0;i<MaxVertexNum;i++)
        if(INFINITY==dist[i]) dist[i]=-1;
}