This chapter analyzes flows and matchings. We will define flows and maximum
flows and present an algorithm that solves the maximum flow problem. Then matchings are
analyzed in order to prove that flows and matchings are closely related. We will result into the
fact that maximum flow algorithms can be used in order to find maximum matchings.