 and guiding solutions. These computations amount to determining a set of moves that should be applied to the initial solution to reach the guiding solution. Each move is characterized by a pair of 0-paths, one to be inserted and the other to be eliminated from the current solution. 