## 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 `k`th component.
- Return tuple of lists of vertex numbers, one list for each component. Create it by using an upgraded `visited` list.


This mini-course introduces the BFS Algorithm. It requires understanding the graph theory on base level, and Python programming language knowledge. This course is built on implementing step-by-step solutions and using `Graph` class implementation, so you have to understand Python OOP minimally. You have to be able to implement an algorithm by pseudocode.

Meet the BFS example and code, that you'll improve during the course.

Let's upgrade your code to make it faster and consistent.

Apply your knowledge to solve some algorithmic problems.

Find All Connected Components

BFS find all connected components