For a pair of vertices V i and V j input to the algorithms, it can be observed that the actual merge occurs on the vertices within the neighborhood of V i , V j and not on the vertices themselves.
in order to cover as much graph as quickly as possible, the easiest strategy is to pick V i , V j in decreasing order of degree.