A C++ implementation of the percolation problem

Write a program to estimate the value of the percolation threshold via Monte Carlo simulation.

Implementation of the one dimensional Contact Process (SIS model) and two dimensional SIR model in order to find critical exponents of Percolation.

MatLab implementation for Heshen-Kopelman cluster finding algorithm. The idea is having an efficient algorithm able to search for clusters in a NxN matrix and being able to find percolation thresholds plus some more interesting infos.

A percolation map over the lattice with probability p. At a critical probability, a connected (spanning cluster) emerges.

Slithering snake code from summer 2005 - http://pubs.acs.org/doi/abs/10.1021/nl0608386

An Implementation of WUFPC algorithm and its application in percolation threshold problem in C++ language.

The percolation threshold is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below the threshold a giant connected component does not exist; while above it, there exists a giant component of the order of system size. In engineering and coffee making, percolation represents t…

Analysis of Percolation in Square Lattice

Algorithm to calculate the number of anti-red-bonds in a cubic lattice

Percolation simulation of a N sized network with multi-threading in C++

Some Fortran codes that run classical site and bond percolation problems.

DSA implementations within the course of Algorithms and Advanced Data Structures (1DV516) at Linnaeus University, Autumn Semester 2022.

Just a couple of (mostly instructive) programming exercises

First programming assignment for Princeton's course "Algorithms, part I"

🎰 Monte Carlo simulation for percolation threshold web visualizer

A simple simulation for percolation on square lattices.