In the first part of the assignment, write a program that will compute the shortest path distance between all pairs of vertices in a graph. The graph is a simple undirected weighted graph. The Floyd's algorithm must be used. The input to the program is a file containing the graph. The input file contains the adjacency matrix representing the graph. The file contains the size of the matrix at the top. The output of the program is a file containing the all pair shortest distances of the given graph. The output file contains the all pair shortest distances as a matrix.

Run your program with the given test graphs and compute the all pair shortest distances. Submit the results.