What is the shortest path?
The shortest path between two vertices in a network is the path where the sum of the weights of its edges is minimised. The following videos explain the concept of the shortest path and finding the shortest path in HSC Standard Math.