Dijkstra algorithm in Java that takes a 2d array (matrix) along with int source as inputs and displays the output in the image.

The 0's in the places where i != j are to be read as infinity(public static int INF = 99999)

9 2 3 9 Matrix Size Distance Path 09 290 9038 1 2 304 0 9 8 4 0 0 1 0 1 0 151 2-3-1 0 @@@@ 010 1 131 31 2-3 [2])2-5-4 10 [1] 2-5 source 9 2 3 9 Matrix Size Distance Path 09 290 9038 1 2 304 0 9 8 4 0 0 1 0 1 0 151 2-3-1 0 @@@@ 010 1 131 31 2-3 [2])2-5-4 10 [1] 2-5 source