Let a and v be any two distinct nodes of an undirected graph G, which is k-connected. A container C(u, v) between a and v is a set of internally disjoint paths {P-1, P-2,..., P-W} between a and v where 1 <= w <= k. The width of C(u, v) is w and the length
