//弗洛伊德算法为什么没输出#include<iostream>using namespace std;#define max 100#define inf 25645typedef struct{ int vexnum; int Edge[max][max];}Graph;void Floyed(Graph G){ int A[G.vexnum][G.vexnum]; for(int i=0;i<G.vexnum;i++){ for(int j=0;i<G.vexnum;j++){ A[i][j]=G.Edge[i][j];//初始化 } } for(int k=0;k<G.vexnum;k++){ for(int i=0;i<G.vexnum;i++){ for(int j=0;j<G.vexnum;j++){ if(A[i][j]>A[i][k]+A[k][j]){ A[i][j]=A[i][k]+A[k][j]; } } } } for(int i=0;i<G.vexnum;i++){ for(int j=0;j<G.vexnum;j++){ cout<<A[i][j]<<" "; } cout<<endl; } return;}int main(){ int n,m,i,j,weight; Graph G; cin>>n>>m; G.vexnum=n; for(i=0;i<n;i++){ for(j=0;j<n;j++){ G.Edge[i][j]=inf; } } while(m--){ cin>>i>>j>>weight; G.Edge[i][j]=weight; } Floyed(G);}//??为什么没输出