（图6-22）Shortest Path [4]--C语言

Write a program to find the weighted shortest distances from any vertex to a given source vertex in a digraph. If there is more than one minimum path from v to w, a path with the fewest number of edges is chosen. It is guaranteed that all the weights are positive and such a path is unique for any vertex.（编写一个程序，找出有向图中任何顶点到给定源顶点的加权最短距离。如果从v到w有多个最小路径，则选择边数最少的路径。保证所有权重都是正的，并且这样的路径对于任何顶点都是唯一的。）

函数接口定义：

void ShortestDist( MGraph Graph, int dist[], int path[], Vertex S );

where MGraph is defined as the following:

typedef struct GNode *PtrToGNode;
struct GNode{
int Nv;
int Ne;
WeightType G[MaxVertexNum][MaxVertexNum];
};
typedef PtrToGNode MGraph;

The shortest distance from V to the source S is supposed to be stored in dist[V]. If V cannot be reached from S, store -1 instead. If W is the vertex being visited right before V along the shortest path from S to V, then path[V]=W. If V cannot be reached from S, path[V]=-1, and we have path[S]=-1.（从V到源S的最短距离应该存储在dist[V]中。如果无法从S到达V，则存储-1。如果W是沿着从S到V的最短路径在V之前访问的顶点，则path[V]=W。如果不能从S到达V，则path[S]=-1，并且我们有path[S]=-1。）

裁判测试程序样例：

#include <stdio.h>
#include <stdlib.h>

typedef enum {false, true} bool;
#define INFINITY 1000000
#define MaxVertexNum 10  /* maximum number of vertices */
typedef int Vertex;      /* vertices are numbered from 0 to MaxVertexNum-1 */
typedef int WeightType;

typedef struct GNode *PtrToGNode;
struct GNode{
    int Nv;
    int Ne;
    WeightType G[MaxVertexNum][MaxVertexNum];
};
typedef PtrToGNode MGraph;

MGraph ReadG(); /* details omitted */

void ShortestDist( MGraph Graph, int dist[], int path[], Vertex S );

int main()
{
    int dist[MaxVertexNum], path[MaxVertexNum];
    Vertex S, V;
    MGraph G = ReadG();

    scanf("%d", &S);
    ShortestDist( G, dist, path, S );

    for ( V=0; V<G->Nv; V++ )
        printf("%d ", dist[V]);
    printf("\n");
    for ( V=0; V<G->Nv; V++ )
        printf("%d ", path[V]);
    printf("\n");

    return 0;
}

/* Your function will be put here */

输入样例：

8 11
0 4 5
0 7 10
1 7 40
3 0 40
3 1 20
3 2 100
3 7 70
4 7 5
6 2 1
7 5 3
7 2 50
3

输出样例：

40 20 100 0 45 53 -1 50 
3 3 3 -1 0 7 -1 0 

代码：

int vis[MaxVertexNum];//标记顶点被访问过
int count[MaxVertexNum];//记录最短路径的边数
void ShortestDist( MGraph Graph, int dist[], int path[], Vertex S )
{
    for(int i=0;i<Graph->Nv;i++)//初始化
    {
        vis[i]=0;
        dist[i]=Graph->G[S][i];
        if(dist[i]<INFINITY)//顶点S的邻接点
        {
            count[i]=1;//边数初始化为1
            path[i]=S;//路径顶点初始化为S
        }
        else//不是S的邻接点
        {
            count[i]=0;
            path[i]=-1;
        }
    }
    //顶点S的初始化
    dist[S]=0;
    vis[S]=1;
    count[S]=0;
    path[S]=-1;
    while(1)
    {
        int v=-1;
        int min=INFINITY;
        for(int j=0;j<Graph->Nv;j++)//找v点
        {
            if(vis[j]==0&&dist[j]<min)
            {
                min=dist[j];
                v=j;
            }
        }
        if(v==-1) break;//不存在v点
        vis[v]=1;//标记v点被访问
        for(int w=0;w<Graph->Nv;w++)
        {
            //路径权值一样且边数比原本最小路径的边数更短
            if((dist[v]+Graph->G[v][w]==dist[w])&&vis[w]==0&&(count[w]>count[v]+1))
            {
                count[w]=count[v]+1;
                path[w]=v;
            }
            //路径权值小于该顶点的路径权值
            if((dist[v]+Graph->G[v][w]<dist[w])&&vis[w]==0)
            {
                dist[w]=dist[v]+Graph->G[v][w];
                count[w]=count[v]+1;
                path[w]=v;
            }
        }
    }
    //把被访问过但不能到达源点S的点权值赋为-1
    for(int i=0;i<Graph->Nv;i++)
    {
        if(dist[i]==INFINITY) dist[i]=-1;
    }
}