#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/dijkstra-s-algorithm

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/dijkstra-s-algorithm

Dijkstra's Algorithm

Lessons

1. Intro

2. Introducing Weights

3. The Greedy Strategy

Practice Problems

Ready to start learning?

4. The Priority Queue

5. Dijkstra's Algorithm - Setup

6. Dijkstra's Algorithm - The Loop

7. The Relaxation Step

8. Dijkstra - Implementation

9. Problem - Network Delay Time

10. Network Delay - Intuition

11. Network Delay - Implementation

12. Complexity of Dijkstra

13. Problem - Dijkstra?

14. Path Reconstruction in Dijkstra

15. Handling Large Weights

16. Problem - Path with Maximum Probability

17. Modifying Dijkstra

18. Problem - Cheapest Flights Within K Stops

19. Cheapest Flights - State Definition

20. Cheapest Flights - Algorithm

21. Cheapest Flights - Visited Set

22. Cheapest Flights - Implementation

23. Cheapest Flights - Lessons

24. Problem - Path with Minimum Effort

25. Minimum Effort - Minimax Path

26. Minimum Effort - Algorithm

27. Minimum Effort - Priority Queue

28. Minimum Effort - Implementation

29. Minimum Effort - Lessons

30. Problem - Flight Discount

31. Flight Discount - State Definition

32. Flight Discount - Algorithm

33. Flight Discount - Implementation

34. Flight Discount - Lessons

35. Section 22 Recap