Learn Programming - Breadth First Search (BFS) - Finding the shortest path through a Maze!
I saw a few of you enjoyed my last post on DFS or Depth First Search, so I made a tutorial on it's sister algorithm Breadth First Search (BFS), check it out below:
Computer scientists say this algorithm is optimal, basically it finds the shortest path through a maze. This has many applications such as computer networking. You can read more about the applications of BFS here:
http://www.geeksforgeeks.org/applications-of-breadth-first-traversal/
In case you missed my last post on DFS, you can find it here:
https://steemit.com/technology/@josh-programming/learn-programming-depth-first-search-dfs-maze-solving-algorithm
Again, this tutorial is designed for absolute beginners so, if you don't understand something or need clarification, leave a comment below and I will answer as best I can! Thanks for welcoming me to the steemit community!
Congratulations @josh-programming! You have completed some achievement on Steemit and have been rewarded with new badge(s) :
Click on any badge to view your own Board of Honor on SteemitBoard.
For more information about SteemitBoard, click here
If you no longer want to receive notifications, reply to this comment with the word
STOP