Dijkstra’s Shortest Paths Algorithm for Graphs

This video describes how Dijkstra’s algorithm finds the shortest path between any two points in a graph with positive edge weights.