What is the time complexity of Dijkstra's algorithm with a Fibonacci heap?

What is the time complexity of Dijkstra's algorithm with a Fibonacci heap?

Approach: Analyze priority queue operations.

O(E + V log V), where E is the number of edges and V is the number of vertices.

Follow-up: Why is it rarely used in practice despite better theoretical complexity?

Key concepts: priority queue, shortest path.