Given a graph G, we define a component C of G to be a subset of the vertices of G such that for any two vertices v and w in C, there exists a path between v and w.

In this graph, there are 4 components: {a, b, c, d, e, f}, {g, h, i, j}, {k, l}, and {m}

Back to the Parallel Mountain Climbers problem