fastttttttt

2. Recall that a flow network consists of a graph, non-negative capacities C(u, v) and C(v, u) for each edge (u, v) of the graph, and two vertices s and t. Consider a flow network G and let f* be a maxflow in it. Our goal here is to determine whether f* is the unique maxflow in G. Let H. be the augmentation graph of the flow f*. Recall that (u, v) is a directed edge in the augmentation graph if and only if f*(u, v)