Discrete Math II - 10.6.1 Shortest Path Problems - Dijkstra's Algorithm
Описание
In this section, we focus on the application of weighted graphs and how to minimize the distance, time or cost of our graph based on those weights. Dijkstra's algorithm will be our guide in determining the paths of least weight. It is important to note that this does NOT provide us with a minimum spanning tree (MST), but simply the cheapest path from one vertex to EACH other vertex in our graph.
Video Chapters:
Intro 0:00
Weighted Graphs 0:09
Dijkstra's Algorithm 1:51
Dijkstra's Algorithm Step-by-Step 3:47
Dijkstra's Algorithm Practice 11:04
Up Next 18:17
This playlist uses Discrete Mathematics and Its Applications, Rosen 8e
Power Point slide decks to accompany the videos can be found here:
https://bellevueuniversity-my.sharepoint.com/:f:/g/personal/kbrehm_bellevue_edu/Ei9DcmrOBTlAuMxWUoq9ZqsB14M60jcpob-xdAYS6ruVWw?e=uP9KN0
The entire playlist can be found here:
https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ
Рекомендуемые видео
