Dijkstra's Algorithm
1. What is the time complexity of Dijikstra’s algorithm? (V is the number of vertices in the graph)
2. Which of the following data structure can help decrease the time complexity of Dijikstra’s algorithm?
3. Dijkstra’s Algorithm can also be used on graphs with negative weights.
4. Dijkstra’s Algorithm is used to find: