6-17 Shortest Path [2] (25 分)

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 

Effective methods:

把图传过来直接按邻接表Dijkstra，反正卡不了堆优化。

已通过函数样例：

void ShortestDist( MGraph Graph, int dist[], Vertex S ) {
    int vis[MaxVertexNum];
    
    for(int i = 0; i < MaxVertexNum; i++){
        vis[i] = 0;
        dist[i] = INFINITY;
    }
    
    dist[S] = 0;
    
    while(1){
        int v = -1;
        for(int u = 0; u < Graph -> Nv; u++)
            if(!vis[u] && (v == -1 || dist[u] < dist[v]))
                v = u;
        if(v == -1) {
            for(int i = 0; i < MaxVertexNum; i++){
                if(dist[i] == INFINITY) dist[i] = -1;
            }//这里不写的话，只对一个点
            return;
        }
        vis[v] = 1;
        for(int i = 0; i < Graph -> Nv; i++)
            dist[i] = (dist[i] < dist[v] + Graph -> G[v][i]) ? dist[i] : dist[v] + Graph -> G[v][i];
    }
    
}