Revision as of 22:46, 5 September 2016 edit Dssathe (talk \| contribs) 30 edits adding {{dashboard.wikiedu.org sandbox}} Tag: dashboard.wikiedu.org [2.0]		Revision as of 04:30, 11 September 2016 edit undo Dssathe (talk \| contribs) 30 edits Added introduction paragraph Tag: Visual edit Next edit →
Line 1: The Hoshen-Kopelman Algorithm is used for labeling 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 and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithm”[1] by J. Hoshen and R. Kopelman.{{dashboard.wikiedu.org sandbox}} ~~{{dashboard.wikiedu.org sandbox}}~~

Hoshen–Kopelman algorithm: Difference between revisions