Use Java to implement Bellman Ford single source shortest path algorithm. The input graph matrix is stored in a file with the format such as

$5$

$05207$

$00903$

$00060$

$00008$

$00000$

$5$ is the number of vertices.

Your program input: file name of the given graph

Then ask users the source vertex index $($starts at $0)$

Output: Print the shortest path from the source to every vertex and the total distance of the shortest path. If there is a negaive weight cycle, output no solution.