Hoshen–Kopelman algorithm: Difference between revisions

Revision as of 18:05, 15 June 2018

Revision as of 21:28, 18 June 2018

Line 26:

On the other hand,if the current cell has no neighbors, it is assigned a new, previously unused, label. The entire grid is processed in this way.

Following [[Pseudocode|pseudo-code]] is referred from [https://www.ocf.berkeley.edu/~fricke/ Tobin Fricke's] implementation of the same algorithm.<ref name=":0">{{cite web|url=https://www.ocf.berkeley.edu/~fricke/projects/hoshenkopelman/hoshenkopelman.html |title=The Hoshen-Kopelman Algorithm for cluster identification|first=Tobin |last=Fricke |website=Ocfocf.berkeley.edu |date=2004-04-21 |accessdate=2016-09-17}}</ref>

'''Raster Scan and Labeling on the Grid'''

largest_label = 0;