Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm
This is the fourth in a series of computer science videos about the graph data structure. This is an explanation of Dijkstra’s algorithm for finding the shortest path between one vertex in a graph and another. Indeed, this explains how Dijkstra’s shortest path algorithm generates a set of information that includes the shortest paths from a starting vertex and every other vertex in the graph. It also mentions why Dijkstra’s shortest path algorithm is an example of a greedy algorithm.
On this page of the site you can watch the video online Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm with a duration of hours minute second in good quality, which was uploaded by the user Computer Science Lessons 07 May 2016, share the link with friends and acquaintances, this video has already been watched 1,523,893 times on youtube and it was liked by 23 thousand viewers. Enjoy your viewing!
