concept small reachability distance in category algorithms

appears as: smallest reachability distce
Algorithms and Data Structures in Action

This is an excerpt from Manning's book Algorithms and Data Structures in Action.

#9 We are creating a new cluster, so we can increment the index of current cluster. This implementation doesn’t worry about having all cluster’s indices as consecutive integers: in other words, whenever we find out that p is an outlier, we skip current index. This can be easily fixed, for instance by using a Boolean flag.