Hoshen–Kopelman algorithm: Difference between revisions

Revision as of 05:03, 12 September 2016

Revision as of 05:05, 12 September 2016

Line 7:

{{Primary sources|date=September 2016}}

}}

The Hoshen-Kopelman Algorithm is simple and efficient algorithm for labeling [[Cluster_analysis | clusters]] on a grid, where grid is a regular network of cells, where each cell may be <strong>occupied</strong> or <strong>unoccupied</strong>. 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.<ref>http://journals.aps.org/prb/abstract/10.1103/PhysRevB.14.3438</ref>

== Percolation Theory ==

Line 68:

== References ==

<ref>http://journals.aps.org/prb/abstract/10.1103/PhysRevB.14.3438</ref>

{{Uncategorized|date=September 2016}}