What is the time complexity of finding the shortest path in a graph using Dijkstra’s algorithm with a min-heap? - Study24x7
Social learning Network

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
4 followers study24x7 20 Nov 2025 01:28 PM study24x7 study24x7

What is the time complexity of finding the shortest path in a graph using Dijkstra’s algorithm with a min-heap?

A

O(V²)

B

O(V + E log V)

C

O(E²)

D

O(E log E)

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles