fn merge_regions(adjacency: &mut [BTreeMap<u32, Interface>], uf: &mut UnionFind)Expand description
Run the best-pair-first merge to exhaustion (§2.3).
On return the union-find holds, for every region, the number of turns separating it from its set’s representative.