Package: cayleyR
Type: Package
Title: Cayley Graph Analysis for Permutation Puzzles
Version: 0.2.4
Authors@R: c(
    person(
      "Yuri", "Baramykov",
      email = "lbsbmsu@mail.ru",
      role = c("aut", "cre"),
      comment = c(ORCID = "0009-0000-7627-4217")
    )
  )
Description: 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++.
License: MIT + file LICENSE
Encoding: UTF-8
Roxygen: list(markdown = TRUE)
RoxygenNote: 7.3.3
Imports: Rcpp
LinkingTo: Rcpp
Suggests: testthat (>= 3.0.0), ggmlR, data.table
Config/testthat/edition: 3
URL: https://github.com/Zabis13/cayleyR
BugReports: https://github.com/Zabis13/cayleyR/issues
Repository: https://zabis13.r-universe.dev
Date/Publication: 2026-07-22 06:45:37 UTC
RemoteUrl: https://github.com/zabis13/cayleyr
RemoteRef: HEAD
RemoteSha: 33f0512a1678cddb7fc1ce8b099b6c364f8a564e
NeedsCompilation: yes
Packaged: 2026-07-22 08:03:52 UTC; root
Author: Yuri Baramykov [aut, cre] (ORCID:
    <https://orcid.org/0009-0000-7627-4217>)
Maintainer: Yuri Baramykov <lbsbmsu@mail.ru>