Hoshen–Kopelman algorithm: Difference between revisions

Revision as of 05:44, 11 September 2016

Revision as of 05:45, 11 September 2016

Line 1:

== Introduction ==

<div style="text-align:justify">

The 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 “[[http://journals.aps.org/prb/abstract/10.1103/PhysRevB.14.3438]| Percolation and Cluster Distribution. I. Cluster Multiple Labeling Technique and Critical Concentration Algorithm]] by J. Hoshen and R. Kopelman.

</div>