[UVA][maxflow] 1242 - Necklace
A necklace in an undirected graph is a sequence of cycles
C1, C2,..., Ck(k1)
, satisfying the conditions below:
Any two cycles have no edges in common.
There is exactly one common vertex between two adjacent cycles Ci
and Ci+1
(1i < k)
Any two no...
