engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Graphs/Spanning Tree and Shortest Paths Shortest Paths
Dijkstra’s algorithm follows _____ method of algorithm design. The complexity of the algorithm to find the shortest path from a vertex to all other vertices in a graph is ______>
1
Dynamic programming, O (n2)
2
Dynamic programming, O (log n)
3
Greedy, O (n2)
4
Greedy, O(log n)