Shortest Path Problems and Dijkstra’s Algorithm is a part of the VCE Further Maths topic Networks and Decision Mathematics. The shortest path between two vertices in a network is the path where the sum of the weights of its edges is minimised. Dijkstra’s Algorithm is a method of finding the shortest path.
So What is Dijkstra’s Algorithm?
Watch this video for a quick introduction.
This next video explains Dijkstra’s Algorithm in the content of weighted graphs, and goes further into explanations of examples.
Shortest Path Problems
This video looks at how to solve shortest path problems.
Want to learn more? Check out more of our VCE Mathematics resources here!
