Use the Maximum Flow algorithm to solve this problem.
Find the maximal flow from node A to node H (use maximum flow
algorithm only).
Briefly state the maximum flow and minimum cut theorem.
Check the answer by using maximum flow and minimum cut
theorem.
What is the minimum cut on the network?





