Floyd

#include<iostream> using namespace std; //#define DEBUG const int SIZE=15; const int INF=100;//this can't be too big to avoid overflow int n;//global variable for num of nodes void ppath(int path[][SIZE],int i,int j){ int k=path[i][j]; if(k==-1)return ; ppath(path,i,k); cout<<k<<" "; ppath(path,k,j); } void DisPath(int A[][SIZE],int path[][SIZE]){ for(int i=0;i<n;++i){ for(int j=0;j<n;++j){ if(A[i][j]==INF){ if(i!=j) cout<<"No path!"<<endl; }//if else{ cout<<i<<"->"<<j<<":"; cout<<i<<" "; ppath(path,i,j); cout<<j; cout<<"/n length:"<<A[i][j]<<endl; }//else }//for }//for } void Floyd(int A[][SIZE]){ int path[SIZE][SIZE]; memset(path,-1,sizeof(path));//initialize all elments in path with -1 for(int k=0;k<n;++k){ for(int i=0;i<n;++i){ for(int j=0;j<n;++j){ if(A[i][j]>(A[i][k]+A[k][j])){ A[i][j]=A[i][k]+A[k][j]; path[i][j]=k; }//if }//for }//for }//for #ifdef DEBUG cout<<"path:"<<endl; for(int i=0;i<n;++i){ for(int j=0;j<n;++j){ cout<<path[i][j]<<" "; } cout<<endl; } #endif cout<<"Shortest Path:"<<endl; DisPath(A,path); } int main(){ int u=0; int A[SIZE][SIZE]={ {INF,5,INF,7,INF,INF}, {INF,INF,4,INF,INF,INF}, {8,INF,INF,INF,INF,9}, {INF,INF,5,INF,INF,6}, {INF,INF,INF,5,INF,INF}, {3,INF,INF,INF,1,INF} }; n=6; Floyd(A); return 0; }