Strongly Connected Components with BFS
1
How can I find strongly connected components with BFS in directed graph?
I know Kosaraju’s algorithm which uses DFS.I want to find with BFS.
algorithm breadth-first-search
asked Nov 22 '18 at 19:29
pouria.vzrpouria.vzr
183
add a comment |
1
How can I find strongly connected components with BFS in directed graph?
I know Kosaraju’s algorithm which uses DFS.I want to find with BFS.
algorithm breadth-first-search
asked Nov 22 '18 at 19:29
pouria.vzrpouria.vzr
183
Maintain a visited array of nodes. Mark a node as visited, start BFS on that node to visit all reachable nodes. Collect all of them in a list - this list is a strongly connected component. Repeat this on all unvisited nodes.
– SomeDude
Nov 22 '18 at 22:12
This approach is for undirected graph not directed graph
– pouria.vzr
Nov 23 '18 at 22:32
add a comment |
1
1
1
How can I find strongly connected components with BFS in directed graph?
I know Kosaraju’s algorithm which uses DFS.I want to find with BFS.
algorithm breadth-first-search
asked Nov 22 '18 at 19:29
pouria.vzrpouria.vzr
183
How can I find strongly connected components with BFS in directed graph?
I know Kosaraju’s algorithm which uses DFS.I want to find with BFS.
algorithm breadth-first-search
algorithm breadth-first-search
asked Nov 22 '18 at 19:29
pouria.vzrpouria.vzr
183
asked Nov 22 '18 at 19:29
pouria.vzrpouria.vzr
183
asked Nov 22 '18 at 19:29
pouria.vzrpouria.vzr
183
asked Nov 22 '18 at 19:29
pouria.vzrpouria.vzr
183
asked Nov 22 '18 at 19:29
pouria.vzrpouria.vzr
183
183
Maintain a visited array of nodes. Mark a node as visited, start BFS on that node to visit all reachable nodes. Collect all of them in a list - this list is a strongly connected component. Repeat this on all unvisited nodes.
– SomeDude
Nov 22 '18 at 22:12
This approach is for undirected graph not directed graph
– pouria.vzr
Nov 23 '18 at 22:32
add a comment |
Maintain a visited array of nodes. Mark a node as visited, start BFS on that node to visit all reachable nodes. Collect all of them in a list - this list is a strongly connected component. Repeat this on all unvisited nodes.
– SomeDude
Nov 22 '18 at 22:12
This approach is for undirected graph not directed graph
– pouria.vzr
Nov 23 '18 at 22:32
Maintain a visited array of nodes. Mark a node as visited, start BFS on that node to visit all reachable nodes. Collect all of them in a list - this list is a strongly connected component. Repeat this on all unvisited nodes.
– SomeDude
Nov 22 '18 at 22:12
Maintain a visited array of nodes. Mark a node as visited, start BFS on that node to visit all reachable nodes. Collect all of them in a list - this list is a strongly connected component. Repeat this on all unvisited nodes.
– SomeDude
Nov 22 '18 at 22:12
This approach is for undirected graph not directed graph
– pouria.vzr
Nov 23 '18 at 22:32
This approach is for undirected graph not directed graph
– pouria.vzr
Nov 23 '18 at 22:32
add a comment |
0
active
oldest
votes
Your Answer
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
});
}
});
draft saved
draft discarded
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%2f53437095%2fstrongly-connected-components-with-bfs%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
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.
draft saved
draft discarded
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%2f53437095%2fstrongly-connected-components-with-bfs%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
Maintain a visited array of nodes. Mark a node as visited, start BFS on that node to visit all reachable nodes. Collect all of them in a list - this list is a strongly connected component. Repeat this on all unvisited nodes.
– SomeDude
Nov 22 '18 at 22:12
This approach is for undirected graph not directed graph
– pouria.vzr
Nov 23 '18 at 22:32