What is the meaning of 'breadth' in breadth first search? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Unique path in a directed graphWhen would best first search be worse than breadth first search?Dijkstra algorithm vs breadth first search for shortest path in graphHow do we generate a depth-first forest from the Depth First Search?Time complexity of Depth First SearchBreadth First Search actually require specifically Queue instead of any other type of Collection?Understanding connection between minimum spanning tree, shortest path, breadth first and depth first traversalProof that G is a Tree After DFS and BFS form the same tree TDijkstra’s versus Lowest-cost-first (best first), resolving some contradictions regarding complexity analysisIs Breadth First Search Space Complexity on a Grid different?

What's the meaning of "fortified infraction restraint"?

Why does it sometimes sound good to play a grace note as a lead in to a note in a melody?

Why is Nikon 1.4g better when Nikon 1.8g is sharper?

Maximum summed subsequences with non-adjacent items

What would you call this weird metallic apparatus that allows you to lift people?

How to play a character with a disability or mental disorder without being offensive?

Selecting user stories during sprint planning

Why do we bend a book to keep it straight?

Significance of Cersei's obsession with elephants?

Question about debouncing - delay of state change

How to write the following sign?

A term for a woman complaining about things/begging in a cute/childish way

What do you call the main part of a joke?

Why weren't discrete x86 CPUs ever used in game hardware?

An adverb for when you're not exaggerating

Is it a good idea to use CNN to classify 1D signal?

Project Euler #1 in C++

What is the appropriate index architecture when forced to implement IsDeleted (soft deletes)?

How could we fake a moon landing now?

How to compare two different files line by line in unix?

If Windows 7 doesn't support WSL, then what does Linux subsystem option mean?

Time to Settle Down!

What is the difference between globalisation and imperialism?

Do any jurisdictions seriously consider reclassifying social media websites as publishers?



What is the meaning of 'breadth' in breadth first search?



Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)
Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?Unique path in a directed graphWhen would best first search be worse than breadth first search?Dijkstra algorithm vs breadth first search for shortest path in graphHow do we generate a depth-first forest from the Depth First Search?Time complexity of Depth First SearchBreadth First Search actually require specifically Queue instead of any other type of Collection?Understanding connection between minimum spanning tree, shortest path, breadth first and depth first traversalProof that G is a Tree After DFS and BFS form the same tree TDijkstra’s versus Lowest-cost-first (best first), resolving some contradictions regarding complexity analysisIs Breadth First Search Space Complexity on a Grid different?










1












$begingroup$


I was learning about breadth first search and a question came in my mind that why BFS is called so. In the book Introduction to Algorithms by CLRS, I read the following reason for this:




Breadth-first search is so named because it expands the frontier
between discovered and undiscovered vertices uniformly across the
breadth of the frontier.




However, I'm not able to understand the meaning of this statement. I'm confused about this word "frontier" and breadth of that frontier.



So, can someone please answer this question in a way which is easy to understand for a beginner like me?










share|cite|improve this question











