6-12 Shortest Path（Dijkstra算法）

Write a program to find the weighted shortest distances from any vertex to a given source vertex in a digraph. It is guaranteed that all the weights are positive.

Format of functions:

void ShortestDist( MGraph Graph, int dist[], 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.

Sample program of judge:

#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[], Vertex S );

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

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

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

    return 0;
}

/* Your function will be put here */

Sample Input (for the graph shown in the figure):

7 9
0 1 1
0 5 1
0 6 1
5 3 1
2 1 2
2 6 3
6 4 4
4 5 5
6 5 12
2

Sample Output:

-1 2 0 13 7 12 3 

我们先来看看Dijkstra算法的伪代码理解一下Dijkstra算法的思路：

//G为图的邻接矩阵，数组d为源点到达各点的最短路径长度，s为起点
Dijkstra(G,d[],s) {
    初始化;
    for(循环n次) {
        u = 使d[u]最小的还未被访问的顶点标号;
        记u已被访问;
        for(从u出发能到达的所有顶点v) {
            if(v未被访问 && 以u为中介点可以使s到顶点v的最短距离d[v]更优) {
                优化d[v];
            }
        }
    }
}

Dijkstra算法如下：

bool visited[1000] = {false};
void ShortestDist( MGraph Graph, int dist[], Vertex S ){
    for(int i = 0; i < Graph->Nv; i++) {
        dist[i] = INFINITY;
    }
    dist[S] = 0; // 起点到自身距离为0
    for(int i = 0; i < Graph->Nv; i++) { // 循环Nv次
        int u = -1, MIN = INFINITY; // u使dist[u]最小，MIN存放该最小的dist[u]
        for(int j = 0; j < Graph->Nv; j++) {
            if(visited[j]==false && dist[j] < MIN) {
                u = j;
                MIN = dist[j];
            }
        }
        if(u == -1) { // 如果u == -1说明起点与剩下顶点不连通
            for(int i = 0; i < Graph->Nv; i++) {
                if(dist[i] == INFINITY) dist[i] = -1;
            }
            return;
        }
        visited[u] = true;
        for(int v = 0; v < Graph->Nv; v++) {
            // v 未访问 && 以u为中介点可以使dist[v]更优
            if(visited[v] == false && dist[v] > dist[u] + Graph->G[u][v])
                dist[v] = dist[u] + Graph->G[u][v];
        }
    }
}