0
What is the time complexity of Dijkstra's algorithm using a binary heap (min-priority queue) for a graph with V vertices and E edges?
- AO(V²)
- BO(E log V)
- CO(V log V)
- DO(E + V)
Correct answer: B
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!