/IF184401_DAA-E-_Q2_05111740000002_Bintang-Nuralamsyah_05111740000092_Tria-Nur-Aisyah-Amini

Pathfinding in Python with BFS implementation

Primary LanguagePython

IF184401_DAA-E-_Q2_05111740000002_Bintang-Nuralamsyah_05111740000092_Tria-Nur-Aisyah-Amini

PATH FINDING using Breadth First Search

One of the common applications of breadth first search is to perform path finding. Typically this is done in a 2D maze. The code below implements the breadth first search algorithm to traverse and find the shortest path out of a maze.

TUTORIAL

0. open the bfs.py inside QUIZ2PAA folder.
1. Edit the labyrinth inside buatlabirin function so it looks like your labyrinth.
2. Run the bfs.py