Practice40 min
Practice: Shortest & Cheapest
Classic Dijkstra, Prim's MST, and hop-limited Bellman-Ford.
Network Delay Time is the textbook Dijkstra. Min Cost to Connect All Points swaps the priority to single-edge weight (Prim's), and Cheapest Flights forces Bellman-Ford rounds because of the stop limit.