Breath First Search

Description:

• Explore all the shallowest nodes first then go down
• Fringe is a FIFO Queue
• Complete but no optimal
• Time complexity: $O(n^l)$
  • $n$ is nodes each layer
  • $l$ for nb of layers
• Space complexity: $O(n^l)$