This repo is a naive code implement of paper "An Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game", mainly implements two functions, which are Find_Pebble
and Rearrange_Pebbles
in the paper.
The code is implemented strictly according to the algorithm provided in the paper. It is recommended to use pebbleGameClass.py
, the initial input is edges of a graph. If you need to input the adjacency table of a graph, you can refer to pebbleGame.py
.
TODO:
- Undo the
rearrange pebbles
process but not copy the whole graph - If an indenpendant edge added thus forms a rigid subgraph, the algorithm has a probability that the new rigid subgraph cannot be detected.
MIT License