What is the average running time of Dijkstra's algorithm for finding the shortest path in a graph?

The average running time of Dijkstra's algorithm for finding the shortest path in a graph is O(V2), where V is the number of vertices in the graph.