图论 最短路径Floyd算法

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