1,048
edits
Breadth-First Search: Difference between revisions
Jump to navigation
Jump to search
→USACO problems for BFS
(Created page with "= Breadth-First Search (BFS) = Breadth-First Search (BFS) is an algorithm for searching a tree or graph data structure for a node that meets a set of criteria. It starts at the tree’s root or graph and searches/visits all nodes at the current depth level before moving on to the nodes at the next depth level. <ref name=“geeksforgeeks”>https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/</ref> == How it works == BFS uses a queue data structure to...") |
|||
| Line 100: | Line 100: | ||
Here are some USACO problems that can be solved using BFS: | Here are some USACO problems that can be solved using BFS: | ||
Cow Navigation | - [[http://www.usaco.org/index.php?page=viewproblem2&cpid=713|Cow Navigation]] | ||
Milk Pails | - [[http://www.usaco.org/index.php?page=viewproblem2&cpid=615|Milk Pails]] | ||
MooTube | - [[http://www.usaco.org/index.php?page=viewproblem2&cpid=788|MooTube]] | ||
Moocast | - [[http://www.usaco.org/index.php?page=viewproblem2&cpid=668|Moocast]] | ||
The Bucket List | - [[http://www.usaco.org/index.php?page=viewproblem2&cpid=856|The Bucket List]] | ||