Percolation simulator

This is percolation ¹ simulation in rust. Will create output.png file in folder it was executed

Basic percolation is achieved like this:

• take grid graph of sides NxM
• remove edges of graph with some probability p
• find connected-components of leftover graph ²

This code supposed to output image of colored connected-components similar to that found in the video³.

Examples of different visualizations.

first one is modulo times some primes in rgb and second one is grayscale in order of occurrence

Sources

Footnotes

1. Wikipedia article about percolation: Percolation theory ↩

2. Algorithm for labeling connected-components: Connected-component labeling Two-pass ↩

3. Inspired by Percolation a Mathematical Phase Transition ↩