Analyze the complexity of the Ford-Fulkerson algorithm. Understand its dependence on maximum flow value and why it can perform poorly on some graphs.