First, **Copy and Paste** the whole implemented class `Graph` to the Editor, and save it somewhere outside for safety.

BFS and BFT do the same action, too, but in `bfs()` we search until `end` vertex is found. Actually, we can pass unnecessary `end` node to the `bft()` and change algorithm a bit, but avoid using to almost the same functions `bfs()` and `bft()`.

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.

BFT and BFS