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.

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

Video slides:
https://github.com/williamfiset/Algor...

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

Breadth-first search Intro:
   • Breadth First Search Algorithm | Shor...  

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

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

=====================================

Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: https://amzn.to/3cvMof5

A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: https://amzn.to/3wC2nix

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-th...