label Subroutine

public subroutine label(matrix, labelled_matrix, num_labels)

Alternative interface to the Hoshen-Kopelman algorithm from the hk module, which uses a binary matrix created by create_binary_matrix.

Arguments

Type IntentOptional AttributesName
logical, intent(in), dimension(:,:):: matrix

Binary matrix where clusters will be identified.

integer, intent(out), dimension(:,:), allocatable:: labelled_matrix

Integer matrix which will store the labels of each cluster. Reallocated if necessary.

integer, intent(out) :: num_labels

Overwritten with the total number of disjoint clusters.


Calls

proc~~label~~CallsGraph proc~label label proc~hoshen_kopelman hoshen_kopelman proc~label->proc~hoshen_kopelman proc~uf_find uf_find proc~hoshen_kopelman->proc~uf_find proc~uf_union uf_union proc~hoshen_kopelman->proc~uf_union proc~uf_union->proc~uf_find

Called by

proc~~label~~CalledByGraph proc~label label proc~probability_distribution probability_distribution proc~probability_distribution->proc~label proc~random_walkers random_walkers proc~random_walkers->proc~label proc~cluster_number_density cluster_number_density proc~cluster_number_density->proc~label

Contents

None