Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Breadth-First Search

  • Breadth-First Search (BFS) begins at the root node and explore level-wise al the branches
  • BFS is complete
    • If there is a solution, BFS will found it
  • BFS is optimal
    • The solution found is guaranteed to be the shortest path possible
  • The algorithm can be implemented with a First In First Out (FIFO) stack

Speaker notes:

Content Tools


There are currently no sources for this slide.