Python

C

Java

Python result:

C result:

Java result:

Dijkstra's Algorithm starting from vertex D:

Shortest distance from D to A: 4

Shortest distance from D to B: 8

Shortest distance from D to C: 6

Shortest distance from D to D: 0

Shortest distance from D to E: 2

Shortest distance from D to F: 10

Shortest distance from D to G: 7

Shortest distance from D to A: 4

Shortest distance from D to B: 8

Shortest distance from D to C: 6

Shortest distance from D to D: 0

Shortest distance from D to E: 2

Shortest distance from D to F: 10

Shortest distance from D to G: 7

Dijkstra's Algorithm starting from vertex D:

Shortest distance from D to A: 4

Shortest distance from D to B: 8

Shortest distance from D to C: 6

Shortest distance from D to D: 0

Shortest distance from D to E: 2

Shortest distance from D to F: 10

Shortest distance from D to G: 7

Shortest distance from D to A: 4

Shortest distance from D to B: 8

Shortest distance from D to C: 6

Shortest distance from D to D: 0

Shortest distance from D to E: 2

Shortest distance from D to F: 10

Shortest distance from D to G: 7

Dijkstra's Algorithm starting from vertex D:

Shortest distance from D to A: 4

Shortest distance from D to B: 8

Shortest distance from D to C: 6

Shortest distance from D to D: 0

Shortest distance from D to E: 2

Shortest distance from D to F: 10

Shortest distance from D to G: 7

Shortest distance from D to A: 4

Shortest distance from D to B: 8

Shortest distance from D to C: 6

Shortest distance from D to D: 0

Shortest distance from D to E: 2

Shortest distance from D to F: 10

Shortest distance from D to G: 7