Floyd算法求点与点之间的最短路径

#include <stdio.h>
#include <iostream.h>
#define MAX 65535
#define N 4    // 顶点的个数
int P[N][N];   //PATH
int A[N][N];   //迭代矩阵
void Floyd(int A[][N],int C[][N],int P[][N]) 
{
int i,j,k;

for(i=0;i<N;i++)
   for(j=0;j<N;j++)
      {   A[i][j]=C[i][j];    //初始化迭失矩阵
          P[i][j]=0;
   }
for(i=0;i<N;i++) A[i][i]=0;
for(k=0;k<N;k++)
   for(i=0;i<N;i++)
     for(j=0;j<N;j++)
        {
      if((A[i][k]+A[k][j])<A[i][j])
      { A[i][j]=A[i][k]+A[k][j];
        P[i][j]=k;
      }
        }
         
}

void PATH(int i,int j)
{