Thanks!

Let G = (V, A) be a directed graph with arc capacity Ua = 1 for each arc a E A. Suppose that the shortest length path in G from s to t contains exactly k arcs. Prove that (a) The maximum s - t flow has value O ). (b) The minimum capacity s - t cut has value (M.2). Let G = (V, A) be a directed graph with arc capacity Ua = 1 for each arc a E A. Suppose that the shortest length path in G from s to t contains exactly k arcs. Prove that (a) The maximum s - t flow has value O ). (b) The minimum capacity s - t cut has value (M.2)