https://wiki.omnivision.website/index.php?action=history&feed=atom&title=4.2.3.1_Breadth-First_Search_%28BFS%29 2026-07-04T00:32:00Z Revision history for this page on the wiki MediaWiki 1.43.9 https://wiki.omnivision.website/index.php?title=4.2.3.1_Breadth-First_Search_(BFS)&diff=436&oldid=prev 2025-07-11T22:37:14Z

<p>Created page with &quot;=== 4.2.3.1 Breadth-First Search (BFS) === &#039;&#039;(Difficulty Note: Analogies help here. The &quot;layers&quot; concept is important.)&#039;&#039; &#039;&#039;&#039;Breadth-First Search (BFS)&#039;&#039;&#039; is like exploring a maze by finding everything that&#039;s one step away from you, then everything two steps away, then everything three steps away, and so on. It explores &quot;layer by layer.&quot; &#039;&#039;&#039;How it works (simplified):&#039;&#039;&#039; # Start at a specific point (node). # Visit all its direct neighbors (nodes one step away). # Then,...&quot;</p> <p><b>New page</b></p><div>=== 4.2.3.1 Breadth-First Search (BFS) ===<br /> &#039;&#039;(Difficulty Note: Analogies help here. The &quot;layers&quot; concept is important.)&#039;&#039;<br /> <br /> &#039;&#039;&#039;Breadth-First Search (BFS)&#039;&#039;&#039; is like exploring a maze by finding everything that&#039;s one step away from you, then everything two steps away, then everything three steps away, and so on. It explores &quot;layer by layer.&quot;<br /> <br /> &#039;&#039;&#039;How it works (simplified):&#039;&#039;&#039;<br /> <br /> # Start at a specific point (node).<br /> # Visit all its direct neighbors (nodes one step away).<br /> # Then, visit all the neighbors of those neighbors (nodes two steps away), but make sure you haven&#039;t visited them already.<br /> # Keep expanding outwards, layer by layer, until you find what you&#039;re looking for or visit every reachable node.<br /> <br /> &#039;&#039;&#039;Example:&#039;&#039;&#039; Imagine finding the closest friends of your friends on a social network. BFS would find all your direct friends first, then all their direct friends, and so on.<br /> <br /> &#039;&#039;&#039;When is it used?&#039;&#039;&#039; BFS is great for finding the shortest path in terms of the number of steps (or connections) between two points, or for finding all reachable nodes in a network. It&#039;s used in social media (finding connections), network routing (finding the quickest path by hops), and web crawlers (indexing web pages).<br /> <br /> &#039;&#039;&#039;Bibliography:&#039;&#039;&#039;<br /> <br /> * &#039;&#039;&#039;Breadth-First Search (BFS).&#039;&#039;&#039; (2025, March 4). &#039;&#039;GeeksforGeeks&#039;&#039;. Retrieved July 11, 2025, from https://www.geeksforgeeks.org/python/python-program-for-breadth-first-search-or-bfs-for-a-graph/<br /> * &#039;&#039;&#039;Breadth-first Search (BFS) Algorithm.&#039;&#039;&#039; (2024, December 22). &#039;&#039;Interview Kickstart&#039;&#039;. Retrieved July 11, 2025, from https://interviewkickstart.com/blogs/learn/breadth-first-search-algorithm<br /> <br /> &#039;&#039;&#039;Further Reading:&#039;&#039;&#039;<br /> <br /> * &#039;&#039;&#039;What is Breadth First Search?&#039;&#039;&#039; (n.d.). &#039;&#039;Educative.io&#039;&#039;. Retrieved from https://how.dev/answers/what-is-breadth-first-search</div>

Mr. Goldstein