Hoshen–Kopelman algorithm: Difference between revisions

Revision as of 21:34, 22 September 2016

Revision as of 21:36, 22 September 2016

Line 1:

{{Refimprove|date=September 2016}}

{{Machine learning bar}}

The '''Hoshen–Kopelman algorithm''' is simple and efficient [[algorithm]] for labeling [[Cluster analysis|clusters]] on a grid. Where the grid is a regular network of cells,with the cells being either occupied or unoccupied. This algorithm is based on well-known [[Disjoint-set data structure|union-finding algorithm]]<ref> https://www.cs.princeton.edu/~rs/AlgsDS07/01UnionFind.pdf </ref>. The algorithm was originally described in by J. Hoshen and R. Kopelman in their 1976 paper <a href="http://journals.aps.org/prb/abstract/10.1103/PhysRevB.14.3438" target="_blank">Percolation and Cluster Distribution. I. Cluster Multiple Labeling Technique and Critical Concentration Algorithm"</a>.<ref>{{cite journal|url=http://link.aps.org/doi/10.1103/PhysRevB.14.3438|title=Percolation and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithm|first1=J.|last1=Hoshen|first2=R.|last2=Kopelman|date=15 October 1976|publisher=|journal=Phys. Rev. B|volume=14|issue=8|pages=3438–3445|via=APS|doi=10.1103/PhysRevB.14.3438}}</ref>

== Percolation theory ==