Skip to content

Algorithms/cc #138

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
kdeweese merged 3 commits into from
Dec 2, 2024
Merged

Algorithms/cc #138

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
e4b37da
switched cc to bfs and check for singletons before doing dfs
kdeweese Dec 2, 2024
78a8e65
formatting
kdeweese Dec 2, 2024
a79c3e4
Merge branch 'master' into algorithms/cc
kdeweese Dec 2, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 4 additions & 1 deletion include/graph/algorithm/connected_components.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,6 @@
#include "graph/views/incidence.hpp"
#include "graph/views/vertexlist.hpp"
#include "graph/views/breadth_first_search.hpp"
#include "graph/views/depth_first_search.hpp"
#include <stack>

#ifndef GRAPH_CC_HPP
Expand Down Expand Up @@ -103,6 +102,10 @@
}
visited[uid] = true;
component[uid] = cid;
if (!size(edges(g,u))) {
++cid;
continue;

Check warning on line 107 in include/graph/algorithm/connected_components.hpp

View check run for this annotation

Codecov / codecov/patch

include/graph/algorithm/connected_components.hpp#L106-L107 

Added lines #L106 - L107 were not covered by tests
}
vertices_breadth_first_search_view<G, void> bfs(g, uid);
for (auto&& [vid, v] : bfs) {
component[vid] = cid;
Expand Down
Loading