Spanning Forest
#
Problem Specification#
Input, an undirected graph on vertices.
#
Output, a set of edges representing a spanning forest of .
#
Algorithm ImplementationsWe provide multiple implementations of spanning forest in GBBS. The primary implementation is based on the low-diameter decomposition based algorithm from Shun et al. [1].
The code for the primary implementation is available here.
#
Cost BoundsThe algorithm runs in expected work and depth w.h.p., and the proof can be found in the Shun et al. paper [1].
#
Compiling and RunningThe benchmark can be compiled by running:
It can then be run on a test input graph in the uncompressed format as follows:
It can then be run on a test input graph in the compressed format as follows:
#
References[1] Julian Shun, Laxman Dhulipala, and Guy Blelloch
A Simple and Practical Linear-Work Parallel Algorithm for Connectivity
Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 143-153, 2014.