Files
C-Plus-Plus/d2/de9/heavy__light__decomposition_8cpp.html
2025-08-15 05:26:13 +00:00

433 lines
33 KiB
HTML

<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: range_queries/heavy_light_decomposition.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(function(){initNavTree('d2/de9/heavy__light__decomposition_8cpp.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">heavy_light_decomposition.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Heavy_path_decomposition" target="_blank">Heavy Light Decomposition</a> implementation
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cmath&gt;</code><br />
<code>#include &lt;cstring&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;list&gt;</code><br />
<code>#include &lt;numeric&gt;</code><br />
<code>#include &lt;string&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for heavy_light_decomposition.cpp:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../d8/dc0/heavy__light__decomposition_8cpp__incl.svg" width="100%" height="394"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
</div>
</div>
<p><a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-nested-classes" class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:range_5Fqueries_3A_3Aheavy_5Flight_5Fdecomposition_3A_3ATree_3C_20X_20_3E" id="r_range_5Fqueries_3A_3Aheavy_5Flight_5Fdecomposition_3A_3ATree_3C_20X_20_3E"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Basic <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting. <a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#details">More...</a><br /></td></tr>
<tr class="memitem:range_5Fqueries_3A_3Aheavy_5Flight_5Fdecomposition_3A_3ASG_3C_20X_20_3E" id="r_range_5Fqueries_3A_3Aheavy_5Flight_5Fdecomposition_3A_3ASG_3C_20X_20_3E"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Segment <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains. <a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#details">More...</a><br /></td></tr>
<tr class="memitem:range_5Fqueries_3A_3Aheavy_5Flight_5Fdecomposition_3A_3AHLD_3C_20X_20_3E" id="r_range_5Fqueries_3A_3Aheavy_5Flight_5Fdecomposition_3A_3AHLD_3C_20X_20_3E"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">The Heavy-Light Decomposition class. <a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#details">More...</a><br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:range_5Fqueries" id="r_range_5Fqueries"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d69/namespacerange__queries.html">range_queries</a></td></tr>
<tr class="memdesc:dd/d69/namespacerange__queries"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
<tr class="memitem:heavy_5Flight_5Fdecomposition" id="r_heavy_5Flight_5Fdecomposition"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d6f/namespaceheavy__light__decomposition.html">heavy_light_decomposition</a></td></tr>
<tr class="memdesc:db/d6f/namespaceheavy__light__decomposition"><td class="mdescLeft">&#160;</td><td class="mdescRight">Heavy light decomposition algorithm. <br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a34b8683a2b429de5cce57e6d733ec817" id="r_a34b8683a2b429de5cce57e6d733ec817"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a> ()</td></tr>
<tr class="memitem:a458410412185a5f09199deaff7157a8d" id="r_a458410412185a5f09199deaff7157a8d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a458410412185a5f09199deaff7157a8d">test_2</a> ()</td></tr>
<tr class="memitem:af31ec5409537703d9c8a47350386b32a" id="r_af31ec5409537703d9c8a47350386b32a"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af31ec5409537703d9c8a47350386b32a">test_3</a> ()</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Heavy_path_decomposition" target="_blank">Heavy Light Decomposition</a> implementation </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/aneee004" target="_blank">Aniruthan R</a></dd></dl>
<p>Heavy-Light Decomposition is a technique on trees, that supports the following:</p><ol type="1">
<li>Update node s, with a value v</li>
<li>Return the (sum) of all node values on the simple path from a to b (sum) can also be replced with <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a>, OR, AND, min, or max</li>
</ol>
<p>The update is done in O(log n) time, and the query is done in O(log^2 n) time with HLD where, n is the number of nodes</p>
<p>The template type is the data type of the value stored in the nodes. If a non-primitive data-type is used as a template, the coressponding operators must be overloaded.</p>
<p>An HLD object can only be created with a constant number of nodes, and it cannot be changed later. Creaty an empty instance is not supported.</p>
<p>To start answering updates and queries,</p><ol type="1">
<li>Create an instance of HLD&lt;X&gt; object (obj), with the required data type.</li>
<li>Read in the edge/parent information and update it with obj.add_edge(). Note: The edges addes must be 0 indexed.</li>
<li>Create a vector with initial node values, and call set_node_val() with it.</li>
<li>Call obj.init() to populate the required information for supporting operations.</li>
<li>Call obj.update(node, new_val), to update the value at index 'node' to the new value. Note: node must be 0 indexed</li>
<li>Call obj.query(a, b) to get the (sum) of node values in the simple path from a to b. Note: a and b, must be 0 indexed.</li>
</ol>
<p>Sample I/O at the bottom. </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000011">Todo</a></b></dt><dd>Support edge weight queries, by storing the edge weight value in it's child algorithm verified by testing in CSES path queries: <a href="https://cses.fi/problemset/task/1138">https://cses.fi/problemset/task/1138</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00641">641</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 641</span> {</div>
<div class="line"><span class="lineno"> 642</span> <a class="code hl_function" href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a>();</div>
<div class="line"><span class="lineno"> 643</span> <a class="code hl_function" href="#a458410412185a5f09199deaff7157a8d">test_2</a>();</div>
<div class="line"><span class="lineno"> 644</span> <a class="code hl_function" href="#af31ec5409537703d9c8a47350386b32a">test_3</a>();</div>
<div class="line"><span class="lineno"> 645</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 646</span>}</div>
<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00511">heavy_light_decomposition.cpp:511</a></div></div>
<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00555">heavy_light_decomposition.cpp:555</a></div></div>
<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00599">heavy_light_decomposition.cpp:599</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a34b8683a2b429de5cce57e6d733ec817" name="a34b8683a2b429de5cce57e6d733ec817"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a34b8683a2b429de5cce57e6d733ec817">&#9670;&#160;</a></span>test_1()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void test_1 </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Test implementations </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00511">511</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 511</span> {</div>
<div class="line"><span class="lineno"> 512</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 513</span> </div>
<div class="line"><span class="lineno"> 514</span> <span class="comment">// Test details</span></div>
<div class="line"><span class="lineno"> 515</span> <span class="keywordtype">int</span> n = 5;</div>
<div class="line"><span class="lineno"> 516</span> std::vector&lt;int64_t&gt; node_values = {4, 2, 5, 2, 1};</div>
<div class="line"><span class="lineno"> 517</span> std::vector&lt;std::vector&lt;int&gt;&gt; edges = {{1, 2}, {1, 3}, {3, 4}, {3, 5}};</div>
<div class="line"><span class="lineno"> 518</span> std::vector&lt;std::vector&lt;int&gt;&gt; queries = {</div>
<div class="line"><span class="lineno"> 519</span> {2, 1, 4},</div>
<div class="line"><span class="lineno"> 520</span> {1, 3, 2},</div>
<div class="line"><span class="lineno"> 521</span> {2, 1, 4},</div>
<div class="line"><span class="lineno"> 522</span> };</div>
<div class="line"><span class="lineno"> 523</span> std::vector&lt;int&gt; expected_result = {11, 8};</div>
<div class="line"><span class="lineno"> 524</span> std::vector&lt;int&gt; code_result;</div>
<div class="line"><span class="lineno"> 525</span> </div>
<div class="line"><span class="lineno"> 526</span> <a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD&lt;int64_t&gt;</a> hld(n);</div>
<div class="line"><span class="lineno"> 527</span> hld.set_node_val(node_values);</div>
<div class="line"><span class="lineno"> 528</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n - 1; i++) {</div>
<div class="line"><span class="lineno"> 529</span> <span class="keywordtype">int</span> u = edges[i][0], v = edges[i][1];</div>
<div class="line"><span class="lineno"> 530</span> hld.add_edge(u - 1, v - 1);</div>
<div class="line"><span class="lineno"> 531</span> }</div>
<div class="line"><span class="lineno"> 532</span> hld.init();</div>
<div class="line"><span class="lineno"> 533</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;q : queries) {</div>
<div class="line"><span class="lineno"> 534</span> <span class="keywordtype">int</span> type = q[0];</div>
<div class="line"><span class="lineno"> 535</span> <span class="keywordflow">if</span> (type == 1) {</div>
<div class="line"><span class="lineno"> 536</span> <span class="keywordtype">int</span> p = q[1], x = q[2];</div>
<div class="line"><span class="lineno"> 537</span> hld.update(p - 1, x);</div>
<div class="line"><span class="lineno"> 538</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 2) {</div>
<div class="line"><span class="lineno"> 539</span> <span class="keywordtype">int</span> a = q[1], b = q[2];</div>
<div class="line"><span class="lineno"> 540</span> code_result.push_back(hld.query(a - 1, b - 1));</div>
<div class="line"><span class="lineno"> 541</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 542</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><span class="lineno"> 543</span> }</div>
<div class="line"><span class="lineno"> 544</span> }</div>
<div class="line"><span class="lineno"> 545</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.size()); i++) {</div>
<div class="line"><span class="lineno"> 546</span> assert(expected_result[i] == code_result[i]);</div>
<div class="line"><span class="lineno"> 547</span> }</div>
<div class="line"><span class="lineno"> 548</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 1 passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 549</span>}</div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD</a></div><div class="ttdoc">The Heavy-Light Decomposition class.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00342">heavy_light_decomposition.cpp:342</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a458410412185a5f09199deaff7157a8d" name="a458410412185a5f09199deaff7157a8d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a458410412185a5f09199deaff7157a8d">&#9670;&#160;</a></span>test_2()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void test_2 </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Second test implementations </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00555">555</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 555</span> {</div>
<div class="line"><span class="lineno"> 556</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 557</span> </div>
<div class="line"><span class="lineno"> 558</span> <span class="comment">// Test details (Bamboo)</span></div>
<div class="line"><span class="lineno"> 559</span> <span class="keywordtype">int</span> n = 10;</div>
<div class="line"><span class="lineno"> 560</span> std::vector&lt;int64_t&gt; node_values = {1, 8, 6, 8, 6, 2, 9, 2, 3, 2};</div>
<div class="line"><span class="lineno"> 561</span> std::vector&lt;std::vector&lt;int&gt;&gt; edges = {{10, 5}, {6, 2}, {10, 7},</div>
<div class="line"><span class="lineno"> 562</span> {5, 2}, {3, 9}, {8, 3},</div>
<div class="line"><span class="lineno"> 563</span> {1, 4}, {6, 4}, {8, 7}};</div>
<div class="line"><span class="lineno"> 564</span> std::vector&lt;std::vector&lt;int&gt;&gt; queries = {</div>
<div class="line"><span class="lineno"> 565</span> {2, 1, 10}, {2, 1, 6}, {1, 3, 4}, {2, 1, 9}, {1, 5, 3},</div>
<div class="line"><span class="lineno"> 566</span> {1, 7, 8}, {2, 1, 4}, {2, 1, 8}, {1, 1, 4}, {1, 2, 7}};</div>
<div class="line"><span class="lineno"> 567</span> std::vector&lt;int&gt; expected_result = {27, 11, 45, 9, 34};</div>
<div class="line"><span class="lineno"> 568</span> std::vector&lt;int&gt; code_result;</div>
<div class="line"><span class="lineno"> 569</span> </div>
<div class="line"><span class="lineno"> 570</span> <a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD&lt;int64_t&gt;</a> hld(n);</div>
<div class="line"><span class="lineno"> 571</span> hld.set_node_val(node_values);</div>
<div class="line"><span class="lineno"> 572</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n - 1; i++) {</div>
<div class="line"><span class="lineno"> 573</span> <span class="keywordtype">int</span> u = edges[i][0], v = edges[i][1];</div>
<div class="line"><span class="lineno"> 574</span> hld.add_edge(u - 1, v - 1);</div>
<div class="line"><span class="lineno"> 575</span> }</div>
<div class="line"><span class="lineno"> 576</span> hld.init();</div>
<div class="line"><span class="lineno"> 577</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;q : queries) {</div>
<div class="line"><span class="lineno"> 578</span> <span class="keywordtype">int</span> type = q[0];</div>
<div class="line"><span class="lineno"> 579</span> <span class="keywordflow">if</span> (type == 1) {</div>
<div class="line"><span class="lineno"> 580</span> <span class="keywordtype">int</span> p = q[1], x = q[2];</div>
<div class="line"><span class="lineno"> 581</span> hld.update(p - 1, x);</div>
<div class="line"><span class="lineno"> 582</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 2) {</div>
<div class="line"><span class="lineno"> 583</span> <span class="keywordtype">int</span> a = q[1], b = q[2];</div>
<div class="line"><span class="lineno"> 584</span> code_result.push_back(hld.query(a - 1, b - 1));</div>
<div class="line"><span class="lineno"> 585</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 586</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><span class="lineno"> 587</span> }</div>
<div class="line"><span class="lineno"> 588</span> }</div>
<div class="line"><span class="lineno"> 589</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.size()); i++) {</div>
<div class="line"><span class="lineno"> 590</span> assert(expected_result[i] == code_result[i]);</div>
<div class="line"><span class="lineno"> 591</span> }</div>
<div class="line"><span class="lineno"> 592</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest2 passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 593</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="af31ec5409537703d9c8a47350386b32a" name="af31ec5409537703d9c8a47350386b32a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af31ec5409537703d9c8a47350386b32a">&#9670;&#160;</a></span>test_3()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void test_3 </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Third test implementations </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00599">599</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 599</span> {</div>
<div class="line"><span class="lineno"> 600</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 601</span> </div>
<div class="line"><span class="lineno"> 602</span> <span class="comment">// Test details</span></div>
<div class="line"><span class="lineno"> 603</span> <span class="keywordtype">int</span> n = 8;</div>
<div class="line"><span class="lineno"> 604</span> std::vector&lt;int64_t&gt; node_values = {1, 8, 6, 8, 6, 2, 9, 2};</div>
<div class="line"><span class="lineno"> 605</span> std::vector&lt;std::vector&lt;int&gt;&gt; edges = {{1, 2}, {2, 3}, {3, 4}, {1, 5},</div>
<div class="line"><span class="lineno"> 606</span> {6, 3}, {7, 5}, {8, 7}};</div>
<div class="line"><span class="lineno"> 607</span> std::vector&lt;std::vector&lt;int&gt;&gt; queries = {</div>
<div class="line"><span class="lineno"> 608</span> {2, 6, 8}, {2, 3, 6}, {1, 3, 4}, {2, 7, 1}, {1, 5, 3},</div>
<div class="line"><span class="lineno"> 609</span> {1, 7, 8}, {2, 6, 4}, {2, 7, 8}, {1, 1, 4}, {1, 2, 7}};</div>
<div class="line"><span class="lineno"> 610</span> std::vector&lt;int&gt; expected_result = {34, 8, 16, 14, 10};</div>
<div class="line"><span class="lineno"> 611</span> std::vector&lt;int&gt; code_result;</div>
<div class="line"><span class="lineno"> 612</span> </div>
<div class="line"><span class="lineno"> 613</span> <a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD&lt;int64_t&gt;</a> hld(n);</div>
<div class="line"><span class="lineno"> 614</span> hld.set_node_val(node_values);</div>
<div class="line"><span class="lineno"> 615</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n - 1; i++) {</div>
<div class="line"><span class="lineno"> 616</span> <span class="keywordtype">int</span> u = edges[i][0], v = edges[i][1];</div>
<div class="line"><span class="lineno"> 617</span> hld.add_edge(u - 1, v - 1);</div>
<div class="line"><span class="lineno"> 618</span> }</div>
<div class="line"><span class="lineno"> 619</span> hld.init();</div>
<div class="line"><span class="lineno"> 620</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;q : queries) {</div>
<div class="line"><span class="lineno"> 621</span> <span class="keywordtype">int</span> type = q[0];</div>
<div class="line"><span class="lineno"> 622</span> <span class="keywordflow">if</span> (type == 1) {</div>
<div class="line"><span class="lineno"> 623</span> <span class="keywordtype">int</span> p = q[1], x = q[2];</div>
<div class="line"><span class="lineno"> 624</span> hld.update(p - 1, x);</div>
<div class="line"><span class="lineno"> 625</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 2) {</div>
<div class="line"><span class="lineno"> 626</span> <span class="keywordtype">int</span> a = q[1], b = q[2];</div>
<div class="line"><span class="lineno"> 627</span> code_result.push_back(hld.query(a - 1, b - 1));</div>
<div class="line"><span class="lineno"> 628</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 629</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><span class="lineno"> 630</span> }</div>
<div class="line"><span class="lineno"> 631</span> }</div>
<div class="line"><span class="lineno"> 632</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.size()); i++) {</div>
<div class="line"><span class="lineno"> 633</span> assert(expected_result[i] == code_result[i]);</div>
<div class="line"><span class="lineno"> 634</span> }</div>
<div class="line"><span class="lineno"> 635</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest3 passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 636</span>}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html">heavy_light_decomposition.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
</ul>
</div>
</body>
</html>