127,871 views 251 on YTPak
556 39

Published on 28 Mar 2014 | over 2 years ago

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.

Level 2
youtu.be/WOCV2UcxNrI

Loading related videos...