engineering recuitment UKPSC Polytechnic Lecturer Mock Test 2024 Algorithms Graphs/Spanning Tree and Shortest Paths Shortest Paths
What is the time complexity of Dijkstra’s algorithm for the single source shortest path problem?
1
O(n)
2
O(log2n)
3
O(n2)
4
O(n log2n)