Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs