CayleyPy API Reference
Core classes and functions
|
Mathematical definition of a CayleyGraph. |
|
Represents a Schreier coset graph for some group. |
|
Path in a Cayley graph. |
|
Finds path from |
Graphs library
Pre-defined Cayley graphs for permutation groups (S_n). |
|
Pre-defined Cayley graphs for matrix groups. |
|
Definitions of graphs describing various puzzles. |
|
Library of puzzles defined in GAP format. |
|
|
Creates CayleyGraph. |
|
Returns pre-defined CayleyGraphDef by codename and additional kwargs. |
Beam search and ML
|
Estimates distance from central state to given states. |
Beam search algorithm for finding paths in Cayley graphs. |
|
|
Result of running beam search on a Cayley graph. |
Generator for random walks on Cayley graphs. |
|
|
Configuration used to describe ML model. |
|
Converts states to sequences of tokens, one token per group of consecutive elements of a state. |
|
Multi-layer perceptron model. |
|
Multi-layer perceptron with residual (skip) connections. |
|
Computes hash of the mathematical definition of a graph. |
|
Saves weights of a model together with the config describing this model. |
|
Loads model from a checkpoint written by |
Training
Base class for losses used to train distance-estimating models. |
|
Mean squared error loss. |
|
|
Pinball (quantile) loss, which penalizes underestimation and overestimation differently. |
|
Creates loss by name. |
BFS algorithm and its variations
Basic version of the bread-first search (BFS) algorithm. |
|
Multi-GPU breadth-first search implementation. |
|
|
Result of running breadth-first search on a Schreier coset graph. |
|
Version of BFS storing all vertices explicitly as bitmasks, using 3 bits of memory per state. |
|
Simple version of BFS (from destination_state) using numpy, optimized for memory usage. |
|
Interactive breadth-first search that computes layers one by one. |
Meet-in-the middle (MITM) algorithm for path finding. |