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

voidShortestDist(LGraphGraph, intdist[], VertexS)
{
intfront=0, rear=0;
PtrToAdjVNodep=NULL;
Vertex*que=(Vertex*)malloc(MaxVertexNum*sizeof(Vertex));
for(inti=0;i<MaxVertexNum;i++)
que[i]=dist[i]=-1;
dist[S]=0;
que[0]=S;
while(front<=rear)
    {
Vertexs=que[front];
p=Graph->G[s].FirstEdge;
while(p)
        {
Vertexv=p->AdjV;
if(dist[v]==-1)
            {
dist[v]=1+dist[s];
que[++rear]=v;
            }
p=p->Next;
        }
front++;
    }
}