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
0
$\begingroup$
$\endgroup$
closed as unclear what you're asking by Evil, Yuval Filmus, dkaeae, Discrete lizard♦ May 29 at 12:07
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
-
$\begingroup$ Program Dijkstra's algorithm and run it on your graph. $\endgroup$ – Yuval Filmus May 27 at 8:54
0
$\begingroup$
$\endgroup$
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.
