Скачать с ютуб Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm в хорошем качестве

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.