Dijkstra's Algorithm
1. Dijkstra’s algorithm cannot be applied on ____.
2. Dijkstra’s Algorithm is the prime example for ________.
3. Given a directed graph where the weight of every edge is the same, we can efficiently find the shortest path from a given source to destination using _______.
4. Which of the following algorithms can be used to efficiently calculate single source shortest paths in a Directed Acyclic Graph?