所有点对最短路径

#include <stdio.h>
#include <iostream.h>
#include <stdlib.h>
#define Max 255
#define N 3

int main(void)
{
   int D[N][N] = {{0,2,9},{8,0,6},{1,Max,0}};
   cout<<"Original D is : \n";
   for(int i =0;i<N;i++)
   {
      for(int j=0;j<N;j++)
          cout<<D[i][j]<<" ";
      cout<<"\n";
   }
   for(int k=0;k<N;k++)
       for(int i=0;i<N;i++)
           for(int j=0;j<N;j++)
           {
               if(D[i][j] > D[i][k] + D[k][j])
                  D[i][j] = D[i][k] + D[k][j]; 
           }
  
   cout<<"Minimum D is : \n";
   for(int i =0;i<N;i++)
   {
      for(int j=0;j<N;j++)
          cout<<D[i][j]<<" ";
      cout<<"\n";
   }
   system( "PAUSE ");
   return 0;  
}