Find disjoint sets of vertexes in a Graph

Question

I want to find a simple method to generate sets of disjoint parts in a Graph. In other words, in the following Graph, I want to get two sets of {A, B, C, D} and {E, F}.

Answer 1

You can use any graph traversal algorithm ( BFS and DFS are the most common).

Whenever the algorithm is "stuck" (there is no more nodes to traverse), you have finished finding one component, mark it, and choose a random vertex that was not traversed yet to find the next component.