This final clustering allows us to send less information between processors than if we had simply used all contact pairs, leading to more efficient parallelization. Note that we could use any algorithm for constructing the hair adjacency graph as long as it produces good communication patterns between processors.