288,157 views
Dijkstra's algorithm for computing distances from a vertex in a weighted graph. This video illustrates the main steps, on a directed graph. This algorithm is more general than breadth-first traversal, which only deals with unweighted graphs.