In this video we will learn to find the shortest path between two vertices using Dijkstra's Algorithm.
This tutorial consists of two levels. The concept we will learn in this video can be applied to find the shortest path between any two vertices, cities, etc.
The technique used in this video finds both the shortest path and the weight of the shortest path.
In level 1 we will work with a graph having 4 vertices.
In level 2 we will work with a graph having 6 vertices.