Breadth First Search grid shortest path | Graph Theory

Finding the shortest path on a grid using the Breadth First Search (BFS) algorithm on an unweighted graph.

Support me by purchasing the full graph theory course on Udemy which includes additional problems, exercises and quizzes not available on YouTube:
https://www.udemy.com/course/graph-theory-algorithms

Algorithms repository:
https://github.com/williamfiset/algorithms

Video slides:
https://github.com/williamfiset/Algorithms/tree/master/slides

Dungeon master problem link:
https://open.kattis.com/problems/dungeon

Breadth-first search Intro:
https://youtu.be/oDqjPvD54Ss

Personal website:
http://www.williamfiset.com

I'm looking for volunteers to review early access versions of my video content pre-recording. If this is something that may interest you please join the following mailing list for further updates:
https://groups.google.com/forum/#!forum/williamfiset-youtube/join

===============================================================================
Developer tools I used in the creation/testing of the content in these videos:

1) Sublime text, my favorite lightweight code editor (https://www.sublimetext.com).
NOTE: I'm often asked about the color scheme I use, find it here: https://github.com/williamfiset/dotfiles/tree/master/sublime

2) Kite, a free AI-powered coding assistant that provides smart code completions while typing:
https://www.kite.com/get-kite/?utm_medium=referral&utm_source=youtube&utm_campaign=williamfiset&utm_content=description-only
===============================================================================

0:00 Previous Breadth first search video
0:44 Motivation for BFS on a grid
1:36 Converting your grid to an adjacency list/matrix
3:55 Grid vectors
6:09 Dungeon problem
7:51 Breadth first search on grid example
9:12 Using multiple queues for state representation
11:07 Pseudocode
15:56 Recap

Видео Breadth First Search grid shortest path | Graph Theory канала WilliamFiset