Q1.What problem does Dijkstra's algorithm solve?
Q2.Why does Dijkstra's algorithm fail on graphs with negative edge weights?
Q3.What data structure does an efficient implementation of Dijkstra's algorithm typically use?
Q4.What does a topological sort produce, and on what kind of graph does it apply?
