Graph Theory | Dijkstra's Shortest Path Algorithm

Lukas Vyhnalek, Former SAP Employee

Play Speed
  • 0.5x
  • 1x (Normal)
  • 1.25x
  • 1.5x
  • 2x
2 Videos (14m)
    • Graph

      5:17
    • Dijkstra's Shortest Path Algorithm

      9:04

About This Class

I explain what graph is, how is it made what, types of graphs do we have (oriented, unoriented) and then I show you how Dijkstra's shortest path algorithm works on an example.