// dist.java - mjd@cs.auckland.ac.nz

import java.io.*;
import graphs.*;

public class dist {

 public static void main(String argv[]) 
 {
   try {

// BufferedReader input = new BufferedReader(new FileReader(argv[0]));
   BufferedReader input = new BufferedReader(new InputStreamReader(System.in));

   while(true)
   {
     Graph G = new Graph(input);
     int n=G.order(); if ( n == 0 ) break;

     System.out.print(G.toStringAdjMatrix());

     int[][] D = GraphAlgs.distanceMatrix(G);

     System.out.println("Distance matrix:");
     for (int i=0; i<n; i++) 
     {
       for (int j=0; j<n; j++)
       { 
         System.out.print(D[i][j] + " ");
       }
       System.out.print("\n");
     }
     System.out.println("Diameter is " + GraphAlgs.diameter(G));
   } 

   } catch ( Exception e ) { System.err.println("Exception: "+e); }

 } // main

} // class dist