## Congrats, you completed all necessary steps! 
You implemented different functions that using BFS which may be useful for the Graph class. For now, the last tiny step is to think about some code reorganization and optimal usage.
 
You may notice that methods above usually contain similar code, and some methods can reuse others. For example, `hasOneComponent()` and `getComponents()` do the similar action, so we can combine them. 

### Let's go to the tasks!

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.

Congratulations

Congrats, you completed all necessary steps!

Let's go to the tasks!