获取矩阵中非零邻居的距离

Can anyone tell me a smart way how to calculate the distance to the non-zero neighbors in a sparse matrix? The reason to do this is that I want to identify "holes" in a large, multidimensional matrix.Can anyone tell me a smart way how to calculate