Input: graph , sink
Output: subproblem set
(1) find a cycle with minimum length by the MIN_CIRCUIT algorithm in [13], let be the edges of the cycle;
(2) ;
(3) foreach    do
(4)construct subproblem with as the network;
(5);
(6) ;
Algorithm 2: decompse_undirected_cycle.