6-12 Shortest Path [2]（25 分）

6-12 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 

Dijkstra算法：
Vertex FindMin(int dist[], int Sure[],int N)
{
int i = 0, j = 0;
while (Sure[i] == 1 || dist[i]==INFINITY)
i++;
j = i+1;
while (j < N) {
if (dist[i] > dist[j] && Sure[j] != 1) {
i = j;
return i;
}
else
j++;
}
if (i >= N)
return -1;
else
return i;
}


void ShortestDist(MGraph Graph, int dist[], Vertex S)
{
Vertex V = S;
int* Sure = (int*)malloc(Graph->Nv * sizeof(int));
memset(Sure, 0, Graph->Nv * sizeof(int));
for (int i = 0; i < MaxVertexNum; i++)
dist[i] = INFINITY;
Sure[V] = 1;
dist[V] = 0;
while (V!=-1) {
for (Vertex i = 0; i < Graph->Nv; i++) {
if (Graph->G[V][i] != INFINITY && V!=i) {
if (dist[i]!=INFINITY) {
if (dist[i] > dist[V] + Graph->G[V][i])
dist[i] = dist[V] + Graph->G[V][i];
}
else
dist[i] = dist[V] + Graph->G[V][i];
}
}
V = FindMin(dist,Sure,Graph->Nv);
if (V!=-1) 
Sure[V] = 1;
}
for (Vertex i = 0; i <Graph->Nv ; i++)
if (dist[i] == INFINITY)
dist[i] = -1;
}