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

Edited Comments

Browse Source
This commit is contained in:
Aniruthan R 2020-08-15 00:10:07 +05:30 committed by GitHub
parent 5f2e8cc83d
commit 07b46bbd9d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
range_queries/heavy_light_decomposition.cpp
View File

@ -58,6 +58,7 @@
*/ */
namespace range_queries { namespace range_queries {
namespace heavy_light_decomposition {
/** /**
* @brief A Basic Tree, which supports binary lifting * @brief A Basic Tree, which supports binary lifting
* @tparam the data type of the values stored in the tree nodes * @tparam the data type of the values stored in the tree nodes
@ -452,6 +453,7 @@ public:
return ret - Tree<X>::t_val[lc]; return ret - Tree<X>::t_val[lc];
} }
}; };
} // heavy_light_decomposition
} // namespace range_queries } // namespace range_queries
/** /**
@ -459,9 +461,8 @@ public:
*/ */
void test_1() { void test_1() {
std::cout << "Test 1:\n"; std::cout << "Test 1:\n";
/**
* Test details // Test details
*/
int n = 5; int n = 5;
std::vector<int64_t> node_values = {4, 2, 5, 2, 1}; std::vector<int64_t> node_values = {4, 2, 5, 2, 1};
std::vector<std::vector<int>> edges = { std::vector<std::vector<int>> edges = {
@ -476,7 +477,7 @@ void test_1() {
{2, 4}, {2, 4},
}; };
range_queries::HLD<int64_t> hld(n); range_queries::heavy_light_decomposition::HLD<int64_t> hld(n);
hld.set_node_val(node_values); hld.set_node_val(node_values);
for(int i = 0; i < n - 1; i++) { for(int i = 0; i < n - 1; i++) {
int u = edges[i][0], v = edges[i][1]; int u = edges[i][0], v = edges[i][1];
@ -501,9 +502,8 @@ void test_1() {
void test_2() { void test_2() {
std::cout << "Test 2:\n"; std::cout << "Test 2:\n";
/**
* Test details (Bamboo) // Test details (Bamboo)
*/
int n = 10; int n = 10;
std::vector<int64_t> node_values = {1, 8, 6, 8, 6, 2, 9, 2, 3, 2}; std::vector<int64_t> node_values = {1, 8, 6, 8, 6, 2, 9, 2, 3, 2};
std::vector<std::vector<int>> edges = { std::vector<std::vector<int>> edges = {
@ -530,7 +530,7 @@ void test_2() {
{1, 2, 7} {1, 2, 7}
}; };
range_queries::HLD<int64_t> hld(n); range_queries::heavy_light_decomposition::HLD<int64_t> hld(n);
hld.set_node_val(node_values); hld.set_node_val(node_values);
for(int i = 0; i < n - 1; i++) { for(int i = 0; i < n - 1; i++) {
int u = edges[i][0], v = edges[i][1]; int u = edges[i][0], v = edges[i][1];