Home
The App is an application of Percolation Theory in the square 2D lattice. A user sets a percolation probability and performs a percolation map on the square (256 x 256) lattice. The important concept here the existence of a percolation threshold at which there is a phase transition on the connectivity pattern of the system. This can be nicely seen by playing with different values around the threshold and performing a cluster analysis after percolation map is executed.
It uses the Hoshel-Kopelman algorithm (HK), to detect clusters in a percolation map of probability p. The HK algorithm is a version of the Union Find algorithm. The C language implementation of the HK algorithm is thanks to:
https://gist.github.com/tobin/909424
The code from this gist is mostly encapsulated in the "myHK.h" file of this repository. Read the README file for more details.