engineering recuitment UKPSC Polytechnic Lecturer Mock Test 2024 Algorithms Graphs/Spanning Tree and Shortest Paths Shortest Paths
Consider a graph G(V, E) where V and E represent vertices and edges of a graph respectively. If the graph contains no negative weight edge. What is the time complexity of a Dijkstra's algorithm used with binary heaps?
1
O(V+E)
2
O((|E|+|V|) log V)
3
O(E - log V)
4
O(log|E+V|)