We extend the Hoshen–Kopelman (HK) algorithm for cluster labeling to non-lattice environments, where sites are placed at random at non-lattice points. This extension is useful for continuum systems and disordered networks. Our extension of the HK algorithm relies on several data structures...