图论 最短路径dijkstra算法

#include<iostream>
#include<cstdio>
using namespace std;
#define MAX 100
#define INFINITY 10000
typedef struct{
    int arc[MAX][MAX];
    int vex,edge;
}AdjMatrix;
void Dijkstra(AdjMatrix *G,int v0,int d[MAX])
{
    int s[MAX];
    for(int i=0;i<G->vex;i++)
    {s[i]=0;d[i]=G->arc[v0][i];}
    s[v0]=1;
    for(int i=1;i<G->vex;i++)
    {
        int u=0;
        int mindis=INFINITY;
        for(int j=0;j<G->vex;j++)
        {
            if(s[j]==0&&d[j]<mindis) {u=j;mindis=d[j];}
        }
        s[u]=1;
        for(int j=0;j<G->vex;j++)
        {
            if(s[j]==0&&d[j]>d[u]+G->arc[u][j]) d[j]=d[u]+G->arc[u][j];
        }
    }
}
int main()
{
    AdjMatrix *G;
    G=(AdjMatrix *)malloc(sizeof(AdjMatrix));
    int n;
    scanf("%d",&n);
    G->vex=n;
    for(int i=0;i<G->vex;i++)
    {
        for(int j=0;j<G->vex;j++)
        {
            if(i==j) G->arc[i][j]=0;
            else G->arc[i][j]=INFINITY;
        }
    }
    int x,y,w;
    while(scanf("%d%d%d",&x,&y,&w)&&(x||y||w)) G->arc[x][y]=w;
    int v0,d[MAX];
    while(scanf("%d",&v0))
    {
        Dijkstra(G,v0,d);
        for(int i=0;i<G->vex;i++)
        {
            if(d[i]!=INFINITY) printf("% d",d[i]);
            else printf(" inf");
        }
        printf("\n");
    }
    return 0;
}
//输入的图
//6
//0 1 6
//0 2 3
//2 1 2
//1 3 5
//2 3 8
//2 4 4
//3 4 5
//3 5 2
//4 5 6
//0 0 0
//输出结果
//0
//0 5 3 10 7 12
//1
//inf 0 inf 5 10 7
//2
//inf 2 0 7 4 9
//3
//inf inf inf 0 5 2
//4
//inf inf inf inf 0 6
//5
//inf inf inf inf inf 0