What is the time complexity of the Edmonds-Karp algorithm for finding the maximum flow in a network?

The time complexity of the Edmonds-Karp algorithm for finding the maximum flow in a network is O(VE2), where V is the number of vertices and E is the number of edges in the network.