reconstruct_bfs_path

Traces back from target_key to the root (start state) using the
parent_key/child_key edges in the BFS result.

Implements algorithms for analyzing Cayley graphs of permutation groups,
with a focus on the TopSpin puzzle and similar permutation-based combinatorial
puzzles. 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.
Optional GPU acceleration via 'ggmlR' Vulkan backend for batch distance
calculations and parallel state transformations.

Yuri Baramykov

cayleyR

Cayley Graph Analysis for Permutation Puzzles

reconstruct_bfs_path function

<dl><dt>bfs_result</dt>
<dd>data.frame returned by sparse_bfs()</dd>
<dt>target_key</dt>
<dd>Character string — state key to trace back from</dd></dl>

Arguments

Reconstruct path from sparse BFS result — reconstruct_bfs_path

<dl>

<dt>bfs_result</dt>
<dd>data.frame returned by sparse_bfs()</dd>


<dt>target_key</dt>
<dd>Character string — state key to trace back from</dd>

</dl>

reconstruct_bfs_path: Reconstruct path from sparse BFS result

Description

Usage

Value

Arguments