What is an example of a maximum network flow problem and how is it solved?

An example of a maximum network flow problem is determining the maximum amount of water that can flow through a network of pipes. This problem can be solved using algorithms like Ford-Fulkerson or Edmonds-Karp, which iteratively find the maximum flow by augmenting paths in the network until no more flow can be added.