Dijkstra's Algorithm

how to find shortest paths in weighted graphs using a greedy min-heap approach, trace the algorithm step by step, and understand why negative edges break it