What is the time complexity of Dijkstra's algorithm when using a priority queue data structure?

The time complexity of Dijkstra's algorithm with a priority queue data structure is O((V E) log V), where V is the number of vertices and E is the number of edges in the graph.