$endgroup$
















    1












    $begingroup$


    I was learning about breadth first search and a question came in my mind that why BFS is called so. In the book Introduction to Algorithms by CLRS, I read the following reason for this:




    Breadth-first search is so named because it expands the frontier
    between discovered and undiscovered vertices uniformly across the
    breadth of the frontier.




    However, I'm not able to understand the meaning of this statement. I'm confused about this word "frontier" and breadth of that frontier.



    So, can someone please answer this question in a way which is easy to understand for a beginner like me?










    share|cite|improve this question











    $endgroup$














      1












      1








      1





      $begingroup$


      I was learning about breadth first search and a question came in my mind that why BFS is called so. In the book Introduction to Algorithms by CLRS, I read the following reason for this:




      Breadth-first search is so named because it expands the frontier
      between discovered and undiscovered vertices uniformly across the
      breadth of the frontier.




      However, I'm not able to understand the meaning of this statement. I'm confused about this word "frontier" and breadth of that frontier.



      So, can someone please answer this question in a way which is easy to understand for a beginner like me?










      share|cite|improve this question











      $endgroup$




      I was learning about breadth first search and a question came in my mind that why BFS is called so. In the book Introduction to Algorithms by CLRS, I read the following reason for this:




      Breadth-first search is so named because it expands the frontier
      between discovered and undiscovered vertices uniformly across the
      breadth of the frontier.




      However, I'm not able to understand the meaning of this statement. I'm confused about this word "frontier" and breadth of that frontier.



      So, can someone please answer this question in a way which is easy to understand for a beginner like me?







      graphs graph-theory shortest-path graph-traversal






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 1 hour ago







      DG4

















      asked 2 hours ago









      DG4DG4

      1135




      1135




















          1 Answer
          1






          active

          oldest

          votes


















          3












          $begingroup$

          Consider the data structure used to represent the search. In a BFS, you use a queue. If you come across an unseen node, you add it to the queue.



          The “frontier” is the set of all nodes in the search data structure. The queue will will iterate through all nodes on the frontier sequentially, thus iterating across the breadth of the frontier. DFS will always pop the most recently discovered state off of the stack, thus always iterating over the deepest part of the frontier.



          Consider the image below. Notice how the DFS goes straight to the deepest parts of the tree whereas BFS iterates over the breadth of each level.



          dfs bfs



          Image here






          share|cite|improve this answer








          New contributor




          Bryce Kille is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.






          $endgroup$













            Your Answer








            StackExchange.ready(function()
            var channelOptions =
            tags: "".split(" "),
            id: "419"
            ;
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function()
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled)
            StackExchange.using("snippets", function()
            createEditor();
            );

            else
            createEditor();

            );

            function createEditor()
            StackExchange.prepareEditor(
            heartbeatType: 'answer',
            autoActivateHeartbeat: false,
            convertImagesToLinks: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            bindNavPrevention: true,
            postfix: "",
            imageUploader:
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            ,
            onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            );



            );













            draft saved

            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f107187%2fwhat-is-the-meaning-of-breadth-in-breadth-first-search%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            3












            $begingroup$

            Consider the data structure used to represent the search. In a BFS, you use a queue. If you come across an unseen node, you add it to the queue.



            The “frontier” is the set of all nodes in the search data structure. The queue will will iterate through all nodes on the frontier sequentially, thus iterating across the breadth of the frontier. DFS will always pop the most recently discovered state off of the stack, thus always iterating over the deepest part of the frontier.



            Consider the image below. Notice how the DFS goes straight to the deepest parts of the tree whereas BFS iterates over the breadth of each level.



            dfs bfs



            Image here






            share|cite|improve this answer








            New contributor




            Bryce Kille is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.






            $endgroup$

















              3












              $begingroup$

              Consider the data structure used to represent the search. In a BFS, you use a queue. If you come across an unseen node, you add it to the queue.



              The “frontier” is the set of all nodes in the search data structure. The queue will will iterate through all nodes on the frontier sequentially, thus iterating across the breadth of the frontier. DFS will always pop the most recently discovered state off of the stack, thus always iterating over the deepest part of the frontier.



              Consider the image below. Notice how the DFS goes straight to the deepest parts of the tree whereas BFS iterates over the breadth of each level.



              dfs bfs



              Image here






              share|cite|improve this answer








              New contributor




              Bryce Kille is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
              Check out our Code of Conduct.






              $endgroup$















                3












                3








                3





                $begingroup$

                Consider the data structure used to represent the search. In a BFS, you use a queue. If you come across an unseen node, you add it to the queue.



                The “frontier” is the set of all nodes in the search data structure. The queue will will iterate through all nodes on the frontier sequentially, thus iterating across the breadth of the frontier. DFS will always pop the most recently discovered state off of the stack, thus always iterating over the deepest part of the frontier.



                Consider the image below. Notice how the DFS goes straight to the deepest parts of the tree whereas BFS iterates over the breadth of each level.



                dfs bfs



                Image here






                share|cite|improve this answer








                New contributor




                Bryce Kille is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                Check out our Code of Conduct.






                $endgroup$



                Consider the data structure used to represent the search. In a BFS, you use a queue. If you come across an unseen node, you add it to the queue.



                The “frontier” is the set of all nodes in the search data structure. The queue will will iterate through all nodes on the frontier sequentially, thus iterating across the breadth of the frontier. DFS will always pop the most recently discovered state off of the stack, thus always iterating over the deepest part of the frontier.



                Consider the image below. Notice how the DFS goes straight to the deepest parts of the tree whereas BFS iterates over the breadth of each level.



                dfs bfs



                Image here







                share|cite|improve this answer








                New contributor




                Bryce Kille is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                Check out our Code of Conduct.









                share|cite|improve this answer



                share|cite|improve this answer






                New contributor




                Bryce Kille is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                Check out our Code of Conduct.









                answered 1 hour ago









                Bryce KilleBryce Kille

                565




                565




                New contributor




                Bryce Kille is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                Check out our Code of Conduct.





                New contributor





                Bryce Kille is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                Check out our Code of Conduct.






                Bryce Kille is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                Check out our Code of Conduct.



























                    draft saved

                    draft discarded
















































                    Thanks for contributing an answer to Computer Science Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid


                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.

                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f107187%2fwhat-is-the-meaning-of-breadth-in-breadth-first-search%23new-answer', 'question_page');

                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    Popular posts from this blog

                    Isurus Índice Especies | Notas | Véxase tamén | Menú de navegación"A compendium of fossil marine animal genera (Chondrichthyes entry)"o orixinal"A review of the Tertiary fossil Cetacea (Mammalia) localities in wales port taf Museum Victoria"o orixinalThe Vertebrate Fauna of the Selma Formation of Alabama. Part VII. Part VIII. The Mosasaurs The Fishes50419737IDsh85068767Isurus2548834613242066569678159923NHMSYS00210535017845105743

                    Wolfenstein 3D Contents Availability Essential improvements Game data Video settings Input settings Audio settings Network VR support Issues fixed Other information System requirements NotesReferences    3D Realms Wolfenstein 3D pageGOG.com Community DiscussionsGOG.com Support PageSteam Community DiscussionsWolfenstein WikiOfficial websiteAmazon.comBethesda.netGamersGateGOG.comGreen Man GamingHumble StoreSteamweb browser versionWolfenstein 3D: Super UpgradesherehereUltraWolfhereWolfMenuECWolf Wolf4SDL WolfGL WinWolf3d NewWolf BetterWolf Sprite Fix and Rotation Project    Wolfenstein 3D VRSplitWolfWolfenstein 3D VRWolfenstein 3D VRWolfenstein 3D VR4DOS command shellFreeDOS's MORE.COMMacBin themthis shim fileWine regeditRELEASE: QUAKE II + III, WOLFENSTEIN 3D, RETURN TO CASTLE WOLFENSTEIN - GOG.com NewsMac Family - Wolfenstein Wiki - WikiaNerdly Pleasures: How many FPS? - DOS Games and Framerates

                    Король Коль Исторические данные | Стихотворение | Примечания | Навигацияверсии1 правкаверсии1 правкаA New interpretation of the 'Artognou' stone, TintagelTintagel IslandАрхивировано