Discrete Math II - 10.6.1 Shortest Path Problems - Dijkstra's Algorithm
![](https://i.ytimg.com/vi/Erea1QASjXY/mqdefault.jpg)
14:33
Discrete Math II - 10.8.1 Graph Coloring
![](https://i.ytimg.com/vi/bZkzH5x0SKU/mqdefault.jpg)
8:24
Dijkstras Shortest Path Algorithm Explained | With Example | Graph Theory
![](https://i.ytimg.com/vi/IdJpOaY99Hs/mqdefault.jpg)
11:41
[Discrete Mathematics] Dijkstra's Algorithm
![](https://i.ytimg.com/vi/XB4MIexjvY0/mqdefault.jpg)
18:35
3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method
![](https://i.ytimg.com/vi/E-iPr97wYqU/mqdefault.jpg)
17:37
Discrete Math II - 10.5.1 Euler Paths and Circuits
![](https://i.ytimg.com/vi/EFg3u_E6eHU/mqdefault.jpg)
8:31
How Dijkstra's Algorithm Works
![](https://i.ytimg.com/vi/j0OUwduDOS0/mqdefault.jpg)
13:18
Shortest Path Algorithms Explained (Dijkstra's & Bellman-Ford)
![](https://i.ytimg.com/vi/pVfj6mxhdMw/mqdefault.jpg)
10:52