Lecture Design and Analysis of Algorithms: Lecture 39 - Dr. Sohail Aslam
Lecture Design and Analysis of Algorithms: Lecture 39 - Dr. Sohail Aslam
Dijkstra’s algorithm is a simple greedy algorithm for computing the single-source shortest-paths to all other vertices. Dijkstra’s algorithm works on a weighted directed graph G = (V, E) in which all edge weights are non-negative, i.e., w(u, v) ≥ 0 for each edge (u, v) ∈ E. In this lecture, you find clear explanations of Dijkstra’s Algorithm.