CM::Permutation::Cycle_Algorithm - An algorithm for finding the disjoint cycle decomposition of a permutation.
Given an element will apply the permutation to that element , then to the image of that element and so forth, yielding x,p(x),p(p(x)),... and after a finite number of iterations the number will return to x, this defines the cycle.
Writes the permutation as a product of cycles and returns a string with this data.
Returns an array containing all cycles of the permutation.
Gets the first unmarked element of the permutation(it's marked only if it's already found to be part of a cycle).
Abstract Algebra - David S. Dummit , Richard M. Foote , page 30
Combinatorial Topics Techniques Algorithms - Peter J. Cameron page 30
<stefan.petrea at gmail.com>