Solve a maze using a breadth-first search in Python

This video shows you how to find the length of the shortest path from the starting point to the ending point of a maze using a breadth-first search in Python 3.
Be sure to like, comment, and subscribe!
0:00 Explaining the algorithm
5:59 Implementing the algorithm
13:12 Testing the algorithm
Link to code for video:
gist.github.com/pr28416/f230c...
If you would like to see code that also returns the cells on the shortest path as a list, click here:
gist.github.com/pr28416/67a15...