OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Readability improved

Browse Source
This commit is contained in:
Sagar Pandya 2021-01-12 14:40:27 +05:30
parent a9fad9a779
commit 46b5788298
1 changed files with 12 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
graph/connected_components_with_dsu.cpp
View File

@ -11,7 +11,7 @@
* 2. Disjoint union * 2. Disjoint union
* 1st option is inefficient, Disjoint union is the most optimal way to find this. * 1st option is inefficient, Disjoint union is the most optimal way to find this.
*/ */
#include <iostream> /// for io operations #include <iostream> /// for IO operations
#include <set> /// for std::set #include <set> /// for std::set
#include <vector> /// for std::vector #include <vector> /// for std::vector
@ -20,13 +20,11 @@
* @brief Graphical Algorithms * @brief Graphical Algorithms
*/ */
namespace graph { namespace graph {
/** /**
* @namespace disjoint_union * @namespace disjoint_union
* @brief Functions for [Disjoint union](https://en.wikipedia.org/wiki/Disjoint_union) implementation * @brief Functions for [Disjoint union](https://en.wikipedia.org/wiki/Disjoint_union) implementation
*/ */
namespace disjoint_union { namespace disjoint_union {
uint32_t number_of_nodes = 0; // denotes number of nodes uint32_t number_of_nodes = 0; // denotes number of nodes
std::vector<int64_t> parent{}; // parent of each node std::vector<int64_t> parent{}; // parent of each node
std::vector<uint32_t> connected_set_size{}; // size of each set std::vector<uint32_t> connected_set_size{}; // size of each set
@ -81,32 +79,32 @@ uint32_t no_of_connected_components() {
for (uint32_t i = 1; i <= number_of_nodes; i++) temp.insert(find_set(i)); for (uint32_t i = 1; i <= number_of_nodes; i++) temp.insert(find_set(i));
return temp.size(); // return the size of temp set return temp.size(); // return the size of temp set
} }
} // namespace disjoint_union
} // namespace graph
/** /**
* @brief Test Implementations * @brief Test Implementations
* @returns void * @returns void
*/ */
static void test() { static void test() {
std::cin >> number_of_nodes; namespace dsu = graph::disjoint_union;
parent.resize(number_of_nodes + 1); std::cin >> dsu::number_of_nodes;
connected_set_size.resize(number_of_nodes + 1); dsu::parent.resize(dsu::number_of_nodes + 1);
make_set(); dsu::connected_set_size.resize(dsu::number_of_nodes + 1);
dsu::make_set();
uint32_t edges = 0; uint32_t edges = 0;
std::cin >> edges; // no of edges in the graph std::cin >> edges; // no of edges in the graph
while (edges--) { while (edges--) {
int64_t node_a = 0, node_b = 0; int64_t node_a = 0, node_b = 0;
std::cin >> node_a >> node_b; std::cin >> node_a >> node_b;
union_sets(node_a, node_b); dsu::union_sets(node_a, node_b);
} }
std::cout << no_of_connected_components() << std::endl; std::cout << dsu::no_of_connected_components() << std::endl;
} }
} // namespace disjoint_union
} // namespace graph
/** /**
* @brief Main function * @brief Main function
* @returns 0 on exit * @returns 0 on exit
*/ */
int main() { int main() {
graph::disjoint_union::test(); // Execute the tests test(); // Execute the tests
return 0; return 0;
} }