Write a C program and get the expected result

A digraph G(V,E) is given below where the vertices mark various cities and the edges mark the distances between cities. Indian railways plans to send trains between every pair of cities in the digraph following the shortest distance between them. Write a C program to find the shortest distance between all-pairs of cities in the digraph. The output should be printed in a matrix form. Note : I have given 10000 in place of infinity in the input test case. For example