Package: cayleyR 0.2.4

cayleyR: Cayley Graph Analysis for Permutation Puzzles

Implements algorithms for analyzing Cayley graphs of permutation groups for the TopSpin puzzle. Provides methods for cycle detection, state space exploration, bidirectional BFS pathfinding, and finding optimal operation sequences in permutation groups generated by shift and reverse operations. Includes C++ implementations of core operations via 'Rcpp' for performance, including a depth-limited BFS path shortener and a human-style solver that grows a sorted run and finishes the tail with derived cycle primitives, both implemented entirely in C++.

Authors:Yuri Baramykov [aut, cre]