Floyd模板(详细操作最基础版)

#include<cstdio>
#include<iostream>
using namespace std;
#define MAX 500
#define INFE 1<<20
 
int N; 
int map[MAX][MAX],b[MAX],path[MAX][MAX];  //path[i][j]记录路径
 
void init()
{
       int i,j;
       for(i=1;i<=N;i++)
              for(j=1;j<=N;j++)
              {
                     map[i][j]=INFE;
                     path[i][j]=j;
              }
}
 
void floyd()
{
       int i,j,k;
       for(k=1;k<=N;k++)
              for(i=1;i<=N;i++)
                     for(j=1;j<=N;j++)
                            if(map[i][j]>map[i][k]+map[k][j])
                            {
                                   map[i][j]=map[i][k]+map[k][j];
                                   path[i][j]=path[i][k];
                            }
}
 
 
int main()
{
       int m,u,v,len;
       while(scanf("%d%d",&N,&m)!=