Code:import java.util.*; class ShortestPath { static double distmat[]; int index[] max!dist max!ind; ShortestPath"int n# { max!dist$n; max!

ind$n; distmat$ne% double[max!dist]; index$ne% int[max!ind]; &or"int i$';i(max!ind;i))# { index[i]$i; i&"i$$'# { distmat[i]$'; * else { distmat[i]$+ouble.P,S-.-/0!-12-1-.3; * * * int 4et5inPos"# { double min; min$distmat[']; int pos$'; &or"int i$';i(max!dist;i))# { i&"distmat[i](min# { min$distmat[i]; pos$i; * * return"pos#; * int 4et-ndex"int p# { int t$index[p]; return"t#; *

public static void main"Strin4 ar4s[]# { Scanner sc$ne% Scanner"S6stem.in#; S6stem.out.println"70nter no. o& vertices7#; int n$sc.next-nt"#; double min+ist[]$ne% double[n]; double adjmat[][]$ne% double[n][n]; ShortestPath d$ne% ShortestPath"n#; double sum$'; double tempsum$'; double in&$+ouble.P,S-.-/0!-12-1-.3; S6stem.out.println"70nter %ei4hts o& ed4es8-9 &or in&init67#; &or"int i$';i(n;i))# { &or"int j$';j(n;j))# { i&"i$$j# { adjmat[i][j]$'; * else { S6stem.out.println"70nter distance &rom 7)"i)9#)7 to 7)"j)9##; double temp$sc.next+ouble"#; i&"temp$$-9.'# { adjmat[i][j]$in&; * else { adjmat[i][j]$temp; * * * * &or"int i$';i(n;i))# { int pos$d.4et5inPos"#; sum$distmat[pos]; int indx$d.4et-ndex"pos#; min+ist[indx]$sum; &or"int j$';j(n;j))# { i&"adjmat[i][j]$$in&# {

continue; * else { tempsum$sum)adjmat[indx][j]; i&"distmat[j]$$in&# { distmat[j]$tempsum; * else i&"tempsum(distmat[j]# { distmat[j]$tempsum; * * tempsum$'; * distmat[indx]$in&; * S6stem.out.println"7.he shortest path is 4iven as &ollo%s:7#; &or"int i$';i(n;i))# { int a$"int#min+ist[i]; S6stem.out.print"a)7:t7#; * * *

+ebu44in4:-