## BFS searching shortest path
That was hard! But now let's implement a method to find the shortest path between two vertices, not only length.

To do that, you have to know for each node where did it come from. So, let's add list `pred` that contains predcessor for `i` node. At the beginning, `pred` contains only `-1`.

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.

Restoring Shortest Path

BFS searching shortest path