The latest articles on DEV Community by Nicko Cruz M (@nickocruzm). https://dev.to/nickocruzm https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1538895%2F2b81718b-b3ba-45f2-b408-39f161c4c711.jpeg https://dev.to/nickocruzm en Nicko Cruz M Fri, 21 Jun 2024 02:29:52 +0000 https://dev.to/nickocruzm/breadth-first-search-178c https://dev.to/nickocruzm/breadth-first-search-178c <p><em>This is a submission for <a href="https://dev.to/challenges/cs">DEV Computer Science Challenge v24.06.12: One Byte Explainer</a>.</em></p> <h2> Explainer </h2> <p>I want to find something in my strange house, that has n-floors. I must check all the rooms on the curr floor if I find it then I'm done. If I don't find it in any of the rooms on that floor then, AND ONLY THEN, will I go down to the next floor. </p> <h2> Additional Context </h2> <p>This is my attempt to explain BFS using the <code>strange house</code> that is (n) stories tall to act as a representation of the tree data structure. The given example is meant to emphasize the BREADTH in breadth-first search.</p> <p>When studying algorithms in college it is obvious, in hindsight, the differences between DFS and BFS. However, during undergraduate studies, it is easy for the obvious to become obscured.</p> <p>With this in mind, I wanted to focus on what makes the Breadth-first approach different from other approaches, which is the fact that this algorithm searches all nodes at the current depth, before traversing nodes at a deeper levels.</p> devchallenge cschallenge computerscience beginners