Level 2 NCEA Networks - Shortest Path (Dijkstra’s Algorithm)

[JesusChristIsLord]

What my lecturer would explain in months is explained in less than 15 minutes, thank you very much sir

[tomrose]

As a suggestion, you could colour the paths as you go (as you box a number)?

Also, as Dijkstra's method is about finding a path (so no cycles), is it correct to say that you don't need to check any edge that would create a cycle?

For example when checking C to B and saying "B is boxed so I won't go there":

it could also be said that B to C would create a cycle, so I won't go there?

[omkarphalke]

Find the shortest path vertex F to Vertex A using Dijkstra's algorithm.