# Confused in calculating the shortest-path using Dijkstra's Algorithm [closed]

I am required to find the shortest path using Dijkstra's Algorithm. After performing the calculations, am I getting the following values correct?:

A=0
B=13
C=8
D=20
E=14
F=25
G=31
H=38
I=46
J=52

• Program Dijkstra's algorithm and run it on your graph. – Yuval Filmus May 27 '19 at 8:54