How shahkrapi/solving-rubik-s-cube-using-graph-thoery works
This repository describes a Rubik’s Cube solver that explores cube states using breadth-first and depth-first search, then uses a hash table to identify a match and returns the solution path stored during search. The README documents the algorithm but no source excerpts are available, so the graph shows only those documented relationships; component paths point to the sole source file in the tree.
Main entry points: final.cp Cube solver
Components 7
State search
- Cube solver
final.cp - Breadth-first search
final.cp - Limited depth-first search
final.cp
State matching
- Hash lookup
final.cp
Solution output
- Node solution path
final.cp - Cube solution
final.cp
Other components
- Cube solver user
Connections 6
- Cube solver user → Cube solver: provides cube
- Cube solver → Breadth-first search: uses shallow search
- Cube solver → Limited depth-first search: uses parallel search
- Cube solver → Hash lookup: checks match
- Cube solver → Node solution path: retains path
- Node solution path → Cube solution: provides