NAME
CM::Permutation::Cycle_Algorithm - An algorithm for finding the disjoint cycle decomposition of a permutation.
VERSION
version 0.94
uncover_cycle()
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.
str_decomposed()
Writes the permutation as a product of cycles and returns a string with this data.
run()
Returns an array containing all cycles of the permutation.
get_first_unmarked()
Gets the first unmarked element of the permutation(it's marked only if it's already found to be part of a cycle).
SEE ALSO
Abstract Algebra - David S. Dummit , Richard M. Foote , page 30
Combinatorial Topics Techniques Algorithms - Peter J. Cameron page 30
AUTHOR
Stefan Petrea, <stefan.petrea at gmail.com>