What is the meaning of 'breadth' in breadth first search? Planned maintenance scheduled April...
Why do we need to use the builder design pattern when we can do the same thing with setters?
How does the math work when buying airline miles?
Why does it sometimes sound good to play a grace note as a lead in to a note in a melody?
Do I really need to have a message in a novel to appeal to readers?
What do you call the main part of a joke?
Why is Nikon 1.4g better when Nikon 1.8g is sharper?
Should I use a zero-interest credit card for a large one-time purchase?
Is grep documentation about ignoring case wrong, since it doesn't ignore case in filenames?
Has negative voting ever been officially implemented in elections, or seriously proposed, or even studied?
Why do we bend a book to keep it straight?
Is there any word for a place full of confusion?
Illegal assignment from sObject to Id
Did Deadpool rescue all of the X-Force?
How to install press fit bottom bracket into new frame
How do I find out the mythology and history of my Fortress?
What order were files/directories outputted in dir?
Time to Settle Down!
Crossing US/Canada Border for less than 24 hours
Selecting user stories during sprint planning
How to write this math term? with cases it isn't working
Dating a Former Employee
How fail-safe is nr as stop bytes?
Is CEO the "profession" with the most psychopaths?
Taylor expansion of ln(1-x)
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?
$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?
graphs graph-theory shortest-path graph-traversal
asked 3 hours ago
DG4DG4
1135
$endgroup$
add a comment |
$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?
graphs graph-theory shortest-path graph-traversal
asked 3 hours ago
DG4DG4
1135
$endgroup$
add a comment |
$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?
graphs graph-theory shortest-path graph-traversal
asked 3 hours ago
DG4DG4
1135
$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
graphs graph-theory shortest-path graph-traversal
asked 3 hours ago
DG4DG4
1135
asked 3 hours ago
DG4DG4
1135
edited 2 hours ago
DG4
asked 3 hours ago
DG4DG4
1135
asked 3 hours ago
DG4DG4
1135
asked 3 hours ago
DG4DG4
1135
1135
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$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.
Image here
answered 1 hour ago
Bryce KilleBryce Kille
665
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$
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
$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.
Image here
answered 1 hour ago
Bryce KilleBryce Kille
665
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$
add a comment |
$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.
Image here
answered 1 hour ago
Bryce KilleBryce Kille
665
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$
add a comment |
$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.
Image here
answered 1 hour ago
Bryce KilleBryce Kille
665
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.
Image here
answered 1 hour ago
Bryce KilleBryce Kille
665
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
665
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
665
answered 1 hour ago
Bryce KilleBryce Kille
665
665
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.
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
