Page history
Jump to navigation
Jump to search
6 May 2023
no edit summary
+79
→Example C++ code
−469
→USACO problems for BFS
+247
no edit summary
−313
→USACO problems for BFS
−10
→USACO problems for BFS
+320
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..."
+2,821