Analyze the complexity of the Edmonds-Karp algorithm. Understand how using BFS guarantees a polynomial time complexity for maximum flow problems.