To compute the graph's connectivity, we first enumerate the edge set and then run a union-find algorithm.

When comparing different graph algorithms, we examined several edge sets to determine which produced the most efficient spanning tree.