BFS find all connected components

Complicate the problem: find all components in a graph.

Some hints for you:

• When you’re done with the first component, save it, and start traversing again with some nodes that haven’t been visited yet.
• To split your components, you can use an upgraded visited list: put 0 if vertex is not visited yet, or put k if vertex is in kth component.
• Return tuple of lists of vertex numbers, one list for each component. Create it by using an upgraded visited list.