C++ Lambda Function for BFS Traversal
Using the two functions below, how could I use a lambda function to BFS Traverse through a Graph of Thing's called x
i.e. Graph<Thing> x
which involves sending the display function to the bfsTraverse function so that the information in each Thing can be displayed.
void display(const Thing& c)
{
cout<<left<<setw(3)<<c.getKey()<<" "<<left<<setw(2)<<c.getLabel()<<endl;
}
template <typename E>
void Graph<E>::bfsTraverse(FuncType func)
{
/* some code not necessary to describe */
}
So basically, I just need to understand how to use a lambda function to tie these together here.
c++ algorithm lambda graph-theory breadth-first-search
edited Nov 22 '18 at 1:58
Dominique Fortin
1,665817
asked Mar 21 '17 at 2:46
RoryHectorRoryHector
548
add a comment |
Using the two functions below, how could I use a lambda function to BFS Traverse through a Graph of Thing's called x
i.e. Graph<Thing> x
which involves sending the display function to the bfsTraverse function so that the information in each Thing can be displayed.
void display(const Thing& c)
{
cout<<left<<setw(3)<<c.getKey()<<" "<<left<<setw(2)<<c.getLabel()<<endl;
}
template <typename E>
void Graph<E>::bfsTraverse(FuncType func)
{
/* some code not necessary to describe */
}
So basically, I just need to understand how to use a lambda function to tie these together here.
c++ algorithm lambda graph-theory breadth-first-search
edited Nov 22 '18 at 1:58
Dominique Fortin
1,665817
asked Mar 21 '17 at 2:46
RoryHectorRoryHector
548
add a comment |
Using the two functions below, how could I use a lambda function to BFS Traverse through a Graph of Thing's called x
i.e. Graph<Thing> x
which involves sending the display function to the bfsTraverse function so that the information in each Thing can be displayed.
void display(const Thing& c)
{
cout<<left<<setw(3)<<c.getKey()<<" "<<left<<setw(2)<<c.getLabel()<<endl;
}
template <typename E>
void Graph<E>::bfsTraverse(FuncType func)
{
/* some code not necessary to describe */
}
So basically, I just need to understand how to use a lambda function to tie these together here.
c++ algorithm lambda graph-theory breadth-first-search
edited Nov 22 '18 at 1:58
Dominique Fortin
1,665817
asked Mar 21 '17 at 2:46
RoryHectorRoryHector
548
Using the two functions below, how could I use a lambda function to BFS Traverse through a Graph of Thing's called x
i.e. Graph<Thing> x
which involves sending the display function to the bfsTraverse function so that the information in each Thing can be displayed.
void display(const Thing& c)
{
cout<<left<<setw(3)<<c.getKey()<<" "<<left<<setw(2)<<c.getLabel()<<endl;
}
template <typename E>
void Graph<E>::bfsTraverse(FuncType func)
{
/* some code not necessary to describe */
}
So basically, I just need to understand how to use a lambda function to tie these together here.
c++ algorithm lambda graph-theory breadth-first-search
c++ algorithm lambda graph-theory breadth-first-search
edited Nov 22 '18 at 1:58
Dominique Fortin
1,665817
asked Mar 21 '17 at 2:46
RoryHectorRoryHector
548
edited Nov 22 '18 at 1:58
Dominique Fortin
1,665817
asked Mar 21 '17 at 2:46
RoryHectorRoryHector
548
edited Nov 22 '18 at 1:58
Dominique Fortin
1,665817
edited Nov 22 '18 at 1:58
Dominique Fortin
1,665817
edited Nov 22 '18 at 1:58
Dominique Fortin
1,665817
1,665817
asked Mar 21 '17 at 2:46
RoryHectorRoryHector
548
asked Mar 21 '17 at 2:46
RoryHectorRoryHector
548
asked Mar 21 '17 at 2:46
RoryHectorRoryHector
548
548
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
It pretty straightforward. For example, let;s print values of vector using lambda:
#include <algorithm>
#include <vector>
#include <iostream>
int main (int argc, char* argv) {
std::vector <int> data{1,2,3,4};
std::for_each (data.begin (), data.end (), (const int val) { std::cout << val << std::endl;});
return 0;
}
last argument (...) is the lambda.
A function, which accepts lambdas, might look like this:
template <typename E, typename FuncType>
void Graph<E>::bfsTraverse (FuncType func)
{
/* some code not necessary to describe */
}
UPDATE
In case of a graph you should do the following. Your graph's implementation should have a method to access vertices: it might be 'getRoot', 'getSource', 'getAllNodes', it's implementation defined. I'll stick with 'getRoot'. Each vertex/node should have a method like 'getAdjacentVertices', 'getChildren', whatever. Combining all together:
template <typename E, typename FuncType>
void Graph<E>::bfsTraverse (FuncType func)
{
std::queue<Node> q;
auto&& root = getRoot ();
q.push (root);
while (not q.empty ()) {
auto&& current = q.front ();
q.pop ();
func (current);
auto&& adjacent = current.getAdjacent ();
for (auto&& a: adjacent) {
q.push (a);
}
}
Be aware, that I deliberately omit keeping list of visited nodes and other things. But idea itself stays the same. Now you can call this function as follows:
Graph<E> g;
g.bfsTraverse ( (const Node& n) {
std::cout << n.to_str () << std::endl;
}
);
answered Mar 21 '17 at 3:19
CaptainTrunkyCaptainTrunky
95821019
add a comment |
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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%2fstackoverflow.com%2fquestions%2f42917520%2fc-lambda-function-for-bfs-traversal%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
It pretty straightforward. For example, let;s print values of vector using lambda:
#include <algorithm>
#include <vector>
#include <iostream>
int main (int argc, char* argv) {
std::vector <int> data{1,2,3,4};
std::for_each (data.begin (), data.end (), (const int val) { std::cout << val << std::endl;});
return 0;
}
last argument (...) is the lambda.
A function, which accepts lambdas, might look like this:
template <typename E, typename FuncType>
void Graph<E>::bfsTraverse (FuncType func)
{
/* some code not necessary to describe */
}
UPDATE
In case of a graph you should do the following. Your graph's implementation should have a method to access vertices: it might be 'getRoot', 'getSource', 'getAllNodes', it's implementation defined. I'll stick with 'getRoot'. Each vertex/node should have a method like 'getAdjacentVertices', 'getChildren', whatever. Combining all together:
template <typename E, typename FuncType>
void Graph<E>::bfsTraverse (FuncType func)
{
std::queue<Node> q;
auto&& root = getRoot ();
q.push (root);
while (not q.empty ()) {
auto&& current = q.front ();
q.pop ();
func (current);
auto&& adjacent = current.getAdjacent ();
for (auto&& a: adjacent) {
q.push (a);
}
}
Be aware, that I deliberately omit keeping list of visited nodes and other things. But idea itself stays the same. Now you can call this function as follows:
Graph<E> g;
g.bfsTraverse ( (const Node& n) {
std::cout << n.to_str () << std::endl;
}
);
answered Mar 21 '17 at 3:19
CaptainTrunkyCaptainTrunky
95821019
add a comment |
It pretty straightforward. For example, let;s print values of vector using lambda:
#include <algorithm>
#include <vector>
#include <iostream>
int main (int argc, char* argv) {
std::vector <int> data{1,2,3,4};
std::for_each (data.begin (), data.end (), (const int val) { std::cout << val << std::endl;});
return 0;
}
last argument (...) is the lambda.
A function, which accepts lambdas, might look like this:
template <typename E, typename FuncType>
void Graph<E>::bfsTraverse (FuncType func)
{
/* some code not necessary to describe */
}
UPDATE
In case of a graph you should do the following. Your graph's implementation should have a method to access vertices: it might be 'getRoot', 'getSource', 'getAllNodes', it's implementation defined. I'll stick with 'getRoot'. Each vertex/node should have a method like 'getAdjacentVertices', 'getChildren', whatever. Combining all together:
template <typename E, typename FuncType>
void Graph<E>::bfsTraverse (FuncType func)
{
std::queue<Node> q;
auto&& root = getRoot ();
q.push (root);
while (not q.empty ()) {
auto&& current = q.front ();
q.pop ();
func (current);
auto&& adjacent = current.getAdjacent ();
for (auto&& a: adjacent) {
q.push (a);
}
}
Be aware, that I deliberately omit keeping list of visited nodes and other things. But idea itself stays the same. Now you can call this function as follows:
Graph<E> g;
g.bfsTraverse ( (const Node& n) {
std::cout << n.to_str () << std::endl;
}
);
answered Mar 21 '17 at 3:19
CaptainTrunkyCaptainTrunky
95821019
add a comment |
It pretty straightforward. For example, let;s print values of vector using lambda:
#include <algorithm>
#include <vector>
#include <iostream>
int main (int argc, char* argv) {
std::vector <int> data{1,2,3,4};
std::for_each (data.begin (), data.end (), (const int val) { std::cout << val << std::endl;});
return 0;
}
last argument (...) is the lambda.
A function, which accepts lambdas, might look like this:
template <typename E, typename FuncType>
void Graph<E>::bfsTraverse (FuncType func)
{
/* some code not necessary to describe */
}
UPDATE
In case of a graph you should do the following. Your graph's implementation should have a method to access vertices: it might be 'getRoot', 'getSource', 'getAllNodes', it's implementation defined. I'll stick with 'getRoot'. Each vertex/node should have a method like 'getAdjacentVertices', 'getChildren', whatever. Combining all together:
template <typename E, typename FuncType>
void Graph<E>::bfsTraverse (FuncType func)
{
std::queue<Node> q;
auto&& root = getRoot ();
q.push (root);
while (not q.empty ()) {
auto&& current = q.front ();
q.pop ();
func (current);
auto&& adjacent = current.getAdjacent ();
for (auto&& a: adjacent) {
q.push (a);
}
}
Be aware, that I deliberately omit keeping list of visited nodes and other things. But idea itself stays the same. Now you can call this function as follows:
Graph<E> g;
g.bfsTraverse ( (const Node& n) {
std::cout << n.to_str () << std::endl;
}
);
answered Mar 21 '17 at 3:19
CaptainTrunkyCaptainTrunky
95821019
It pretty straightforward. For example, let;s print values of vector using lambda:
#include <algorithm>
#include <vector>
#include <iostream>
int main (int argc, char* argv) {
std::vector <int> data{1,2,3,4};
std::for_each (data.begin (), data.end (), (const int val) { std::cout << val << std::endl;});
return 0;
}
last argument (...) is the lambda.
A function, which accepts lambdas, might look like this:
template <typename E, typename FuncType>
void Graph<E>::bfsTraverse (FuncType func)
{
/* some code not necessary to describe */
}
UPDATE
In case of a graph you should do the following. Your graph's implementation should have a method to access vertices: it might be 'getRoot', 'getSource', 'getAllNodes', it's implementation defined. I'll stick with 'getRoot'. Each vertex/node should have a method like 'getAdjacentVertices', 'getChildren', whatever. Combining all together:
template <typename E, typename FuncType>
void Graph<E>::bfsTraverse (FuncType func)
{
std::queue<Node> q;
auto&& root = getRoot ();
q.push (root);
while (not q.empty ()) {
auto&& current = q.front ();
q.pop ();
func (current);
auto&& adjacent = current.getAdjacent ();
for (auto&& a: adjacent) {
q.push (a);
}
}
Be aware, that I deliberately omit keeping list of visited nodes and other things. But idea itself stays the same. Now you can call this function as follows:
Graph<E> g;
g.bfsTraverse ( (const Node& n) {
std::cout << n.to_str () << std::endl;
}
);
answered Mar 21 '17 at 3:19
CaptainTrunkyCaptainTrunky
95821019
edited Mar 22 '17 at 0:55
answered Mar 21 '17 at 3:19
CaptainTrunkyCaptainTrunky
95821019
answered Mar 21 '17 at 3:19
CaptainTrunkyCaptainTrunky
95821019
answered Mar 21 '17 at 3:19
CaptainTrunkyCaptainTrunky
95821019
95821019
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- 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.
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%2fstackoverflow.com%2fquestions%2f42917520%2fc-lambda-function-for-bfs-traversal%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
