The [[Priestly breastplate|Hoshen]]-Kopelman Algorithm is simple and efficient algorithm for labelling clusters on a grid, where grid is a regular network of cells, where each cell may be “occupied” or “unoccupied”. This algorithm is based on well-known union-finding algorithm. The algorithm was originally described in “[[Percolation theoryhttp://journals.aps.org/prb/abstract/10.1103/PhysRevB.14.3438|Percolation]] and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithm”[1algorithm]] by J. Hoshen and R. Kopelman.
