What is the maximal flow problem in a network?

Explain the Ford-Fulkerson algorithm. Why must this algorithm terminate if the initial flow is set to zero and all arc capacities are rational numbers?