What is the time complexity of the Ford-Fulkerson algorithm?

The time complexity of the Ford-Fulkerson algorithm is O(E maxflow), where E is the number of edges in the graph and maxflow is the maximum flow in the graph.