0
$\begingroup$

enter image description here

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
Improve this question
$\endgroup$
1
  • $\begingroup$ Program Dijkstra's algorithm and run it on your graph. $\endgroup$ – Yuval Filmus May 27 '19 at 8:54
0
$\begingroup$

Assuming that you only want to know the distance from A to a certain point, your first calculations are right. However A to H should be 37. Check that again. Also, there are shorter paths from A to I and A to J. Just have a look again - the other values are correct.

Improve this answer
$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.