CHALLENGE: Dijkstra's Algorithm

Question

Hi everyone.
So, as the title, the challenge is to make The Dijkstra's Algorithm.
The program is to solve the problem of the shortest way.

Consider the following network:
B - E - H
/ \ \ \
A - D - G - J
\ / / /
C - F - I
Objectives:

The user can enter the distances between the different cities by respecting the network. AB,AC,AD,BD,CD,BE,DG,CF,EG,FG,EH,GJ,FI,HJ and IJ.
The program will return the shortest way from City A to J.

All languages and methods are welcome.
Good luck.

Answer 1

You may submit this as an assignment as an entry in Lesson Factory for it to be approved and published. :>

Answer 2

ok

Answer 3

https://code.sololearn.com/cZf90umzSW36/?ref=app