Problem
Suppose D = (V; A) is a digraph and x is a positive vector indexed by A. The lecture presents a reduction from an elementary decomposition of x to an elementary decomposition of circulation in an augmented graph. Show that even if the augmented graph has more than m edges, the elementary decomposition of the circulation described in the lecture still consists of at most m circuits.