Finding maximum flow through a network

This is an alternative to the minimum cut/maximum flow theorem to find the maximum flow through a network. It seems more intuitive and less error-prone than trying to list all cuts and find the capacity of each one.