... K2 K3 {4, 8} {3} {9, 2, 6} {4, 8} {3} {9, 2, 6} {4, 8} {3} {4, 8} K4 {} {} {9, 2, 6} {9, 2, 6, 3} {9, 2, 6, 3, 4, 8} {9, 2, 6, 3, 4, 8} K5 K6 {} {1, 7} {} {} {} {} {} {9, 2, 6, 3, 4, 8} {9, 2, ... edge it visits to the cycle C, which is then added to the Euler tour T , when we return from a call to V ISIT (u), all edges entering or leaving vertex u have been added to the tour When we advance ... B to the end of A, instead splice B into A right after the Þrst element of A We have to traverse B to update representative pointers anyway, so we can just make the last element of B point to...