backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-15 03:10:07 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for 153fb7b8a5

Browse Source
This commit is contained in:
github-actions
2020-05-30 04:02:09 +00:00
parent 92fe9495ec
commit 8a2de9842b
175 changed files with 1671 additions and 3460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
graph/connected_components_with_dsu.cpp
View File

@@ -5,28 +5,23 @@
int N; // denotes number of nodes;
std::vector<int> parent;
std::vector<int> siz;
void make_set()
{ // function the initialize every node as it's own parent
for (int i = 1; i <= N; i++)
{
void make_set() { // function the initialize every node as it's own parent
for (int i = 1; i <= N; i++) {
parent[i] = i;
siz[i] = 1;
}
}
// To find the component where following node belongs to
int find_set(int v)
{
int find_set(int v) {
if (v == parent[v])
return v;
return parent[v] = find_set(parent[v]);
}
void union_sets(int a, int b)
{ // To join 2 components to belong to one
void union_sets(int a, int b) { // To join 2 components to belong to one
a = find_set(a);
b = find_set(b);
if (a != b)
{
if (a != b) {
if (siz[a] < siz[b])
std::swap(a, b);
parent[b] = a;
@@ -34,8 +29,7 @@ void union_sets(int a, int b)
}
}
int no_of_connected_components()
{ // To find total no of connected components
int no_of_connected_components() { // To find total no of connected components
std::set<int> temp; // temp set to count number of connected components
for (int i = 1; i <= N; i++) temp.insert(find_set(i));
return temp.size();
@@ -43,16 +37,14 @@ int no_of_connected_components()
// All critical/corner cases have been taken care of.
// Input your required values: (not hardcoded)
int main()
{
int main() {
std::cin >> N;
parent.resize(N + 1);
siz.resize(N + 1);
make_set();
int edges;
std::cin >> edges; // no of edges in the graph
while (edges--)
{
while (edges--) {
int node_a, node_b;
std::cin >> node_a >> node_b;
union_sets(node_a, node_b);