You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
protonexus/classes/algorithms/breadth_first_search.md

5 lines
330 B

# Breadth First Search
##### from [[algorithms]]
A breadth first search is a simple algorithm that traverses a [[graphs|graph]] by looking at all of the items that the starting position can access, and expanding from there. This is frequently implemented alongside a queue to allow for FIFO management of the observed elements.