Before revision:  By ``hopping'' iteratively to such larger cycles, we obtain a powerful and very general inductive motor for proving and computing long cycles (we will give an algorithm with running time O(n^2)).
After revision:  By ``hopping'' iteratively to such larger cycles, we obtain a powerful and very general inductive motor for proving long cycles and computing them (we will give an algorithm with running time O(n^2)).