MCQs Graph Based Algorithms
1. Dijkstra’s algorithm : Has greedy approach to find all shortest paths Has both greedy and Dynamic approach to find all shortest paths Has greedy approach to compute single source shortest paths to all other vertices Has both greedy and…