backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 12:23:13 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for f821fae698

Browse Source
This commit is contained in:
github-actions
2021-10-24 15:48:54 +00:00
parent 9bcef17741
commit bd3ee55c22
327 changed files with 6557 additions and 2786 deletions
Download Patch File Download Diff File Expand all files Collapse all files

63
annotated.html
View File

@@ -198,41 +198,42 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_16_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
<tr id="row_18_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
<tr id="row_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_20_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_20_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_22_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
<tr id="row_24_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/dca/class_f_c_f_s.html" target="_self">FCFS</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
<tr id="row_24_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1f/classdsu.html" target="_self">dsu</a></td><td class="desc">Disjoint sets union data structure, class based representation </td></tr>
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/dca/class_f_c_f_s.html" target="_self">FCFS</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_42_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_44_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_45_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_46_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_47_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_48_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_49_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_50_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_50_" class="arrow" onclick="toggleFolder('50_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_50_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_51_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_42_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_44_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_45_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_46_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_47_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_48_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_49_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_50_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_51_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_51_" class="arrow" onclick="toggleFolder('51_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_51_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_53_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

5
annotated_dup.js
View File

@@ -137,11 +137,12 @@ var annotated_dup =
[ "binary_search_tree", "d9/dde/classbinary__search__tree.html", "d9/dde/classbinary__search__tree" ],
[ "Btree", "d9/d90/struct_btree.html", null ],
[ "cll", "d5/d15/classcll.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Compare", "de/d4a/class_compare.html", "de/d4a/class_compare" ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Complex", "da/d5a/class_complex.html", "da/d5a/class_complex" ],
[ "CycleCheck", "d3/dbb/class_cycle_check.html", "d3/dbb/class_cycle_check" ],
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],
[ "dsu", "dd/d1f/classdsu.html", "dd/d1f/classdsu" ],
[ "EasterYearMonthDay", "d1/df6/class_easter_year_month_day.html", "d1/df6/class_easter_year_month_day" ],
[ "Edge", "d7/d77/class_edge.html", "d7/d77/class_edge" ],
[ "FCFS", "dd/dca/class_f_c_f_s.html", "dd/dca/class_f_c_f_s" ],
@@ -155,8 +156,8 @@ var annotated_dup =
[ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ],
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ],
[ "mst", "d1/d77/structmst.html", null ],
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "Node", "db/d8b/struct_node.html", null ],
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
[ "query", "dd/d1b/structquery.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ],

6
classes.html
View File

@@ -103,10 +103,10 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dd><a class="el" href="d9/dde/classbinary__search__tree.html">binary_search_tree</a></dd><dd><a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">BinaryTree</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html">binary_search_tree::bst_node</a></dd><dd><a class="el" href="d9/d90/struct_btree.html">Btree</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_C" name="letter_C">C</a></dt>
<dd><a class="el" href="d5/d15/classcll.html">cll</a></dd><dd><a class="el" href="d1/db3/structcompare.html">compare</a></dd><dd><a class="el" href="de/d4a/class_compare.html">Compare</a></dd><dd><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">AyStarSearch::comparison_operator</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="da/d5a/class_complex.html">Complex</a></dd><dd><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)</dd><dd><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a></dd></dl>
<dd><a class="el" href="d5/d15/classcll.html">cll</a></dd><dd><a class="el" href="de/d4a/class_compare.html">Compare</a></dd><dd><a class="el" href="d1/db3/structcompare.html">compare</a></dd><dd><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">AyStarSearch::comparison_operator</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="da/d5a/class_complex.html">Complex</a></dd><dd><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)</dd><dd><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_D" name="letter_D">D</a></dt>
<dd><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> (machine_learning::neural_network::layers)</dd><dd><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a></dd></dl>
<dd><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> (machine_learning::neural_network::layers)</dd><dd><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a></dd><dd><a class="el" href="dd/d1f/classdsu.html">dsu</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_E" name="letter_E">E</a></dt>
<dd><a class="el" href="d1/df6/class_easter_year_month_day.html">EasterYearMonthDay</a></dd><dd><a class="el" href="d7/d77/class_edge.html">Edge</a></dd><dd><a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> (<a class="el" href="d0/d65/namespacedouble__hashing.html">double_hashing</a>)</dd><dd><a class="el" href="db/d19/structlinear__probing_1_1_entry.html">Entry</a> (<a class="el" href="d8/d89/namespacelinear__probing.html">linear_probing</a>)</dd><dd><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> (<a class="el" href="d4/dd2/namespacequadratic__probing.html">quadratic_probing</a>)</dd></dl>
@@ -130,7 +130,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dd><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a></dd><dd><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a></dd><dd><a class="el" href="d1/d77/structmst.html">mst</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_N" name="letter_N">N</a></dt>
<dd><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> (data_structures::linked_list)</dd><dd><a class="el" href="d9/d49/structdata__structures_1_1_node.html">Node</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> (data_structures::tree_234)</dd><dd><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Trie::Node</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> (operations_on_datastructures::inorder_traversal_of_bst)</dd><dd><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
<dd><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> (data_structures::linked_list)</dd><dd><a class="el" href="d9/d49/structdata__structures_1_1_node.html">Node</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> (data_structures::tree_234)</dd><dd><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Trie::Node</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> (operations_on_datastructures::inorder_traversal_of_bst)</dd><dd><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_P" name="letter_P">P</a></dt>
<dd><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> (<a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">ciphers::elliptic_curve_key_exchange</a>)</dd><dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>

126
d0/dcb/classdsu-members.html Normal file
View File

@@ -0,0 +1,126 @@
<!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">
<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.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<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>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.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/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('dd/d1f/classdsu.html','../../'); initResizable(); });
/* @license-end */
</script>
<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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle"><div class="title">dsu Member List</div></div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../dd/d1f/classdsu.html">dsu</a>, including all inherited members.</p>
<table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a></td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu</a>(uint64_t n)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu</a>(uint64_t n)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(uint64_t i)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(uint64_t i)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">get</a>(uint64_t i)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">get_max</a>(uint64_t i)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">get_min</a>(uint64_t i)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280">getParents</a>(uint64_t i)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(uint64_t i, uint64_t j)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(uint64_t i, uint64_t j)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a></td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a></td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a></td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a></td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">size</a>(uint64_t i)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(uint64_t i, uint64_t j)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(uint64_t i, uint64_t j)</td><td class="entry"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.9.2 </li>
</ul>
</div>
</body>
</html>

289
d3/dae/dsu__path__compression_8cpp.html Normal file
View File

@@ -0,0 +1,289 @@
<!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">
<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.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/dsu_path_compression.cpp File Reference</title>
<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>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.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/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d3/dae/dsu__path__compression_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">dsu_path_compression.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for dsu_path_compression.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/de3/dsu__path__compression_8cpp__incl.svg" width="258" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Disjoint sets union data structure, class based representation. <a href="../../dd/d1f/classdsu.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ae7880ce913f3058a35ff106d5be9e243"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a> ()</td></tr>
<tr class="memdesc:ae7880ce913f3058a35ff106d5be9e243"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations, 1st test. <a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">More...</a><br /></td></tr>
<tr class="separator:ae7880ce913f3058a35ff106d5be9e243"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a45d94ead4cf4e1ff9f87c38bc99f59ae"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a> ()</td></tr>
<tr class="memdesc:a45d94ead4cf4e1ff9f87c38bc99f59ae"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-implementations, 2nd test. <a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">More...</a><br /></td></tr>
<tr class="separator:a45d94ead4cf4e1ff9f87c38bc99f59ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p ><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> </p>
<p >It is a very powerful data structure that keeps track of different clusters(sets) of elements, these sets are disjoint(doesnot have a common element). Disjoint sets uses cases : for finding connected components in a graph, used in Kruskal's algorithm for finding <a class="el" href="../../d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning tree. Operations that can be performed: 1) UnionSet(i,j): add(element i and j to the set) 2) findSet(i): returns the representative of the set to which i belogngs to. 3) get_max(i),get_min(i) : returns the maximum and minimum Below is the class-based approach which uses the heuristic of path compression. Using path compression in findSet(i),we are able to get to the representative of i in O(1) time. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AayushVyasKIIT" target="_blank">AayushVyasKIIT</a> </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../df/d28/dsu__union__rank_8cpp.html" title="DSU (Disjoint sets)">dsu_union_rank.cpp</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</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&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p >&lt; number of items</p>
<p >&lt; object of class disjoint sets</p>
<div class="fragment"><div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> {</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> uint64_t n = 10; <span class="comment">///&lt; number of items</span></div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); <span class="comment">///&lt; object of class disjoint sets</span></div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> </div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(); <span class="comment">// run 1st test case</span></div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(); <span class="comment">// run 2nd test case</span></div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> </div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span>}</div>
<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:33</div></div>
<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:186</div></div>
<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:169</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="604" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ae7880ce913f3058a35ff106d5be9e243" name="ae7880ce913f3058a35ff106d5be9e243"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae7880ce913f3058a35ff106d5be9e243">&#9670;&nbsp;</a></span>test1()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test1 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations, 1st test. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >&lt; number of items</p>
<p >&lt; object of class disjoint sets</p>
<div class="fragment"><div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> {</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// the minimum, maximum, and size of the set</span></div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> uint64_t n = 10; <span class="comment">///&lt; number of items</span></div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); <span class="comment">///&lt; object of class disjoint sets</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="comment">// set 1</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> d.UnionSet(1, 2); <span class="comment">// performs union operation on 1 and 2</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> d.UnionSet(1, 4); <span class="comment">// performs union operation on 1 and 4</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a> = {1, 4, 3};</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>.size(); i++) {</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> assert(d.get(4).at(i) == <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>[i]); <span class="comment">// makes sure algorithm works fine</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> }</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:36</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg" width="506" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a45d94ead4cf4e1ff9f87c38bc99f59ae" name="a45d94ead4cf4e1ff9f87c38bc99f59ae"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">&#9670;&nbsp;</a></span>test2()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test2 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-implementations, 2nd test. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >&lt; number of items</p>
<p >&lt; object of class disjoint sets</p>
<div class="fragment"><div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> {</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// the minimum, maximum, and size of the set </span></div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> uint64_t n = 10; <span class="comment">///&lt; number of items</span></div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); <span class="comment">///&lt; object of class disjoint sets</span></div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// set 1</span></div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> d.UnionSet(3, 5);</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> d.UnionSet(5, 6);</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> d.UnionSet(5, 7);</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a> = {3, 7, 4};</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>.size(); i++) {</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> assert(d.get(3).at(i) == <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>[i]); <span class="comment">// makes sure algorithm works fine</span></div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> }</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg" width="506" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d3/dae/dsu__path__compression_8cpp.html">dsu_path_compression.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.9.2 </li>
</ul>
</div>
</body>
</html>

7
d3/dae/dsu__path__compression_8cpp.js vendored Normal file
View File

@@ -0,0 +1,7 @@
var dsu__path__compression_8cpp =
[
[ "dsu", "dd/d1f/classdsu.html", "dd/d1f/classdsu" ],
[ "main", "d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test1", "d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243", null ],
[ "test2", "d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae", null ]
];

14
d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map Normal file
View File

@@ -0,0 +1,14 @@
<map id="test2" name="test2">
<area shape="rect" id="node1" title="Self&#45;implementations, 2nd test." alt="" coords="5,81,56,108"/>
<area shape="rect" id="node2" href="$d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" title=" " alt="" coords="287,5,331,32"/>
<area shape="rect" id="node3" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="122,81,191,108"/>
<area shape="rect" id="node8" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="104,284,209,311"/>
<area shape="rect" id="node4" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="257,56,360,83"/>
<area shape="rect" id="node6" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="259,107,358,133"/>
<area shape="rect" id="node7" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="271,157,346,184"/>
<area shape="rect" id="node5" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="408,157,500,184"/>
<area shape="rect" id="node9" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="261,259,357,285"/>
<area shape="rect" id="node10" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="273,309,345,336"/>
<area shape="rect" id="node11" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="274,360,343,387"/>
<area shape="rect" id="node12" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="269,411,348,437"/>
</map>

1
d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
3d43b694568d4acc9db14b0c16a23771

223
d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg Normal file
View File

@@ -0,0 +1,223 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: test2 Pages: 1 -->
<svg width="379pt" height="332pt"
viewBox="0.00 0.00 379.00 332.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 328)">
<title>test2</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-328 375,-328 375,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;implementations, 2nd test.">
<polygon fill="#bfbfbf" stroke="black" points="0,-247.5 0,-266.5 38,-266.5 38,-247.5 0,-247.5"/>
<text text-anchor="middle" x="19" y="-254.5" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="211,-304.5 211,-323.5 244,-323.5 244,-304.5 211,-304.5"/>
<text text-anchor="middle" x="227.5" y="-311.5" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.35,-263.94C48.74,-267.75 62.01,-272.4 74,-276 118.19,-289.25 170.52,-301.57 200.97,-308.41"/>
<polygon fill="midnightblue" stroke="midnightblue" points="200.26,-311.84 210.78,-310.6 201.78,-305.01 200.26,-311.84"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="black" points="87.5,-247.5 87.5,-266.5 139.5,-266.5 139.5,-247.5 87.5,-247.5"/>
<text text-anchor="middle" x="113.5" y="-254.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M38.28,-257C49.33,-257 63.79,-257 77.01,-257"/>
<polygon fill="midnightblue" stroke="midnightblue" points="77.26,-260.5 87.26,-257 77.26,-253.5 77.26,-260.5"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="black" points="74,-95.5 74,-114.5 153,-114.5 153,-95.5 74,-95.5"/>
<text text-anchor="middle" x="113.5" y="-102.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge11" class="edge">
<title>Node1&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M25.79,-247.49C40.84,-222.75 81.43,-156.05 101.28,-123.44"/>
<polygon fill="midnightblue" stroke="midnightblue" points="104.51,-124.87 106.72,-114.5 98.53,-121.23 104.51,-124.87"/>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M133.17,-266.54C148.23,-274.23 169.97,-285.33 189,-295 193.14,-297.1 197.53,-299.33 201.8,-301.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="200.3,-304.66 210.8,-306.06 203.47,-298.42 200.3,-304.66"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="189,-266.5 189,-285.5 266,-285.5 266,-266.5 189,-266.5"/>
<text text-anchor="middle" x="227.5" y="-273.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge4" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M139.63,-261.26C151.15,-263.22 165.19,-265.6 178.6,-267.87"/>
<polygon fill="midnightblue" stroke="midnightblue" points="178.23,-271.36 188.68,-269.58 179.41,-264.46 178.23,-271.36"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="190.5,-228.5 190.5,-247.5 264.5,-247.5 264.5,-228.5 190.5,-228.5"/>
<text text-anchor="middle" x="227.5" y="-235.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge7" class="edge">
<title>Node3&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M139.63,-252.74C151.68,-250.69 166.48,-248.18 180.44,-245.81"/>
<polygon fill="midnightblue" stroke="midnightblue" points="181.13,-249.25 190.4,-244.12 179.96,-242.35 181.13,-249.25"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="199.5,-190.5 199.5,-209.5 255.5,-209.5 255.5,-190.5 199.5,-190.5"/>
<text text-anchor="middle" x="227.5" y="-197.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge9" class="edge">
<title>Node3&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M133.17,-247.46C148.23,-239.77 169.97,-228.67 189,-219 191.99,-217.48 195.12,-215.89 198.24,-214.31"/>
<polygon fill="midnightblue" stroke="midnightblue" points="200.08,-217.3 207.42,-209.66 196.92,-211.06 200.08,-217.3"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="302,-190.5 302,-209.5 371,-209.5 371,-190.5 302,-190.5"/>
<text text-anchor="middle" x="336.5" y="-197.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M249.58,-266.33C255.06,-263.55 260.87,-260.35 266,-257 284.62,-244.86 304.03,-228.58 317.6,-216.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="320.14,-218.94 325.22,-209.65 315.45,-213.75 320.14,-218.94"/>
</g>
<!-- Node5&#45;&gt;Node5 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M319.85,-209.76C311.76,-218.57 317.3,-228 336.5,-228 348.5,-228 355.16,-224.31 356.5,-219.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="359.74,-218.05 353.15,-209.76 353.12,-220.35 359.74,-218.05"/>
</g>
<!-- Node6&#45;&gt;Node5 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M255.5,-228.41C268.68,-223.73 284.73,-218.03 298.98,-212.97"/>
<polygon fill="midnightblue" stroke="midnightblue" points="300.26,-216.23 308.51,-209.59 297.91,-209.63 300.26,-216.23"/>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M255.5,-200C266.53,-200 279.57,-200 291.88,-200"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.99,-203.5 301.99,-200 291.99,-196.5 291.99,-203.5"/>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge12" class="edge">
<title>Node8&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M132.02,-114.57C146.96,-122.58 169.13,-134.09 189,-143 225.92,-159.55 269.21,-176.04 299.1,-187"/>
<polygon fill="midnightblue" stroke="midnightblue" points="298.11,-190.36 308.7,-190.49 300.5,-183.78 298.11,-190.36"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="black" points="191.5,-114.5 191.5,-133.5 263.5,-133.5 263.5,-114.5 191.5,-114.5"/>
<text text-anchor="middle" x="227.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge13" class="edge">
<title>Node8&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M153.04,-111.54C162.15,-113.08 171.94,-114.75 181.32,-116.33"/>
<polygon fill="midnightblue" stroke="midnightblue" points="180.82,-119.8 191.27,-118.02 182,-112.9 180.82,-119.8"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="200.5,-76.5 200.5,-95.5 254.5,-95.5 254.5,-76.5 200.5,-76.5"/>
<text text-anchor="middle" x="227.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node10 -->
<g id="edge15" class="edge">
<title>Node8&#45;&gt;Node10</title>
<path fill="none" stroke="midnightblue" d="M153.04,-98.46C165.08,-96.42 178.32,-94.17 190.2,-92.16"/>
<polygon fill="midnightblue" stroke="midnightblue" points="190.95,-95.58 200.23,-90.46 189.78,-88.68 190.95,-95.58"/>
</g>
<!-- Node11 -->
<g id="node11" class="node">
<title>Node11</title>
<g id="a_node11"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="201.5,-38.5 201.5,-57.5 253.5,-57.5 253.5,-38.5 201.5,-38.5"/>
<text text-anchor="middle" x="227.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node11 -->
<g id="edge16" class="edge">
<title>Node8&#45;&gt;Node11</title>
<path fill="none" stroke="midnightblue" d="M133.17,-95.46C148.23,-87.77 169.97,-76.67 189,-67 191.99,-65.48 195.12,-63.89 198.24,-62.31"/>
<polygon fill="midnightblue" stroke="midnightblue" points="200.08,-65.3 207.42,-57.66 196.92,-59.06 200.08,-65.3"/>
</g>
<!-- Node12 -->
<g id="node12" class="node">
<title>Node12</title>
<g id="a_node12"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="198,-0.5 198,-19.5 257,-19.5 257,-0.5 198,-0.5"/>
<text text-anchor="middle" x="227.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node12 -->
<g id="edge17" class="edge">
<title>Node8&#45;&gt;Node12</title>
<path fill="none" stroke="midnightblue" d="M122.36,-95.11C135.09,-79.56 161.57,-49.09 189,-29 191.06,-27.49 193.26,-26.04 195.52,-24.66"/>
<polygon fill="midnightblue" stroke="midnightblue" points="197.36,-27.64 204.38,-19.7 193.94,-21.53 197.36,-27.64"/>
</g>
<!-- Node9&#45;&gt;Node5 -->
<g id="edge14" class="edge">
<title>Node9&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M243.99,-133.56C250.82,-137.86 258.88,-143.07 266,-148 282.67,-159.54 301.01,-173.32 314.66,-183.79"/>
<polygon fill="midnightblue" stroke="midnightblue" points="312.84,-186.8 322.89,-190.13 317.11,-181.25 312.84,-186.8"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 12 KiB

16
d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,16 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,107,56,133"/>
<area shape="rect" id="node2" href="$d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="Self&#45;test implementations, 1st test." alt="" coords="104,81,155,108"/>
<area shape="rect" id="node14" href="$d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="104,132,155,159"/>
<area shape="rect" id="node3" href="$d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" title=" " alt="" coords="385,5,429,32"/>
<area shape="rect" id="node4" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="221,107,290,133"/>
<area shape="rect" id="node9" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="203,259,308,285"/>
<area shape="rect" id="node5" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="356,56,459,83"/>
<area shape="rect" id="node7" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="358,107,457,133"/>
<area shape="rect" id="node8" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="370,157,445,184"/>
<area shape="rect" id="node6" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="507,157,599,184"/>
<area shape="rect" id="node10" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="359,208,455,235"/>
<area shape="rect" id="node11" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="371,309,443,336"/>
<area shape="rect" id="node12" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="373,360,442,387"/>
<area shape="rect" id="node13" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="368,411,447,437"/>
</map>

1
d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
4fb177677523c9cec4ff5d035a533845

271
d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,271 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: main Pages: 1 -->
<svg width="453pt" height="332pt"
viewBox="0.00 0.00 453.00 332.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 328)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-328 449,-328 449,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#bfbfbf" stroke="black" points="0,-228.5 0,-247.5 38,-247.5 38,-228.5 0,-228.5"/>
<text text-anchor="middle" x="19" y="-235.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
<polygon fill="white" stroke="black" points="74,-247.5 74,-266.5 112,-266.5 112,-247.5 74,-247.5"/>
<text text-anchor="middle" x="93" y="-254.5" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.17,-242.79C45.95,-244.85 55.23,-247.3 63.87,-249.58"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.02,-252.97 73.59,-252.14 64.81,-246.21 63.02,-252.97"/>
</g>
<!-- Node14 -->
<g id="node14" class="node">
<title>Node14</title>
<g id="a_node14"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
<polygon fill="white" stroke="black" points="74,-209.5 74,-228.5 112,-228.5 112,-209.5 74,-209.5"/>
<text text-anchor="middle" x="93" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node14 -->
<g id="edge19" class="edge">
<title>Node1&#45;&gt;Node14</title>
<path fill="none" stroke="midnightblue" d="M38.17,-233.21C45.95,-231.15 55.23,-228.7 63.87,-226.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="64.81,-229.79 73.59,-223.86 63.02,-223.03 64.81,-229.79"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="285,-304.5 285,-323.5 318,-323.5 318,-304.5 285,-304.5"/>
<text text-anchor="middle" x="301.5" y="-311.5" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M106.57,-266.67C117.07,-274.24 132.74,-284.39 148,-290 190.57,-305.65 243.49,-311.1 274.48,-312.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="274.68,-316.51 284.85,-313.54 275.05,-309.52 274.68,-316.51"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="black" points="161.5,-228.5 161.5,-247.5 213.5,-247.5 213.5,-228.5 161.5,-228.5"/>
<text text-anchor="middle" x="187.5" y="-235.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M112.28,-253.25C123.44,-250.95 138.08,-247.95 151.4,-245.21"/>
<polygon fill="midnightblue" stroke="midnightblue" points="152.17,-248.62 161.26,-243.18 150.76,-241.77 152.17,-248.62"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="black" points="148,-114.5 148,-133.5 227,-133.5 227,-114.5 148,-114.5"/>
<text text-anchor="middle" x="187.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge12" class="edge">
<title>Node2&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M103.88,-247.25C106.62,-244.36 109.52,-241.14 112,-238 137.26,-206.02 162.28,-165.42 175.93,-142.31"/>
<polygon fill="midnightblue" stroke="midnightblue" points="179.03,-143.95 181.05,-133.55 172.98,-140.42 179.03,-143.95"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M205.43,-247.63C212.32,-251.78 220.23,-256.85 227,-262 244.28,-275.13 245.15,-282.65 263,-295 266.89,-297.69 271.2,-300.23 275.49,-302.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="274.13,-305.77 284.63,-307.14 277.28,-299.52 274.13,-305.77"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="263,-266.5 263,-285.5 340,-285.5 340,-266.5 263,-266.5"/>
<text text-anchor="middle" x="301.5" y="-273.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M213.63,-246.53C228.06,-251.42 246.45,-257.66 262.59,-263.14"/>
<polygon fill="midnightblue" stroke="midnightblue" points="261.7,-266.53 272.3,-266.43 263.95,-259.9 261.7,-266.53"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="264.5,-228.5 264.5,-247.5 338.5,-247.5 338.5,-228.5 264.5,-228.5"/>
<text text-anchor="middle" x="301.5" y="-235.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge8" class="edge">
<title>Node4&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M213.63,-238C225.56,-238 240.2,-238 254.03,-238"/>
<polygon fill="midnightblue" stroke="midnightblue" points="254.4,-241.5 264.4,-238 254.4,-234.5 254.4,-241.5"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="273.5,-190.5 273.5,-209.5 329.5,-209.5 329.5,-190.5 273.5,-190.5"/>
<text text-anchor="middle" x="301.5" y="-197.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node8 -->
<g id="edge10" class="edge">
<title>Node4&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M213.63,-229.47C228.38,-224.47 247.27,-218.06 263.66,-212.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="265.15,-215.69 273.49,-209.16 262.9,-209.06 265.15,-215.69"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="376,-190.5 376,-209.5 445,-209.5 445,-190.5 376,-190.5"/>
<text text-anchor="middle" x="410.5" y="-197.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M323.58,-266.33C329.06,-263.55 334.87,-260.35 340,-257 358.62,-244.86 378.03,-228.58 391.6,-216.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="394.14,-218.94 399.22,-209.65 389.45,-213.75 394.14,-218.94"/>
</g>
<!-- Node6&#45;&gt;Node6 -->
<g id="edge7" class="edge">
<title>Node6&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M393.85,-209.76C385.76,-218.57 391.3,-228 410.5,-228 422.5,-228 429.16,-224.31 430.5,-219.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="433.74,-218.05 427.15,-209.76 427.12,-220.35 433.74,-218.05"/>
</g>
<!-- Node7&#45;&gt;Node6 -->
<g id="edge9" class="edge">
<title>Node7&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M329.5,-228.41C342.68,-223.73 358.73,-218.03 372.98,-212.97"/>
<polygon fill="midnightblue" stroke="midnightblue" points="374.26,-216.23 382.51,-209.59 371.91,-209.63 374.26,-216.23"/>
</g>
<!-- Node8&#45;&gt;Node6 -->
<g id="edge11" class="edge">
<title>Node8&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M329.5,-200C340.53,-200 353.57,-200 365.88,-200"/>
<polygon fill="midnightblue" stroke="midnightblue" points="365.99,-203.5 375.99,-200 365.99,-196.5 365.99,-203.5"/>
</g>
<!-- Node9&#45;&gt;Node6 -->
<g id="edge13" class="edge">
<title>Node9&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M227.08,-123.02C258.65,-123.56 303.83,-127.46 340,-143 361.13,-152.08 380.97,-169.6 394,-182.83"/>
<polygon fill="midnightblue" stroke="midnightblue" points="391.76,-185.56 401.18,-190.4 396.84,-180.74 391.76,-185.56"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="black" points="265.5,-152.5 265.5,-171.5 337.5,-171.5 337.5,-152.5 265.5,-152.5"/>
<text text-anchor="middle" x="301.5" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node10 -->
<g id="edge14" class="edge">
<title>Node9&#45;&gt;Node10</title>
<path fill="none" stroke="midnightblue" d="M216.76,-133.59C230.69,-138.31 247.68,-144.08 262.71,-149.18"/>
<polygon fill="midnightblue" stroke="midnightblue" points="261.65,-152.52 272.25,-152.41 263.9,-145.89 261.65,-152.52"/>
</g>
<!-- Node11 -->
<g id="node11" class="node">
<title>Node11</title>
<g id="a_node11"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="274.5,-76.5 274.5,-95.5 328.5,-95.5 328.5,-76.5 274.5,-76.5"/>
<text text-anchor="middle" x="301.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node11 -->
<g id="edge16" class="edge">
<title>Node9&#45;&gt;Node11</title>
<path fill="none" stroke="midnightblue" d="M216.76,-114.41C231.22,-109.51 248.98,-103.48 264.42,-98.24"/>
<polygon fill="midnightblue" stroke="midnightblue" points="265.82,-101.46 274.17,-94.93 263.58,-94.83 265.82,-101.46"/>
</g>
<!-- Node12 -->
<g id="node12" class="node">
<title>Node12</title>
<g id="a_node12"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="275.5,-38.5 275.5,-57.5 327.5,-57.5 327.5,-38.5 275.5,-38.5"/>
<text text-anchor="middle" x="301.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node12 -->
<g id="edge17" class="edge">
<title>Node9&#45;&gt;Node12</title>
<path fill="none" stroke="midnightblue" d="M199.64,-114.43C213.81,-102.51 239.28,-81.9 263,-67 265.49,-65.43 268.13,-63.89 270.8,-62.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="272.69,-65.36 279.88,-57.59 269.41,-59.18 272.69,-65.36"/>
</g>
<!-- Node13 -->
<g id="node13" class="node">
<title>Node13</title>
<g id="a_node13"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="272,-0.5 272,-19.5 331,-19.5 331,-0.5 272,-0.5"/>
<text text-anchor="middle" x="301.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node13 -->
<g id="edge18" class="edge">
<title>Node9&#45;&gt;Node13</title>
<path fill="none" stroke="midnightblue" d="M194.13,-114.23C205.27,-95.63 231.73,-54.67 263,-29 264.79,-27.53 266.71,-26.14 268.7,-24.82"/>
<polygon fill="midnightblue" stroke="midnightblue" points="270.84,-27.62 277.7,-19.54 267.31,-21.58 270.84,-27.62"/>
</g>
<!-- Node10&#45;&gt;Node6 -->
<g id="edge15" class="edge">
<title>Node10&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M329.5,-171.59C342.68,-176.27 358.73,-181.97 372.98,-187.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="371.91,-190.37 382.51,-190.41 374.26,-183.77 371.91,-190.37"/>
</g>
<!-- Node14&#45;&gt;Node3 -->
<g id="edge20" class="edge">
<title>Node14&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M105.86,-228.69C116.44,-237 132.59,-248.87 148,-257 170.74,-268.99 238.15,-292.72 275.28,-305.45"/>
<polygon fill="midnightblue" stroke="midnightblue" points="274.29,-308.81 284.89,-308.73 276.55,-302.19 274.29,-308.81"/>
</g>
<!-- Node14&#45;&gt;Node4 -->
<g id="edge21" class="edge">
<title>Node14&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M112.28,-222.75C123.44,-225.05 138.08,-228.05 151.4,-230.79"/>
<polygon fill="midnightblue" stroke="midnightblue" points="150.76,-234.23 161.26,-232.82 152.17,-227.38 150.76,-234.23"/>
</g>
<!-- Node14&#45;&gt;Node9 -->
<g id="edge22" class="edge">
<title>Node14&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M103.55,-209.19C119.28,-193.04 150.82,-160.65 170.15,-140.79"/>
<polygon fill="midnightblue" stroke="midnightblue" points="172.67,-143.22 177.14,-133.61 167.66,-138.34 172.67,-143.22"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 14 KiB

14
d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map Normal file
View File

@@ -0,0 +1,14 @@
<map id="test1" name="test1">
<area shape="rect" id="node1" title="Self&#45;test implementations, 1st test." alt="" coords="5,81,56,108"/>
<area shape="rect" id="node2" href="$d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" title=" " alt="" coords="287,5,331,32"/>
<area shape="rect" id="node3" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="122,81,191,108"/>
<area shape="rect" id="node8" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="104,284,209,311"/>
<area shape="rect" id="node4" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="257,56,360,83"/>
<area shape="rect" id="node6" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="259,107,358,133"/>
<area shape="rect" id="node7" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="271,157,346,184"/>
<area shape="rect" id="node5" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="408,157,500,184"/>
<area shape="rect" id="node9" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="261,259,357,285"/>
<area shape="rect" id="node10" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="273,309,345,336"/>
<area shape="rect" id="node11" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="274,360,343,387"/>
<area shape="rect" id="node12" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="269,411,348,437"/>
</map>

1
d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
3bec5290d87010e3e3fc47c4fae30552

223
d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg Normal file
View File

@@ -0,0 +1,223 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: test1 Pages: 1 -->
<svg width="379pt" height="332pt"
viewBox="0.00 0.00 379.00 332.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 328)">
<title>test1</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-328 375,-328 375,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;test implementations, 1st test.">
<polygon fill="#bfbfbf" stroke="black" points="0,-247.5 0,-266.5 38,-266.5 38,-247.5 0,-247.5"/>
<text text-anchor="middle" x="19" y="-254.5" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="211,-304.5 211,-323.5 244,-323.5 244,-304.5 211,-304.5"/>
<text text-anchor="middle" x="227.5" y="-311.5" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.35,-263.94C48.74,-267.75 62.01,-272.4 74,-276 118.19,-289.25 170.52,-301.57 200.97,-308.41"/>
<polygon fill="midnightblue" stroke="midnightblue" points="200.26,-311.84 210.78,-310.6 201.78,-305.01 200.26,-311.84"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="black" points="87.5,-247.5 87.5,-266.5 139.5,-266.5 139.5,-247.5 87.5,-247.5"/>
<text text-anchor="middle" x="113.5" y="-254.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M38.28,-257C49.33,-257 63.79,-257 77.01,-257"/>
<polygon fill="midnightblue" stroke="midnightblue" points="77.26,-260.5 87.26,-257 77.26,-253.5 77.26,-260.5"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="black" points="74,-95.5 74,-114.5 153,-114.5 153,-95.5 74,-95.5"/>
<text text-anchor="middle" x="113.5" y="-102.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge11" class="edge">
<title>Node1&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M25.79,-247.49C40.84,-222.75 81.43,-156.05 101.28,-123.44"/>
<polygon fill="midnightblue" stroke="midnightblue" points="104.51,-124.87 106.72,-114.5 98.53,-121.23 104.51,-124.87"/>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M133.17,-266.54C148.23,-274.23 169.97,-285.33 189,-295 193.14,-297.1 197.53,-299.33 201.8,-301.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="200.3,-304.66 210.8,-306.06 203.47,-298.42 200.3,-304.66"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="189,-266.5 189,-285.5 266,-285.5 266,-266.5 189,-266.5"/>
<text text-anchor="middle" x="227.5" y="-273.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge4" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M139.63,-261.26C151.15,-263.22 165.19,-265.6 178.6,-267.87"/>
<polygon fill="midnightblue" stroke="midnightblue" points="178.23,-271.36 188.68,-269.58 179.41,-264.46 178.23,-271.36"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="190.5,-228.5 190.5,-247.5 264.5,-247.5 264.5,-228.5 190.5,-228.5"/>
<text text-anchor="middle" x="227.5" y="-235.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge7" class="edge">
<title>Node3&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M139.63,-252.74C151.68,-250.69 166.48,-248.18 180.44,-245.81"/>
<polygon fill="midnightblue" stroke="midnightblue" points="181.13,-249.25 190.4,-244.12 179.96,-242.35 181.13,-249.25"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="199.5,-190.5 199.5,-209.5 255.5,-209.5 255.5,-190.5 199.5,-190.5"/>
<text text-anchor="middle" x="227.5" y="-197.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge9" class="edge">
<title>Node3&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M133.17,-247.46C148.23,-239.77 169.97,-228.67 189,-219 191.99,-217.48 195.12,-215.89 198.24,-214.31"/>
<polygon fill="midnightblue" stroke="midnightblue" points="200.08,-217.3 207.42,-209.66 196.92,-211.06 200.08,-217.3"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="302,-190.5 302,-209.5 371,-209.5 371,-190.5 302,-190.5"/>
<text text-anchor="middle" x="336.5" y="-197.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M249.58,-266.33C255.06,-263.55 260.87,-260.35 266,-257 284.62,-244.86 304.03,-228.58 317.6,-216.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="320.14,-218.94 325.22,-209.65 315.45,-213.75 320.14,-218.94"/>
</g>
<!-- Node5&#45;&gt;Node5 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M319.85,-209.76C311.76,-218.57 317.3,-228 336.5,-228 348.5,-228 355.16,-224.31 356.5,-219.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="359.74,-218.05 353.15,-209.76 353.12,-220.35 359.74,-218.05"/>
</g>
<!-- Node6&#45;&gt;Node5 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M255.5,-228.41C268.68,-223.73 284.73,-218.03 298.98,-212.97"/>
<polygon fill="midnightblue" stroke="midnightblue" points="300.26,-216.23 308.51,-209.59 297.91,-209.63 300.26,-216.23"/>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M255.5,-200C266.53,-200 279.57,-200 291.88,-200"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.99,-203.5 301.99,-200 291.99,-196.5 291.99,-203.5"/>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge12" class="edge">
<title>Node8&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M132.02,-114.57C146.96,-122.58 169.13,-134.09 189,-143 225.92,-159.55 269.21,-176.04 299.1,-187"/>
<polygon fill="midnightblue" stroke="midnightblue" points="298.11,-190.36 308.7,-190.49 300.5,-183.78 298.11,-190.36"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="black" points="191.5,-114.5 191.5,-133.5 263.5,-133.5 263.5,-114.5 191.5,-114.5"/>
<text text-anchor="middle" x="227.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge13" class="edge">
<title>Node8&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M153.04,-111.54C162.15,-113.08 171.94,-114.75 181.32,-116.33"/>
<polygon fill="midnightblue" stroke="midnightblue" points="180.82,-119.8 191.27,-118.02 182,-112.9 180.82,-119.8"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="200.5,-76.5 200.5,-95.5 254.5,-95.5 254.5,-76.5 200.5,-76.5"/>
<text text-anchor="middle" x="227.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node10 -->
<g id="edge15" class="edge">
<title>Node8&#45;&gt;Node10</title>
<path fill="none" stroke="midnightblue" d="M153.04,-98.46C165.08,-96.42 178.32,-94.17 190.2,-92.16"/>
<polygon fill="midnightblue" stroke="midnightblue" points="190.95,-95.58 200.23,-90.46 189.78,-88.68 190.95,-95.58"/>
</g>
<!-- Node11 -->
<g id="node11" class="node">
<title>Node11</title>
<g id="a_node11"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="201.5,-38.5 201.5,-57.5 253.5,-57.5 253.5,-38.5 201.5,-38.5"/>
<text text-anchor="middle" x="227.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node11 -->
<g id="edge16" class="edge">
<title>Node8&#45;&gt;Node11</title>
<path fill="none" stroke="midnightblue" d="M133.17,-95.46C148.23,-87.77 169.97,-76.67 189,-67 191.99,-65.48 195.12,-63.89 198.24,-62.31"/>
<polygon fill="midnightblue" stroke="midnightblue" points="200.08,-65.3 207.42,-57.66 196.92,-59.06 200.08,-65.3"/>
</g>
<!-- Node12 -->
<g id="node12" class="node">
<title>Node12</title>
<g id="a_node12"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="198,-0.5 198,-19.5 257,-19.5 257,-0.5 198,-0.5"/>
<text text-anchor="middle" x="227.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node12 -->
<g id="edge17" class="edge">
<title>Node8&#45;&gt;Node12</title>
<path fill="none" stroke="midnightblue" d="M122.36,-95.11C135.09,-79.56 161.57,-49.09 189,-29 191.06,-27.49 193.26,-26.04 195.52,-24.66"/>
<polygon fill="midnightblue" stroke="midnightblue" points="197.36,-27.64 204.38,-19.7 193.94,-21.53 197.36,-27.64"/>
</g>
<!-- Node9&#45;&gt;Node5 -->
<g id="edge14" class="edge">
<title>Node9&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M243.99,-133.56C250.82,-137.86 258.88,-143.07 266,-148 282.67,-159.54 301.01,-173.32 314.66,-183.79"/>
<polygon fill="midnightblue" stroke="midnightblue" points="312.84,-186.8 322.89,-190.13 317.11,-181.25 312.84,-186.8"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 12 KiB

2
d5/d88/md__d_i_r_e_c_t_o_r_y.html
View File

@@ -150,6 +150,8 @@ Data Structures</h1>
</li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/disjoint_set.cpp" target="_blank">Disjoint Set</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/doubly_linked_list.cpp" target="_blank">Doubly Linked List</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/dsu_path_compression.cpp" target="_blank">Dsu Path Compression</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/dsu_union_rank.cpp" target="_blank">Dsu Union Rank</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/linked_list.cpp" target="_blank">Linked List</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/linkedlist_implentation_usingarray.cpp" target="_blank">Linkedlist Implentation Usingarray</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/list_array.cpp" target="_blank">List Array</a></li>

6
d7/dda/dsu__union__rank_8cpp__incl.map Normal file
View File

@@ -0,0 +1,6 @@
<map id="data_structures/dsu_union_rank.cpp" name="data_structures/dsu_union_rank.cpp">
<area shape="rect" id="node1" title="DSU (Disjoint sets)" alt="" coords="62,5,201,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,71,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="95,95,168,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="193,95,251,121"/>
</map>

1
d7/dda/dsu__union__rank_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
2bea4e84d633d060d571c12ebb17f64a

68
d7/dda/dsu__union__rank_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,68 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: data_structures/dsu_union_rank.cpp Pages: 1 -->
<svg width="193pt" height="95pt"
viewBox="0.00 0.00 192.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>data_structures/dsu_union_rank.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 188.5,-91 188.5,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="DSU (Disjoint sets)">
<polygon fill="#bfbfbf" stroke="black" points="42.5,-56.5 42.5,-86.5 146.5,-86.5 146.5,-56.5 42.5,-56.5"/>
<text text-anchor="start" x="50.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/dsu</text>
<text text-anchor="middle" x="94.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_union_rank.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
<text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M77.91,-56.4C67.21,-47.31 53.31,-35.49 42.37,-26.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="44.57,-23.47 34.69,-19.66 40.04,-28.8 44.57,-23.47"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67,-0.5 67,-19.5 122,-19.5 122,-0.5 67,-0.5"/>
<text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M94.5,-56.4C94.5,-48.47 94.5,-38.46 94.5,-29.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="98,-29.66 94.5,-19.66 91,-29.66 98,-29.66"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="140.5,-0.5 140.5,-19.5 184.5,-19.5 184.5,-0.5 140.5,-0.5"/>
<text text-anchor="middle" x="162.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M110.62,-56.4C120.9,-47.4 134.25,-35.72 144.83,-26.47"/>
<polygon fill="midnightblue" stroke="midnightblue" points="147.38,-28.88 152.61,-19.66 142.77,-23.61 147.38,-28.88"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.0 KiB

3
d8/d99/connected__components__with__dsu_8cpp.html
View File

@@ -330,7 +330,7 @@ Here is the call graph for this function:</div>
<p>Test Implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> {</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keyword">namespace </span>dsu = graph::disjoint_union;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keyword">namespace </span><a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> = graph::disjoint_union;</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; dsu::number_of_nodes;</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> dsu::parent.resize(dsu::number_of_nodes + 1);</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> dsu::connected_set_size.resize(dsu::number_of_nodes + 1);</div>
@@ -346,6 +346,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span>}</div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:33</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
</div><!-- fragment -->
</div>

6
db/de3/dsu__path__compression_8cpp__incl.map Normal file
View File

@@ -0,0 +1,6 @@
<map id="data_structures/dsu_path_compression.cpp" name="data_structures/dsu_path_compression.cpp">
<area shape="rect" id="node1" title="DSU (Disjoint sets)" alt="" coords="49,5,213,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,71,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="95,95,168,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="193,95,251,121"/>
</map>

1
db/de3/dsu__path__compression_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
ad4e904f4dbafcf8342876c023a9313d

68
db/de3/dsu__path__compression_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,68 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: data_structures/dsu_path_compression.cpp Pages: 1 -->
<svg width="193pt" height="95pt"
viewBox="0.00 0.00 192.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>data_structures/dsu_path_compression.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 188.5,-91 188.5,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="DSU (Disjoint sets)">
<polygon fill="#bfbfbf" stroke="black" points="33,-56.5 33,-86.5 156,-86.5 156,-56.5 33,-56.5"/>
<text text-anchor="start" x="41" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/dsu</text>
<text text-anchor="middle" x="94.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_path_compression.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
<text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M77.91,-56.4C67.21,-47.31 53.31,-35.49 42.37,-26.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="44.57,-23.47 34.69,-19.66 40.04,-28.8 44.57,-23.47"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67,-0.5 67,-19.5 122,-19.5 122,-0.5 67,-0.5"/>
<text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M94.5,-56.4C94.5,-48.47 94.5,-38.46 94.5,-29.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="98,-29.66 94.5,-19.66 91,-29.66 98,-29.66"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="140.5,-0.5 140.5,-19.5 184.5,-19.5 184.5,-0.5 140.5,-0.5"/>
<text text-anchor="middle" x="162.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M110.62,-56.4C120.9,-47.4 134.25,-35.72 144.83,-26.47"/>
<polygon fill="midnightblue" stroke="midnightblue" points="147.38,-28.88 152.61,-19.66 142.77,-23.61 147.38,-28.88"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.0 KiB

916
dd/d1f/classdsu.html Normal file
View File

@@ -0,0 +1,916 @@
<!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">
<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.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: dsu Class Reference</title>
<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>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.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/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('dd/d1f/classdsu.html','../../'); initResizable(); });
/* @license-end */
</script>
<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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="../../d0/dcb/classdsu-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">dsu Class Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Disjoint sets union data structure, class based representation.
<a href="../../dd/d1f/classdsu.html#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a126e3002a464e53cd54b07ba56482a72"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu</a> (uint64_t n)</td></tr>
<tr class="memdesc:a126e3002a464e53cd54b07ba56482a72"><td class="mdescLeft">&#160;</td><td class="mdescRight">contructor for initialising all data members. <a href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">More...</a><br /></td></tr>
<tr class="separator:a126e3002a464e53cd54b07ba56482a72"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a16851f78fe390fc1430905c83d6a2f1c"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a> (uint64_t i)</td></tr>
<tr class="memdesc:a16851f78fe390fc1430905c83d6a2f1c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method to find the representative of the set to which i belongs to, T(n) = O(1) <a href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">More...</a><br /></td></tr>
<tr class="separator:a16851f78fe390fc1430905c83d6a2f1c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6ac30c07abca2aaa3b291504c25c3559"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a> (uint64_t i, uint64_t j)</td></tr>
<tr class="memdesc:a6ac30c07abca2aaa3b291504c25c3559"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative. <a href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">More...</a><br /></td></tr>
<tr class="separator:a6ac30c07abca2aaa3b291504c25c3559"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a64d25c5986742f7c234ed449b2ff7303"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a> (uint64_t i, uint64_t j)</td></tr>
<tr class="memdesc:a64d25c5986742f7c234ed449b2ff7303"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function which check whether i and j belongs to same set or not. <a href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">More...</a><br /></td></tr>
<tr class="separator:a64d25c5986742f7c234ed449b2ff7303"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ce2672c570f4235eafddb0c9a58115a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">get</a> (uint64_t i)</td></tr>
<tr class="memdesc:a0ce2672c570f4235eafddb0c9a58115a"><td class="mdescLeft">&#160;</td><td class="mdescRight">prints the minimum, maximum and size of the set to which i belongs to <a href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">More...</a><br /></td></tr>
<tr class="separator:a0ce2672c570f4235eafddb0c9a58115a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1c24228b0f2f49220133fb8c3566a55c"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">size</a> (uint64_t i)</td></tr>
<tr class="memdesc:a1c24228b0f2f49220133fb8c3566a55c"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function that returns the size of the set to which i belongs to. <a href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">More...</a><br /></td></tr>
<tr class="separator:a1c24228b0f2f49220133fb8c3566a55c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a696141b8b092466767f4bfe1c5e46cde"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">get_max</a> (uint64_t i)</td></tr>
<tr class="memdesc:a696141b8b092466767f4bfe1c5e46cde"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function that returns the max element of the set to which i belongs to. <a href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">More...</a><br /></td></tr>
<tr class="separator:a696141b8b092466767f4bfe1c5e46cde"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac713a5b496d0405c82e2808a85e58415"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">get_min</a> (uint64_t i)</td></tr>
<tr class="memdesc:ac713a5b496d0405c82e2808a85e58415"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function that returns the min element of the set to which i belongs to. <a href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">More...</a><br /></td></tr>
<tr class="separator:ac713a5b496d0405c82e2808a85e58415"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a126e3002a464e53cd54b07ba56482a72"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu</a> (uint64_t n)</td></tr>
<tr class="memdesc:a126e3002a464e53cd54b07ba56482a72"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor for initialising all data members <a href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">More...</a><br /></td></tr>
<tr class="separator:a126e3002a464e53cd54b07ba56482a72"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a16851f78fe390fc1430905c83d6a2f1c"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a> (uint64_t i)</td></tr>
<tr class="memdesc:a16851f78fe390fc1430905c83d6a2f1c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method to find the representative of the set to which i belongs to, T(n) = O(logN) <a href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">More...</a><br /></td></tr>
<tr class="separator:a16851f78fe390fc1430905c83d6a2f1c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a81897528bdb53fd5e796d75d7dbc430f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a> (uint64_t i, uint64_t j)</td></tr>
<tr class="memdesc:a81897528bdb53fd5e796d75d7dbc430f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative. <a href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">More...</a><br /></td></tr>
<tr class="separator:a81897528bdb53fd5e796d75d7dbc430f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a64d25c5986742f7c234ed449b2ff7303"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a> (uint64_t i, uint64_t j)</td></tr>
<tr class="memdesc:a64d25c5986742f7c234ed449b2ff7303"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function which check whether i and j belongs to same set or not. <a href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">More...</a><br /></td></tr>
<tr class="separator:a64d25c5986742f7c234ed449b2ff7303"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab8ee27083a3c2e2df80755165a2ec280"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280">getParents</a> (uint64_t i)</td></tr>
<tr class="memdesc:ab8ee27083a3c2e2df80755165a2ec280"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method to print all the parents of i, or the path from i to representative. <a href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280">More...</a><br /></td></tr>
<tr class="separator:ab8ee27083a3c2e2df80755165a2ec280"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a1ef0b0462a0dda63514f641cbb7dd8cb"><td class="memItemLeft" align="right" valign="top"><a id="a1ef0b0462a0dda63514f641cbb7dd8cb" name="a1ef0b0462a0dda63514f641cbb7dd8cb"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>p</b></td></tr>
<tr class="memdesc:a1ef0b0462a0dda63514f641cbb7dd8cb"><td class="mdescLeft">&#160;</td><td class="mdescRight">keeps track of the parent of ith element <br /></td></tr>
<tr class="separator:a1ef0b0462a0dda63514f641cbb7dd8cb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4bf54d33fba178998dbbe4c57f2e9429"><td class="memItemLeft" align="right" valign="top"><a id="a4bf54d33fba178998dbbe4c57f2e9429" name="a4bf54d33fba178998dbbe4c57f2e9429"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>depth</b></td></tr>
<tr class="memdesc:a4bf54d33fba178998dbbe4c57f2e9429"><td class="mdescLeft">&#160;</td><td class="mdescRight">tracks the depth(rank) of i in the tree <br /></td></tr>
<tr class="separator:a4bf54d33fba178998dbbe4c57f2e9429"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac0dc3e17e49fe19b159b4ea4096d7b55"><td class="memItemLeft" align="right" valign="top"><a id="ac0dc3e17e49fe19b159b4ea4096d7b55" name="ac0dc3e17e49fe19b159b4ea4096d7b55"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>setSize</b></td></tr>
<tr class="memdesc:ac0dc3e17e49fe19b159b4ea4096d7b55"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of each chunk(set) <br /></td></tr>
<tr class="separator:ac0dc3e17e49fe19b159b4ea4096d7b55"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4ade6f16c418fc98b54452f7b0252a53"><td class="memItemLeft" align="right" valign="top"><a id="a4ade6f16c418fc98b54452f7b0252a53" name="a4ade6f16c418fc98b54452f7b0252a53"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>maxElement</b></td></tr>
<tr class="memdesc:a4ade6f16c418fc98b54452f7b0252a53"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum of each set to which i belongs to <br /></td></tr>
<tr class="separator:a4ade6f16c418fc98b54452f7b0252a53"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1d77aad7fc39fe7140d834cd347e5c63"><td class="memItemLeft" align="right" valign="top"><a id="a1d77aad7fc39fe7140d834cd347e5c63" name="a1d77aad7fc39fe7140d834cd347e5c63"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>minElement</b></td></tr>
<tr class="memdesc:a1d77aad7fc39fe7140d834cd347e5c63"><td class="mdescLeft">&#160;</td><td class="mdescRight">minimum of each set to which i belongs to <br /></td></tr>
<tr class="separator:a1d77aad7fc39fe7140d834cd347e5c63"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Disjoint sets union data structure, class based representation. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>number of elements </td></tr>
</table>
</dd>
</dl>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a126e3002a464e53cd54b07ba56482a72" name="a126e3002a464e53cd54b07ba56482a72"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a126e3002a464e53cd54b07ba56482a72">&#9670;&nbsp;</a></span>dsu() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">dsu::dsu </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>contructor for initialising all data members. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>number of elements </td></tr>
</table>
</dd>
</dl>
<p >initially, all of them are their own parents</p>
<p >initially all have depth are equals to zero</p>
<p >initially set size will be equals to one</p>
<div class="fragment"><div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> {</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);<span class="comment"></span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment"> /// initially, all of them are their own parents</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="comment"></span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = i;</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> }<span class="comment"></span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="comment"> /// initially all have depth are equals to zero</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment"></span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>.assign(n, 0);</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>.assign(n, 0);</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[i] = 0;</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[i] = i;</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[i] = i;</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> }</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>.assign(n, 0);<span class="comment"></span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment"> /// initially set size will be equals to one</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment"></span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[i] = 1;</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> }</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> }</div>
<div class="ttc" id="aclassdsu_html_a1d77aad7fc39fe7140d834cd347e5c63"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">dsu::minElement</a></div><div class="ttdeci">vector&lt; uint64_t &gt; minElement</div><div class="ttdoc">minimum of each set to which i belongs to</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:39</div></div>
<div class="ttc" id="aclassdsu_html_a1ef0b0462a0dda63514f641cbb7dd8cb"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">dsu::p</a></div><div class="ttdeci">vector&lt; uint64_t &gt; p</div><div class="ttdoc">keeps track of the parent of ith element</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:35</div></div>
<div class="ttc" id="aclassdsu_html_a4ade6f16c418fc98b54452f7b0252a53"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">dsu::maxElement</a></div><div class="ttdeci">vector&lt; uint64_t &gt; maxElement</div><div class="ttdoc">maximum of each set to which i belongs to</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:38</div></div>
<div class="ttc" id="aclassdsu_html_a4bf54d33fba178998dbbe4c57f2e9429"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">dsu::depth</a></div><div class="ttdeci">vector&lt; uint64_t &gt; depth</div><div class="ttdoc">tracks the depth(rank) of i in the tree</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:36</div></div>
<div class="ttc" id="aclassdsu_html_ac0dc3e17e49fe19b159b4ea4096d7b55"><div class="ttname"><a href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">dsu::setSize</a></div><div class="ttdeci">vector&lt; uint64_t &gt; setSize</div><div class="ttdoc">size of each chunk(set)</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:37</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a126e3002a464e53cd54b07ba56482a72" name="a126e3002a464e53cd54b07ba56482a72"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a126e3002a464e53cd54b07ba56482a72">&#9670;&nbsp;</a></span>dsu() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">dsu::dsu </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>constructor for initialising all data members </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>number of elements </td></tr>
</table>
</dd>
</dl>
<p >initially all of them are their own parents</p>
<div class="fragment"><div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> {</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);<span class="comment"></span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment"> /// initially all of them are their own parents</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment"></span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>.assign(n, 0);</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = i;</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[i] = 0;</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[i] = 1;</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> }</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> }</div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a16851f78fe390fc1430905c83d6a2f1c" name="a16851f78fe390fc1430905c83d6a2f1c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a16851f78fe390fc1430905c83d6a2f1c">&#9670;&nbsp;</a></span>findSet() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t dsu::findSet </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Method to find the representative of the set to which i belongs to, T(n) = O(1) </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>representative of the set to which i belongs to. </dd></dl>
<p >using path compression</p>
<div class="fragment"><div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> {<span class="comment"></span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment"> /// using path compression</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment"></span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] == i) {</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">return</span> i;</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i]));</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
<div class="ttc" id="aclassdsu_html_a16851f78fe390fc1430905c83d6a2f1c"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">dsu::findSet</a></div><div class="ttdeci">uint64_t findSet(uint64_t i)</div><div class="ttdoc">Method to find the representative of the set to which i belongs to, T(n) = O(1)</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:73</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.svg" width="103" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a16851f78fe390fc1430905c83d6a2f1c" name="a16851f78fe390fc1430905c83d6a2f1c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a16851f78fe390fc1430905c83d6a2f1c">&#9670;&nbsp;</a></span>findSet() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t dsu::findSet </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Method to find the representative of the set to which i belongs to, T(n) = O(logN) </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>representative of the set to which i belongs to </dd></dl>
<p >using union-rank</p>
<div class="fragment"><div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> {<span class="comment"></span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment"> /// using union-rank</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="comment"></span> <span class="keywordflow">while</span> (i != <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i]) {</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> i = <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i];</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> }</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">return</span> i;</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a0ce2672c570f4235eafddb0c9a58115a" name="a0ce2672c570f4235eafddb0c9a58115a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ce2672c570f4235eafddb0c9a58115a">&#9670;&nbsp;</a></span>get()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt; dsu::get </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>prints the minimum, maximum and size of the set to which i belongs to </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> {</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>;</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>.push_back(<a class="code hl_function" href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">get_min</a>(i));</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>.push_back(<a class="code hl_function" href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">get_max</a>(i));</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>.push_back(<a class="code hl_function" href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">size</a>(i));</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>;</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> }</div>
<div class="ttc" id="aclassdsu_html_a1c24228b0f2f49220133fb8c3566a55c"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu::size</a></div><div class="ttdeci">uint64_t size(uint64_t i)</div><div class="ttdoc">A utility function that returns the size of the set to which i belongs to.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:148</div></div>
<div class="ttc" id="aclassdsu_html_a696141b8b092466767f4bfe1c5e46cde"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">dsu::get_max</a></div><div class="ttdeci">uint64_t get_max(uint64_t i)</div><div class="ttdoc">A utility function that returns the max element of the set to which i belongs to.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:155</div></div>
<div class="ttc" id="aclassdsu_html_ac713a5b496d0405c82e2808a85e58415"><div class="ttname"><a href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">dsu::get_min</a></div><div class="ttdeci">uint64_t get_min(uint64_t i)</div><div class="ttdoc">A utility function that returns the min element of the set to which i belongs to.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:162</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.svg" width="371" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a696141b8b092466767f4bfe1c5e46cde" name="a696141b8b092466767f4bfe1c5e46cde"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a696141b8b092466767f4bfe1c5e46cde">&#9670;&nbsp;</a></span>get_max()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t dsu::get_max </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function that returns the max element of the set to which i belongs to. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>maximum of the set to which i belongs to </dd></dl>
<div class="fragment"><div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.svg" width="254" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ac713a5b496d0405c82e2808a85e58415" name="ac713a5b496d0405c82e2808a85e58415"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac713a5b496d0405c82e2808a85e58415">&#9670;&nbsp;</a></span>get_min()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t dsu::get_min </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function that returns the min element of the set to which i belongs to. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>minimum of the set to which i belongs to </dd></dl>
<div class="fragment"><div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.svg" width="250" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ab8ee27083a3c2e2df80755165a2ec280" name="ab8ee27083a3c2e2df80755165a2ec280"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab8ee27083a3c2e2df80755165a2ec280">&#9670;&nbsp;</a></span>getParents()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt; dsu::getParents </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Method to print all the parents of i, or the path from i to representative. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> {</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>;</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordflow">while</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] != i) {</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>.push_back(i);</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> i = <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i];</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> }</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>.push_back(i);</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>;</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_ab8ee27083a3c2e2df80755165a2ec280_cgraph.svg" width="219" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a64d25c5986742f7c234ed449b2ff7303" name="a64d25c5986742f7c234ed449b2ff7303"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a64d25c5986742f7c234ed449b2ff7303">&#9670;&nbsp;</a></span>isSame() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool dsu::isSame </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>j</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function which check whether i and j belongs to same set or not. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
<tr><td class="paramname">j</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if element <code>i</code> and <code>j</code> ARE in the same set </dd>
<dd>
<code>false</code> if element <code>i</code> and <code>j</code> are NOT in same set </dd></dl>
<div class="fragment"><div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> {</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i) == <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j)) {</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> }</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.svg" width="247" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a64d25c5986742f7c234ed449b2ff7303" name="a64d25c5986742f7c234ed449b2ff7303"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a64d25c5986742f7c234ed449b2ff7303">&#9670;&nbsp;</a></span>isSame() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool dsu::isSame </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>j</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function which check whether i and j belongs to same set or not. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
<tr><td class="paramname">j</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if element i and j are in same set </dd>
<dd>
<code>false</code> if element i and j are not in same set </dd></dl>
<div class="fragment"><div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> {</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i) == <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j)) {</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> }</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.svg" width="247" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a1c24228b0f2f49220133fb8c3566a55c" name="a1c24228b0f2f49220133fb8c3566a55c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1c24228b0f2f49220133fb8c3566a55c">&#9670;&nbsp;</a></span>size()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t dsu::size </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function that returns the size of the set to which i belongs to. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>size of the set to which i belongs to </dd></dl>
<div class="fragment"><div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.svg" width="226" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a6ac30c07abca2aaa3b291504c25c3559" name="a6ac30c07abca2aaa3b291504c25c3559"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6ac30c07abca2aaa3b291504c25c3559">&#9670;&nbsp;</a></span>UnionSet()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void dsu::UnionSet </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>j</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
<tr><td class="paramname">j</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >check if both belongs to the same set or not</p>
<p >always keeping the min as x shallow tree</p>
<p >making the shallower root's parent the deeper root</p>
<p >if same depth, then increase one's depth</p>
<p >total size of the resultant set</p>
<p >changing the maximum elements</p>
<div class="fragment"><div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> {<span class="comment"></span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span><span class="comment"> /// check if both belongs to the same set or not</span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment"></span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> }</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> </div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// we find the representative of the i and j</span></div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> uint64_t x = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i);</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> uint64_t y = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j);</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="comment"></span> </div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="comment"> /// always keeping the min as x</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="comment"> /// shallow tree</span></div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span><span class="comment"></span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(x, y);</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> }<span class="comment"></span></div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span><span class="comment"> /// making the shallower root&#39;s parent the deeper root</span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><span class="comment"></span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span><span class="comment"></span> </div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span><span class="comment"> /// if same depth, then increase one&#39;s depth</span></div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="comment"></span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]++;</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> }<span class="comment"></span></div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span><span class="comment"> /// total size of the resultant set</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span><span class="comment"></span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];<span class="comment"></span></div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="comment"> /// changing the maximum elements</span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment"></span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[x], <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y]);</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[x], <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y]);</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> }</div>
<div class="ttc" id="aclassdsu_html_a64d25c5986742f7c234ed449b2ff7303"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">dsu::isSame</a></div><div class="ttdeci">bool isSame(uint64_t i, uint64_t j)</div><div class="ttdoc">A utility function which check whether i and j belongs to same set or not.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:123</div></div>
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.svg" width="400" height="239"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a81897528bdb53fd5e796d75d7dbc430f" name="a81897528bdb53fd5e796d75d7dbc430f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a81897528bdb53fd5e796d75d7dbc430f">&#9670;&nbsp;</a></span>unionSet()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void dsu::unionSet </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>i</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>j</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
<tr><td class="paramname">j</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >checks if both belongs to same set or not</p>
<p >we find representative of the i and j</p>
<p >always keeping the min as x in order to create a shallow tree</p>
<p >making the shallower tree, root parent of the deeper root</p>
<p >if same depth, then increase one's depth</p>
<p >total size of the resultant set</p>
<div class="fragment"><div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> {<span class="comment"></span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment"> /// checks if both belongs to same set or not</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span><span class="comment"></span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }<span class="comment"></span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="comment"> /// we find representative of the i and j</span></div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="comment"></span> uint64_t x = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i);</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> uint64_t y = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j);</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment"></span> </div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment"> /// always keeping the min as x</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment"> /// in order to create a shallow tree</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment"></span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(x, y);</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }<span class="comment"></span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment"> /// making the shallower tree, root parent of the deeper root</span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="comment"></span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span><span class="comment"></span> </div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span><span class="comment"> /// if same depth, then increase one&#39;s depth</span></div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span><span class="comment"></span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]++;</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> }<span class="comment"></span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="comment"> /// total size of the resultant set</span></div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="comment"></span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.svg" width="399" height="138"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li>data_structures/<a class="el" href="../../d3/dae/dsu__path__compression_8cpp.html">dsu_path_compression.cpp</a></li>
<li>data_structures/<a class="el" href="../../df/d28/dsu__union__rank_8cpp.html">dsu_union_rank.cpp</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dd/d1f/classdsu.html">dsu</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.9.2 </li>
</ul>
</div>
</body>
</html>

21
dd/d1f/classdsu.js Normal file
View File

@@ -0,0 +1,21 @@
var classdsu =
[
[ "dsu", "dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72", null ],
[ "dsu", "dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72", null ],
[ "findSet", "dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c", null ],
[ "findSet", "dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c", null ],
[ "get", "dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a", null ],
[ "get_max", "dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde", null ],
[ "get_min", "dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415", null ],
[ "getParents", "dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280", null ],
[ "isSame", "dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303", null ],
[ "isSame", "dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303", null ],
[ "size", "dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c", null ],
[ "UnionSet", "dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559", null ],
[ "unionSet", "dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f", null ],
[ "depth", "dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429", null ],
[ "maxElement", "dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53", null ],
[ "minElement", "dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63", null ],
[ "p", "dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb", null ],
[ "setSize", "dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55", null ]
];

8
dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.map Normal file
View File

@@ -0,0 +1,8 @@
<map id="dsu::get" name="dsu::get">
<area shape="rect" id="node1" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="5,81,75,108"/>
<area shape="rect" id="node2" href="$d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" title=" " alt="" coords="152,5,196,32"/>
<area shape="rect" id="node3" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="123,56,225,83"/>
<area shape="rect" id="node5" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="125,107,223,133"/>
<area shape="rect" id="node6" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="137,157,211,184"/>
<area shape="rect" id="node4" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="273,107,365,133"/>
</map>

1
dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
490a8d37b5f0cb86c4f3a58c56b5ea6d

115
dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.svg Normal file
View File

@@ -0,0 +1,115 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: dsu::get Pages: 1 -->
<svg width="278pt" height="142pt"
viewBox="0.00 0.00 278.00 142.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138)">
<title>dsu::get</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 274,-138 274,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="#bfbfbf" stroke="black" points="0,-57.5 0,-76.5 52,-76.5 52,-57.5 0,-57.5"/>
<text text-anchor="middle" x="26" y="-64.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="110,-114.5 110,-133.5 143,-133.5 143,-114.5 110,-114.5"/>
<text text-anchor="middle" x="126.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M41.82,-76.74C54.04,-84.65 71.91,-95.94 88,-105 92.04,-107.28 96.39,-109.6 100.65,-111.8"/>
<polygon fill="midnightblue" stroke="midnightblue" points="99.14,-114.96 109.65,-116.35 102.31,-108.71 99.14,-114.96"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="88,-76.5 88,-95.5 165,-95.5 165,-76.5 88,-76.5"/>
<text text-anchor="middle" x="126.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M52.11,-71.84C59.98,-73.36 68.94,-75.09 77.83,-76.81"/>
<polygon fill="midnightblue" stroke="midnightblue" points="77.3,-80.27 87.78,-78.72 78.62,-73.39 77.3,-80.27"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="89.5,-38.5 89.5,-57.5 163.5,-57.5 163.5,-38.5 89.5,-38.5"/>
<text text-anchor="middle" x="126.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M52.11,-62.16C60.4,-60.56 69.9,-58.73 79.25,-56.92"/>
<polygon fill="midnightblue" stroke="midnightblue" points="80.13,-60.32 89.28,-54.99 78.8,-53.44 80.13,-60.32"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="black" points="98.5,-0.5 98.5,-19.5 154.5,-19.5 154.5,-0.5 98.5,-0.5"/>
<text text-anchor="middle" x="126.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge7" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M41.82,-57.26C54.04,-49.35 71.91,-38.06 88,-29 90.86,-27.39 93.88,-25.76 96.9,-24.16"/>
<polygon fill="midnightblue" stroke="midnightblue" points="98.58,-27.23 105.86,-19.54 95.37,-21.01 98.58,-27.23"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="201,-38.5 201,-57.5 270,-57.5 270,-38.5 201,-38.5"/>
<text text-anchor="middle" x="235.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M154.5,-76.41C167.68,-71.73 183.73,-66.03 197.98,-60.97"/>
<polygon fill="midnightblue" stroke="midnightblue" points="199.26,-64.23 207.51,-57.59 196.91,-57.63 199.26,-64.23"/>
</g>
<!-- Node4&#45;&gt;Node4 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M218.85,-57.76C210.76,-66.57 216.3,-76 235.5,-76 247.5,-76 254.16,-72.31 255.5,-67.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="258.74,-66.05 252.15,-57.76 252.12,-68.35 258.74,-66.05"/>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M163.73,-48C172.35,-48 181.65,-48 190.58,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="190.84,-51.5 200.84,-48 190.84,-44.5 190.84,-51.5"/>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M154.5,-19.59C167.68,-24.27 183.73,-29.97 197.98,-35.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="196.91,-38.37 207.51,-38.41 199.26,-31.77 196.91,-38.37"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.9 KiB

3
dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="dsu::findSet" name="dsu::findSet">
<area shape="rect" id="node1" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="5,29,97,56"/>
</map>

1
dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
68901429c8095fec6a63c6963f3a6644

28
dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.svg Normal file
View File

@@ -0,0 +1,28 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: dsu::findSet Pages: 1 -->
<svg width="77pt" height="46pt"
viewBox="0.00 0.00 77.00 46.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42)">
<title>dsu::findSet</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 73,-42 73,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 69,-19.5 69,-0.5 0,-0.5"/>
<text text-anchor="middle" x="34.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M24.02,-19.76C18.92,-28.57 22.41,-38 34.5,-38 41.86,-38 46.04,-34.5 47.02,-29.77"/>
<polygon fill="midnightblue" stroke="midnightblue" points="50.41,-28.86 44.98,-19.76 43.55,-30.25 50.41,-28.86"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.3 KiB

4
dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="dsu::size" name="dsu::size">
<area shape="rect" id="node1" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="5,29,80,56"/>
<area shape="rect" id="node2" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="128,29,220,56"/>
</map>

1
dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
623f7b626b35cfcf465d13ea8247d333

43
dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.svg Normal file
View File

@@ -0,0 +1,43 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: dsu::size Pages: 1 -->
<svg width="169pt" height="46pt"
viewBox="0.00 0.00 169.00 46.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42)">
<title>dsu::size</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 165,-42 165,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 56,-19.5 56,-0.5 0,-0.5"/>
<text text-anchor="middle" x="28" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="92,-0.5 92,-19.5 161,-19.5 161,-0.5 92,-0.5"/>
<text text-anchor="middle" x="126.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M56.14,-10C64.07,-10 72.95,-10 81.64,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="81.69,-13.5 91.69,-10 81.69,-6.5 81.69,-13.5"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M111.4,-19.76C104.05,-28.57 109.08,-38 126.5,-38 137.39,-38 143.44,-34.31 144.65,-29.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="147.95,-28.24 141.6,-19.76 141.28,-30.35 147.95,-28.24"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.1 KiB

4
dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="dsu::isSame" name="dsu::isSame">
<area shape="rect" id="node1" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="5,29,101,56"/>
<area shape="rect" id="node2" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="149,29,241,56"/>
</map>

1
dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
96cd263a1b02117642467e38dc9d3ca0

43
dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.svg Normal file
View File

@@ -0,0 +1,43 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: dsu::isSame Pages: 1 -->
<svg width="185pt" height="46pt"
viewBox="0.00 0.00 185.00 46.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42)">
<title>dsu::isSame</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 181,-42 181,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 72,-19.5 72,-0.5 0,-0.5"/>
<text text-anchor="middle" x="36" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="108,-0.5 108,-19.5 177,-19.5 177,-0.5 108,-0.5"/>
<text text-anchor="middle" x="142.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M72.09,-10C80.27,-10 89.07,-10 97.58,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="97.74,-13.5 107.74,-10 97.74,-6.5 97.74,-13.5"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M126.16,-19.76C118.21,-28.57 123.66,-38 142.5,-38 154.27,-38 160.82,-34.31 162.13,-29.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="165.38,-28.09 158.84,-19.76 158.76,-30.35 165.38,-28.09"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.1 KiB

4
dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="dsu::get_max" name="dsu::get_max">
<area shape="rect" id="node1" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="5,29,108,56"/>
<area shape="rect" id="node2" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="156,29,248,56"/>
</map>

1
dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
831d13dfb388de7742825db431cdc93a

43
dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.svg Normal file
View File

@@ -0,0 +1,43 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: dsu::get_max Pages: 1 -->
<svg width="190pt" height="46pt"
viewBox="0.00 0.00 190.00 46.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42)">
<title>dsu::get_max</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 186,-42 186,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 77,-19.5 77,-0.5 0,-0.5"/>
<text text-anchor="middle" x="38.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="113,-0.5 113,-19.5 182,-19.5 182,-0.5 113,-0.5"/>
<text text-anchor="middle" x="147.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M77.22,-10C85.44,-10 94.19,-10 102.62,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="102.68,-13.5 112.68,-10 102.68,-6.5 102.68,-13.5"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M130.85,-19.76C122.76,-28.57 128.3,-38 147.5,-38 159.5,-38 166.16,-34.31 167.5,-29.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="170.74,-28.05 164.15,-19.76 164.12,-30.35 170.74,-28.05"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.1 KiB

8
dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.map Normal file
View File

@@ -0,0 +1,8 @@
<map id="dsu::UnionSet" name="dsu::UnionSet">
<area shape="rect" id="node1" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="5,105,111,132"/>
<area shape="rect" id="node2" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="303,29,395,56"/>
<area shape="rect" id="node3" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="159,55,255,81"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="171,105,243,132"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="172,156,241,183"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="167,207,246,233"/>
</map>

1
dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
6e96a1598377c2c50062e9990a4335f6

109
dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.svg Normal file
View File

@@ -0,0 +1,109 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: dsu::UnionSet Pages: 1 -->
<svg width="300pt" height="179pt"
viewBox="0.00 0.00 300.00 179.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 175)">
<title>dsu::UnionSet</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-175 296,-175 296,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 79,-95.5 79,-76.5 0,-76.5"/>
<text text-anchor="middle" x="39.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="223,-133.5 223,-152.5 292,-152.5 292,-133.5 223,-133.5"/>
<text text-anchor="middle" x="257.5" y="-140.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M48.96,-95.6C61.68,-109.24 87.24,-133.6 115,-143 146.5,-153.67 184.25,-153.05 212.84,-150.11"/>
<polygon fill="midnightblue" stroke="midnightblue" points="213.4,-153.56 222.93,-148.93 212.59,-146.61 213.4,-153.56"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="black" points="115,-114.5 115,-133.5 187,-133.5 187,-114.5 115,-114.5"/>
<text text-anchor="middle" x="151" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M68.13,-95.59C81.62,-100.27 98.04,-105.97 112.63,-111.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="111.78,-114.44 122.38,-114.41 114.08,-107.83 111.78,-114.44"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="124,-76.5 124,-95.5 178,-95.5 178,-76.5 124,-76.5"/>
<text text-anchor="middle" x="151" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M79.11,-86C90.3,-86 102.49,-86 113.55,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="113.75,-89.5 123.75,-86 113.75,-82.5 113.75,-89.5"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="125,-38.5 125,-57.5 177,-57.5 177,-38.5 125,-38.5"/>
<text text-anchor="middle" x="151" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M68.13,-76.41C82.48,-71.43 100.14,-65.3 115.39,-60.01"/>
<polygon fill="midnightblue" stroke="midnightblue" points="116.7,-63.26 125,-56.68 114.4,-56.65 116.7,-63.26"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="121.5,-0.5 121.5,-19.5 180.5,-19.5 180.5,-0.5 121.5,-0.5"/>
<text text-anchor="middle" x="151" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge7" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M51.96,-76.33C66.24,-64.49 91.63,-44.15 115,-29 117.31,-27.5 119.76,-26.01 122.23,-24.55"/>
<polygon fill="midnightblue" stroke="midnightblue" points="124.16,-27.48 131.16,-19.53 120.73,-21.38 124.16,-27.48"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M241.16,-152.76C233.21,-161.57 238.66,-171 257.5,-171 269.27,-171 275.82,-167.31 277.13,-162.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="280.38,-161.09 273.84,-152.76 273.76,-163.35 280.38,-161.09"/>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge4" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M187.09,-130.38C195.36,-131.88 204.27,-133.5 212.86,-135.07"/>
<polygon fill="midnightblue" stroke="midnightblue" points="212.28,-138.52 222.74,-136.86 213.53,-131.63 212.28,-138.52"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.5 KiB

6
dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.map Normal file
View File

@@ -0,0 +1,6 @@
<map id="dsu::unionSet" name="dsu::unionSet">
<area shape="rect" id="node1" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="5,55,109,81"/>
<area shape="rect" id="node2" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="301,29,393,56"/>
<area shape="rect" id="node3" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="157,55,253,81"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="166,105,245,132"/>
</map>

1
dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
1b0376de3bec490e5775b64645a04801

79
dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.svg Normal file
View File

@@ -0,0 +1,79 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: dsu::unionSet Pages: 1 -->
<svg width="299pt" height="103pt"
viewBox="0.00 0.00 299.00 103.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99)">
<title>dsu::unionSet</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-99 295,-99 295,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="#bfbfbf" stroke="black" points="0,-38.5 0,-57.5 78,-57.5 78,-38.5 0,-38.5"/>
<text text-anchor="middle" x="39" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="222,-57.5 222,-76.5 291,-76.5 291,-57.5 222,-57.5"/>
<text text-anchor="middle" x="256.5" y="-64.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M69.91,-57.5C83.26,-61.27 99.26,-65.14 114,-67 146.53,-71.11 183.59,-70.93 211.63,-69.82"/>
<polygon fill="midnightblue" stroke="midnightblue" points="212.07,-73.31 221.9,-69.36 211.75,-66.32 212.07,-73.31"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="black" points="114,-38.5 114,-57.5 186,-57.5 186,-38.5 114,-38.5"/>
<text text-anchor="middle" x="150" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M78.12,-48C86.33,-48 95.08,-48 103.53,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="103.64,-51.5 113.64,-48 103.64,-44.5 103.64,-51.5"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="120.5,-0.5 120.5,-19.5 179.5,-19.5 179.5,-0.5 120.5,-0.5"/>
<text text-anchor="middle" x="150" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M67.51,-38.41C80.93,-33.73 97.28,-28.03 111.8,-22.97"/>
<polygon fill="midnightblue" stroke="midnightblue" points="113.21,-26.18 121.5,-19.59 110.91,-19.57 113.21,-26.18"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M240.16,-76.76C232.21,-85.57 237.66,-95 256.5,-95 268.27,-95 274.82,-91.31 276.13,-86.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="279.38,-85.09 272.84,-76.76 272.76,-87.35 279.38,-85.09"/>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge4" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M186.09,-54.38C194.36,-55.88 203.27,-57.5 211.86,-59.07"/>
<polygon fill="midnightblue" stroke="midnightblue" points="211.28,-62.52 221.74,-60.86 212.53,-55.63 211.28,-62.52"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.0 KiB

4
dd/d1f/classdsu_ab8ee27083a3c2e2df80755165a2ec280_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="dsu::getParents" name="dsu::getParents">
<area shape="rect" id="node1" title="Method to print all the parents of i, or the path from i to representative." alt="" coords="5,5,121,32"/>
<area shape="rect" id="node2" href="$d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" title=" " alt="" coords="169,5,213,32"/>
</map>

1
dd/d1f/classdsu_ab8ee27083a3c2e2df80755165a2ec280_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
63bfa50bd8a4707f867af6c434c208b1

37
dd/d1f/classdsu_ab8ee27083a3c2e2df80755165a2ec280_cgraph.svg Normal file
View File

@@ -0,0 +1,37 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: dsu::getParents Pages: 1 -->
<svg width="164pt" height="28pt"
viewBox="0.00 0.00 164.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>dsu::getParents</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 160,-24 160,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Method to print all the parents of i, or the path from i to representative.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 87,-19.5 87,-0.5 0,-0.5"/>
<text text-anchor="middle" x="43.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::getParents</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="123,-0.5 123,-19.5 156,-19.5 156,-0.5 123,-0.5"/>
<text text-anchor="middle" x="139.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M87.1,-10C95.78,-10 104.67,-10 112.56,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="112.58,-13.5 122.58,-10 112.58,-6.5 112.58,-13.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.7 KiB

4
dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="dsu::get_min" name="dsu::get_min">
<area shape="rect" id="node1" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="5,29,104,56"/>
<area shape="rect" id="node2" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="152,29,244,56"/>
</map>

1
dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
47fee60ab5e8f8593f22e6db15fae70d

43
dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.svg Normal file
View File

@@ -0,0 +1,43 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: dsu::get_min Pages: 1 -->
<svg width="187pt" height="46pt"
viewBox="0.00 0.00 187.00 46.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42)">
<title>dsu::get_min</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 183,-42 183,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 74,-19.5 74,-0.5 0,-0.5"/>
<text text-anchor="middle" x="37" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="110,-0.5 110,-19.5 179,-19.5 179,-0.5 110,-0.5"/>
<text text-anchor="middle" x="144.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M74.01,-10C82.24,-10 91.08,-10 99.61,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="99.78,-13.5 109.78,-10 99.78,-6.5 99.78,-13.5"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M128.16,-19.76C120.21,-28.57 125.66,-38 144.5,-38 156.27,-38 162.82,-34.31 164.13,-29.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="167.38,-28.09 160.84,-19.76 160.76,-30.35 167.38,-28.09"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.1 KiB

302
df/d28/dsu__union__rank_8cpp.html Normal file
View File

@@ -0,0 +1,302 @@
<!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">
<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.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/dsu_union_rank.cpp File Reference</title>
<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>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.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/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('df/d28/dsu__union__rank_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">dsu_union_rank.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for dsu_union_rank.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dda/dsu__union__rank_8cpp__incl.svg" width="258" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Disjoint sets union data structure, class based representation. <a href="../../dd/d1f/classdsu.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ae7880ce913f3058a35ff106d5be9e243"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a> ()</td></tr>
<tr class="memdesc:ae7880ce913f3058a35ff106d5be9e243"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-implementations, 1st test. <a href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">More...</a><br /></td></tr>
<tr class="separator:ae7880ce913f3058a35ff106d5be9e243"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a45d94ead4cf4e1ff9f87c38bc99f59ae"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a> ()</td></tr>
<tr class="memdesc:a45d94ead4cf4e1ff9f87c38bc99f59ae"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-implementations, 2nd test. <a href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">More...</a><br /></td></tr>
<tr class="separator:a45d94ead4cf4e1ff9f87c38bc99f59ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p ><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> </p>
<p >dsu : It is a very powerful data structure which keeps track of different clusters(sets) of elements, these sets are disjoint(doesnot have a common element). Disjoint sets uses cases : for finding connected components in a graph, used in Kruskal's algorithm for finding <a class="el" href="../../d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning tree. Operations that can be performed: 1) UnionSet(i,j): add(element i and j to the set) 2) findSet(i): returns the representative of the set to which i belogngs to. 3) getParents(i): prints the parent of i and so on and so forth. Below is the class-based approach which uses the heuristic of union-ranks. Using union-rank in findSet(i),we are able to get to the representative of i in slightly delayed O(logN) time but it allows us to keep tracks of the parent of i. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AayushVyasKIIT" target="_blank">AayushVyasKIIT</a> </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d3/dae/dsu__path__compression_8cpp.html" title="DSU (Disjoint sets)">dsu_path_compression.cpp</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</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&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> {</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <a class="code hl_function" href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(); <span class="comment">// run 1st test case</span></div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <a class="code hl_function" href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(); <span class="comment">// run 2nd test case</span></div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> </div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span>}</div>
<div class="ttc" id="adsu__union__rank_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition:</b> dsu_union_rank.cpp:157</div></div>
<div class="ttc" id="adsu__union__rank_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-implementations, 1st test.</div><div class="ttdef"><b>Definition:</b> dsu_union_rank.cpp:133</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="608" height="208"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ae7880ce913f3058a35ff106d5be9e243" name="ae7880ce913f3058a35ff106d5be9e243"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae7880ce913f3058a35ff106d5be9e243">&#9670;&nbsp;</a></span>test1()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test1 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-implementations, 1st test. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >&lt; number of elements</p>
<p >&lt; object of class disjoint sets</p>
<p >&lt; performs union operation on 1 and 2</p>
<div class="fragment"><div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> {</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">/* checks the parents in the resultant structures */</span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> uint64_t n = 10; <span class="comment">///&lt; number of elements</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); <span class="comment">///&lt; object of class disjoint sets</span></div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> d.unionSet(2, 1); <span class="comment">///&lt; performs union operation on 1 and 2</span></div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> d.unionSet(1, 4);</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> d.unionSet(8, 1);</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> d.unionSet(3, 5);</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> d.unionSet(5, 6);</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> d.unionSet(5, 7);</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> d.unionSet(9, 10);</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> d.unionSet(2, 10);</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// keeping track of the changes using parent pointers</span></div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a> = {7, 5};</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>.size(); i++) {</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> assert(d.getParents(7).at(i) ==</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>[i]); <span class="comment">// makes sure algorithm works fine</span></div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> }</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:33</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:36</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg" width="510" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a45d94ead4cf4e1ff9f87c38bc99f59ae" name="a45d94ead4cf4e1ff9f87c38bc99f59ae"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">&#9670;&nbsp;</a></span>test2()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test2 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-implementations, 2nd test. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >&lt; number of elements</p>
<p >&lt; object of class disjoint sets</p>
<p >performs union operation on 1 and 2</p>
<p >keeping track of the changes using parent pointers</p>
<p >makes sure algorithm works fine</p>
<div class="fragment"><div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> {</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// checks the parents in the resultant structures</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> uint64_t n = 10; <span class="comment">///&lt; number of elements</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); <span class="comment">///&lt; object of class disjoint sets</span></div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> d.unionSet(2, 1); <span class="comment">/// performs union operation on 1 and 2</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> d.unionSet(1, 4);</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> d.unionSet(8, 1);</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> d.unionSet(3, 5);</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> d.unionSet(5, 6);</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> d.unionSet(5, 7);</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> d.unionSet(9, 10);</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> d.unionSet(2, 10);</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span><span class="comment"></span> </div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span><span class="comment"> /// keeping track of the changes using parent pointers</span></div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a> = {2, 1, 10};</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>.size(); i++) {</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> assert(d.getParents(2).at(i) ==</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>[i]); <span class="comment">/// makes sure algorithm works fine</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> }</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg" width="510" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../df/d28/dsu__union__rank_8cpp.html">dsu_union_rank.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.9.2 </li>
</ul>
</div>
</body>
</html>

7
df/d28/dsu__union__rank_8cpp.js Normal file
View File

@@ -0,0 +1,7 @@
var dsu__union__rank_8cpp =
[
[ "dsu", "dd/d1f/classdsu.html", "dd/d1f/classdsu" ],
[ "main", "df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test1", "df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243", null ],
[ "test2", "df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae", null ]
];

9
df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="test2" name="test2">
<area shape="rect" id="node1" title="Self&#45;implementations, 2nd test." alt="" coords="5,56,56,83"/>
<area shape="rect" id="node2" href="$d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" title=" " alt="" coords="294,5,338,32"/>
<area shape="rect" id="node3" href="$dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" title="Method to print all the parents of i, or the path from i to representative." alt="" coords="104,56,220,83"/>
<area shape="rect" id="node4" href="$dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="110,107,214,133"/>
<area shape="rect" id="node5" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="412,81,504,108"/>
<area shape="rect" id="node6" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="268,107,364,133"/>
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="277,157,355,184"/>
</map>

1
df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
413d5a9409029480fc4dd4ab917bdc62

130
df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg Normal file
View File

@@ -0,0 +1,130 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: test2 Pages: 1 -->
<svg width="382pt" height="142pt"
viewBox="0.00 0.00 382.00 142.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138)">
<title>test2</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 378,-138 378,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;implementations, 2nd test.">
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 38,-95.5 38,-76.5 0,-76.5"/>
<text text-anchor="middle" x="19" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="216.5,-114.5 216.5,-133.5 249.5,-133.5 249.5,-114.5 216.5,-114.5"/>
<text text-anchor="middle" x="233" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.2,-93.52C48.53,-97.51 61.8,-102.16 74,-105 119.73,-115.66 174.38,-120.54 205.95,-122.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="205.91,-126.12 216.1,-123.24 206.34,-119.13 205.91,-126.12"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" target="_top" xlink:title="Method to print all the parents of i, or the path from i to representative.">
<polygon fill="white" stroke="black" points="74,-76.5 74,-95.5 161,-95.5 161,-76.5 74,-76.5"/>
<text text-anchor="middle" x="117.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::getParents</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M38.15,-86C45.45,-86 54.28,-86 63.34,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.6,-89.5 73.6,-86 63.6,-82.5 63.6,-89.5"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="black" points="78.5,-38.5 78.5,-57.5 156.5,-57.5 156.5,-38.5 78.5,-38.5"/>
<text text-anchor="middle" x="117.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M38.15,-78.85C50.69,-73.91 67.75,-67.2 82.74,-61.29"/>
<polygon fill="midnightblue" stroke="midnightblue" points="84.21,-64.48 92.23,-57.56 81.65,-57.96 84.21,-64.48"/>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M147.14,-95.59C165.48,-101.73 189.05,-109.62 206.69,-115.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="205.72,-118.89 216.32,-118.75 207.94,-112.25 205.72,-118.89"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="305,-57.5 305,-76.5 374,-76.5 374,-57.5 305,-57.5"/>
<text text-anchor="middle" x="339.5" y="-64.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M150.27,-57.51C164.43,-61.27 181.41,-65.14 197,-67 229.55,-70.88 266.62,-70.72 294.65,-69.67"/>
<polygon fill="midnightblue" stroke="midnightblue" points="295.08,-73.15 304.92,-69.23 294.78,-66.16 295.08,-73.15"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="black" points="197,-38.5 197,-57.5 269,-57.5 269,-38.5 197,-38.5"/>
<text text-anchor="middle" x="233" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge7" class="edge">
<title>Node4&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M156.61,-48C166.26,-48 176.73,-48 186.7,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="186.86,-51.5 196.86,-48 186.86,-44.5 186.86,-51.5"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="203.5,-0.5 203.5,-19.5 262.5,-19.5 262.5,-0.5 203.5,-0.5"/>
<text text-anchor="middle" x="233" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge9" class="edge">
<title>Node4&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M147.14,-38.41C161.25,-33.69 178.47,-27.92 193.7,-22.82"/>
<polygon fill="midnightblue" stroke="midnightblue" points="195,-26.08 203.37,-19.59 192.77,-19.44 195,-26.08"/>
</g>
<!-- Node5&#45;&gt;Node5 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M323.16,-76.76C315.21,-85.57 320.66,-95 339.5,-95 351.27,-95 357.82,-91.31 359.13,-86.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="362.38,-85.09 355.84,-76.76 355.76,-87.35 362.38,-85.09"/>
</g>
<!-- Node6&#45;&gt;Node5 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M269.09,-54.38C277.36,-55.88 286.27,-57.5 294.86,-59.07"/>
<polygon fill="midnightblue" stroke="midnightblue" points="294.28,-62.52 304.74,-60.86 295.53,-55.63 294.28,-62.52"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 6.6 KiB

11
df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,11 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,49,56,75"/>
<area shape="rect" id="node2" href="$df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="Self&#45;implementations, 1st test." alt="" coords="104,74,155,101"/>
<area shape="rect" id="node9" href="$df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="104,23,155,50"/>
<area shape="rect" id="node3" href="$d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" title=" " alt="" coords="393,23,437,50"/>
<area shape="rect" id="node4" href="$dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" title="Method to print all the parents of i, or the path from i to representative." alt="" coords="203,23,319,50"/>
<area shape="rect" id="node5" href="$dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="209,125,313,151"/>
<area shape="rect" id="node6" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="511,99,603,126"/>
<area shape="rect" id="node7" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="367,125,463,151"/>
<area shape="rect" id="node8" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="375,175,454,202"/>
</map>

1
df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
0a7e08d906379ef71155e6daf0c91734

178
df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,178 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: main Pages: 1 -->
<svg width="456pt" height="156pt"
viewBox="0.00 0.00 456.00 155.52" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 151.52)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-151.52 452,-151.52 452,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#bfbfbf" stroke="black" points="0,-95.5 0,-114.5 38,-114.5 38,-95.5 0,-95.5"/>
<text text-anchor="middle" x="19" y="-102.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;implementations, 1st test.">
<polygon fill="white" stroke="black" points="74,-76.5 74,-95.5 112,-95.5 112,-76.5 74,-76.5"/>
<text text-anchor="middle" x="93" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.17,-100.21C45.95,-98.15 55.23,-95.7 63.87,-93.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="64.81,-96.79 73.59,-90.86 63.02,-90.03 64.81,-96.79"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a xlink:href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
<polygon fill="white" stroke="black" points="74,-114.5 74,-133.5 112,-133.5 112,-114.5 74,-114.5"/>
<text text-anchor="middle" x="93" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node9 -->
<g id="edge11" class="edge">
<title>Node1&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M38.17,-109.79C45.95,-111.85 55.23,-114.3 63.87,-116.58"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.02,-119.97 73.59,-119.14 64.81,-113.21 63.02,-119.97"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="290.5,-114.5 290.5,-133.5 323.5,-133.5 323.5,-114.5 290.5,-114.5"/>
<text text-anchor="middle" x="307" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M112.38,-87.72C139.41,-90.42 191.41,-96.27 235,-105 250.2,-108.05 266.97,-112.48 280.39,-116.3"/>
<polygon fill="midnightblue" stroke="midnightblue" points="279.76,-119.76 290.34,-119.19 281.72,-113.04 279.76,-119.76"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" target="_top" xlink:title="Method to print all the parents of i, or the path from i to representative.">
<polygon fill="white" stroke="black" points="148,-114.5 148,-133.5 235,-133.5 235,-114.5 148,-114.5"/>
<text text-anchor="middle" x="191.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::getParents</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M112.15,-93.15C124.69,-98.09 141.75,-104.8 156.74,-110.71"/>
<polygon fill="midnightblue" stroke="midnightblue" points="155.65,-114.04 166.23,-114.44 158.21,-107.52 155.65,-114.04"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="black" points="152.5,-38.5 152.5,-57.5 230.5,-57.5 230.5,-38.5 152.5,-38.5"/>
<text text-anchor="middle" x="191.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node2&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M112.15,-78.85C124.69,-73.91 141.75,-67.2 156.74,-61.29"/>
<polygon fill="midnightblue" stroke="midnightblue" points="158.21,-64.48 166.23,-57.56 155.65,-57.96 158.21,-64.48"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M235.09,-124C250.22,-124 266.79,-124 280.11,-124"/>
<polygon fill="midnightblue" stroke="midnightblue" points="280.42,-127.5 290.42,-124 280.42,-120.5 280.42,-127.5"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="379,-57.5 379,-76.5 448,-76.5 448,-57.5 379,-57.5"/>
<text text-anchor="middle" x="413.5" y="-64.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M224.27,-57.51C238.43,-61.27 255.41,-65.14 271,-67 303.55,-70.88 340.62,-70.72 368.65,-69.67"/>
<polygon fill="midnightblue" stroke="midnightblue" points="369.08,-73.15 378.92,-69.23 368.78,-66.16 369.08,-73.15"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="black" points="271,-38.5 271,-57.5 343,-57.5 343,-38.5 271,-38.5"/>
<text text-anchor="middle" x="307" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node7 -->
<g id="edge8" class="edge">
<title>Node5&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M230.61,-48C240.26,-48 250.73,-48 260.7,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="260.86,-51.5 270.86,-48 260.86,-44.5 260.86,-51.5"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="277.5,-0.5 277.5,-19.5 336.5,-19.5 336.5,-0.5 277.5,-0.5"/>
<text text-anchor="middle" x="307" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node8 -->
<g id="edge10" class="edge">
<title>Node5&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M221.14,-38.41C235.25,-33.69 252.47,-27.92 267.7,-22.82"/>
<polygon fill="midnightblue" stroke="midnightblue" points="269,-26.08 277.37,-19.59 266.77,-19.44 269,-26.08"/>
</g>
<!-- Node6&#45;&gt;Node6 -->
<g id="edge7" class="edge">
<title>Node6&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M397.16,-76.76C389.21,-85.57 394.66,-95 413.5,-95 425.27,-95 431.82,-91.31 433.13,-86.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="436.38,-85.09 429.84,-76.76 429.76,-87.35 436.38,-85.09"/>
</g>
<!-- Node7&#45;&gt;Node6 -->
<g id="edge9" class="edge">
<title>Node7&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M343.09,-54.38C351.36,-55.88 360.27,-57.5 368.86,-59.07"/>
<polygon fill="midnightblue" stroke="midnightblue" points="368.28,-62.52 378.74,-60.86 369.53,-55.63 368.28,-62.52"/>
</g>
<!-- Node9&#45;&gt;Node3 -->
<g id="edge12" class="edge">
<title>Node9&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M112.08,-132.09C122.38,-136.26 135.66,-140.89 148,-143 186.11,-149.51 196.66,-148.04 235,-143 250.37,-140.98 267.15,-136.6 280.53,-132.55"/>
<polygon fill="midnightblue" stroke="midnightblue" points="281.96,-135.77 290.45,-129.43 279.86,-129.09 281.96,-135.77"/>
</g>
<!-- Node9&#45;&gt;Node4 -->
<g id="edge13" class="edge">
<title>Node9&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M112.15,-124C119.45,-124 128.28,-124 137.34,-124"/>
<polygon fill="midnightblue" stroke="midnightblue" points="137.6,-127.5 147.6,-124 137.6,-120.5 137.6,-127.5"/>
</g>
<!-- Node9&#45;&gt;Node5 -->
<g id="edge14" class="edge">
<title>Node9&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M106.22,-114.37C122.39,-101.64 151.1,-79.03 170.47,-63.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="172.69,-66.48 178.38,-57.55 168.36,-60.98 172.69,-66.48"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 9.1 KiB

9
df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="test1" name="test1">
<area shape="rect" id="node1" title="Self&#45;implementations, 1st test." alt="" coords="5,56,56,83"/>
<area shape="rect" id="node2" href="$d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" title=" " alt="" coords="294,5,338,32"/>
<area shape="rect" id="node3" href="$dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" title="Method to print all the parents of i, or the path from i to representative." alt="" coords="104,56,220,83"/>
<area shape="rect" id="node4" href="$dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="110,107,214,133"/>
<area shape="rect" id="node5" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="412,81,504,108"/>
<area shape="rect" id="node6" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="268,107,364,133"/>
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="277,157,355,184"/>
</map>

1
df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
05fd810df88836bd72af8e5abb419c5c

130
df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg Normal file
View File

@@ -0,0 +1,130 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: test1 Pages: 1 -->
<svg width="382pt" height="142pt"
viewBox="0.00 0.00 382.00 142.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138)">
<title>test1</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 378,-138 378,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;implementations, 1st test.">
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 38,-95.5 38,-76.5 0,-76.5"/>
<text text-anchor="middle" x="19" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="216.5,-114.5 216.5,-133.5 249.5,-133.5 249.5,-114.5 216.5,-114.5"/>
<text text-anchor="middle" x="233" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.2,-93.52C48.53,-97.51 61.8,-102.16 74,-105 119.73,-115.66 174.38,-120.54 205.95,-122.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="205.91,-126.12 216.1,-123.24 206.34,-119.13 205.91,-126.12"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" target="_top" xlink:title="Method to print all the parents of i, or the path from i to representative.">
<polygon fill="white" stroke="black" points="74,-76.5 74,-95.5 161,-95.5 161,-76.5 74,-76.5"/>
<text text-anchor="middle" x="117.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::getParents</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M38.15,-86C45.45,-86 54.28,-86 63.34,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.6,-89.5 73.6,-86 63.6,-82.5 63.6,-89.5"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="black" points="78.5,-38.5 78.5,-57.5 156.5,-57.5 156.5,-38.5 78.5,-38.5"/>
<text text-anchor="middle" x="117.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M38.15,-78.85C50.69,-73.91 67.75,-67.2 82.74,-61.29"/>
<polygon fill="midnightblue" stroke="midnightblue" points="84.21,-64.48 92.23,-57.56 81.65,-57.96 84.21,-64.48"/>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M147.14,-95.59C165.48,-101.73 189.05,-109.62 206.69,-115.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="205.72,-118.89 216.32,-118.75 207.94,-112.25 205.72,-118.89"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="black" points="305,-57.5 305,-76.5 374,-76.5 374,-57.5 305,-57.5"/>
<text text-anchor="middle" x="339.5" y="-64.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M150.27,-57.51C164.43,-61.27 181.41,-65.14 197,-67 229.55,-70.88 266.62,-70.72 294.65,-69.67"/>
<polygon fill="midnightblue" stroke="midnightblue" points="295.08,-73.15 304.92,-69.23 294.78,-66.16 295.08,-73.15"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="black" points="197,-38.5 197,-57.5 269,-57.5 269,-38.5 197,-38.5"/>
<text text-anchor="middle" x="233" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge7" class="edge">
<title>Node4&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M156.61,-48C166.26,-48 176.73,-48 186.7,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="186.86,-51.5 196.86,-48 186.86,-44.5 186.86,-51.5"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="203.5,-0.5 203.5,-19.5 262.5,-19.5 262.5,-0.5 203.5,-0.5"/>
<text text-anchor="middle" x="233" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge9" class="edge">
<title>Node4&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M147.14,-38.41C161.25,-33.69 178.47,-27.92 193.7,-22.82"/>
<polygon fill="midnightblue" stroke="midnightblue" points="195,-26.08 203.37,-19.59 192.77,-19.44 195,-26.08"/>
</g>
<!-- Node5&#45;&gt;Node5 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M323.16,-76.76C315.21,-85.57 320.66,-95 339.5,-95 351.27,-95 357.82,-91.31 359.13,-86.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="362.38,-85.09 355.84,-76.76 355.76,-87.35 362.38,-85.09"/>
</g>
<!-- Node6&#45;&gt;Node5 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M269.09,-54.38C277.36,-55.88 286.27,-57.5 294.86,-59.07"/>
<polygon fill="midnightblue" stroke="midnightblue" points="294.28,-62.52 304.74,-60.86 295.53,-55.63 294.28,-62.52"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 6.6 KiB

6
dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
View File

@@ -114,6 +114,12 @@ Files</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d23/disjoint__set_8cpp.html">disjoint_set.cpp</a></td></tr>
<tr class="memdesc:de/d23/disjoint__set_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Disjoint Sets Data Structure (Disjoint Sets)</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dae/dsu__path__compression_8cpp.html">dsu_path_compression.cpp</a></td></tr>
<tr class="memdesc:d3/dae/dsu__path__compression_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d28/dsu__union__rank_8cpp.html">dsu_union_rank.cpp</a></td></tr>
<tr class="memdesc:df/d28/dsu__union__rank_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/dc3/linked__list_8cpp.html">linked_list.cpp</a></td></tr>
<tr class="memdesc:da/dc3/linked__list_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of singly linked list algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

2
dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js
View File

@@ -6,6 +6,8 @@ var dir_2e746e9d06bf2d8ff842208bcc6ebcfc =
[ "binary_search_tree2.cpp", "df/d42/binary__search__tree2_8cpp.html", "df/d42/binary__search__tree2_8cpp" ],
[ "binaryheap.cpp", "de/dc3/binaryheap_8cpp.html", "de/dc3/binaryheap_8cpp" ],
[ "disjoint_set.cpp", "de/d23/disjoint__set_8cpp.html", "de/d23/disjoint__set_8cpp" ],
[ "dsu_path_compression.cpp", "d3/dae/dsu__path__compression_8cpp.html", "d3/dae/dsu__path__compression_8cpp" ],
[ "dsu_union_rank.cpp", "df/d28/dsu__union__rank_8cpp.html", "df/d28/dsu__union__rank_8cpp" ],
[ "linked_list.cpp", "da/dc3/linked__list_8cpp.html", "da/dc3/linked__list_8cpp" ],
[ "linkedlist_implentation_usingarray.cpp", "d3/dce/linkedlist__implentation__usingarray_8cpp.html", "d3/dce/linkedlist__implentation__usingarray_8cpp" ],
[ "list_array.cpp", "d7/d00/list__array_8cpp.html", "d7/d00/list__array_8cpp" ],

30
files.html
View File

@@ -133,20 +133,22 @@ solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
<tr id="row_4_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d42/binary__search__tree2_8cpp.html" target="_self">binary_search_tree2.cpp</a></td><td class="desc">A generic <a href="https://en.wikipedia.org/wiki/Binary_search_tree" target="_blank">binary search tree</a> implementation </td></tr>
<tr id="row_4_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dc3/binaryheap_8cpp.html" target="_self">binaryheap.cpp</a></td><td class="desc">A C++ program to demonstrate common Binary Heap Operations </td></tr>
<tr id="row_4_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d23/disjoint__set_8cpp.html" target="_self">disjoint_set.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Disjoint Sets Data Structure (Disjoint Sets)</a> </td></tr>
<tr id="row_4_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/dc3/linked__list_8cpp.html" target="_self">linked_list.cpp</a></td><td class="desc">Implementation of singly linked list algorithm </td></tr>
<tr id="row_4_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html" target="_self">linkedlist_implentation_usingarray.cpp</a></td><td class="desc">Linked list implementation using Arrays </td></tr>
<tr id="row_4_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d00/list__array_8cpp.html" target="_self">list_array.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> </td></tr>
<tr id="row_4_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d38/queue_8h_source.html"><span class="icondoc"></span></a><b>queue.h</b></td><td class="desc"></td></tr>
<tr id="row_4_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/df0/queue__using__array_8cpp.html" target="_self">queue_using_array.cpp</a></td><td class="desc">Implementation of Linear <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/" target="_blank">Queue using array</a> </td></tr>
<tr id="row_4_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html" target="_self">queue_using_two_stacks.cpp</a></td><td class="desc"></td></tr>
<tr id="row_4_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d05/reverse__a__linked__list_8cpp.html" target="_self">reverse_a_linked_list.cpp</a></td><td class="desc">Implementation of <a href="https://simple.wikipedia.org/wiki/Linked_list" target="_blank">Reversing a single linked list</a> </td></tr>
<tr id="row_4_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d5a/skip__list_8cpp.html" target="_self">skip_list.cpp</a></td><td class="desc">Data structure for fast searching and insertion in \(O(\log n)\) time </td></tr>
<tr id="row_4_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d42/data__structures_2sparse__table_8cpp.html" target="_self">sparse_table.cpp</a></td><td class="desc">Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> for <code><a class="el" href="da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347" title="Takes input of the cost of three operations: Insert, Replace and Delete and return the minimum cost a...">min()</a></code> function </td></tr>
<tr id="row_4_15_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/de0/stack_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d7/de0/stack_8h.html" target="_self">stack.h</a></td><td class="desc">This class specifies the basic operation on a stack as a linked list </td></tr>
<tr id="row_4_16_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dbc/tree__234_8cpp.html" target="_self">tree_234.cpp</a></td><td class="desc">A demo 2-3-4 tree implementation </td></tr>
<tr id="row_4_17_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d93/trie__modern_8cpp.html" target="_self">trie_modern.cpp</a></td><td class="desc">A basic implementation of trie class to store only lower-case strings </td></tr>
<tr id="row_4_18_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d83/trie__tree_8cpp.html" target="_self">trie_tree.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure for English alphabets in small characters </td></tr>
<tr id="row_4_19_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d8a/trie__using__hashmap_8cpp.html" target="_self">trie_using_hashmap.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using HashMap for different characters and method for predicting words based on prefix </td></tr>
<tr id="row_4_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/dae/dsu__path__compression_8cpp.html" target="_self">dsu_path_compression.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> </td></tr>
<tr id="row_4_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d28/dsu__union__rank_8cpp.html" target="_self">dsu_union_rank.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> </td></tr>
<tr id="row_4_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/dc3/linked__list_8cpp.html" target="_self">linked_list.cpp</a></td><td class="desc">Implementation of singly linked list algorithm </td></tr>
<tr id="row_4_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html" target="_self">linkedlist_implentation_usingarray.cpp</a></td><td class="desc">Linked list implementation using Arrays </td></tr>
<tr id="row_4_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d00/list__array_8cpp.html" target="_self">list_array.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> </td></tr>
<tr id="row_4_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d38/queue_8h_source.html"><span class="icondoc"></span></a><b>queue.h</b></td><td class="desc"></td></tr>
<tr id="row_4_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/df0/queue__using__array_8cpp.html" target="_self">queue_using_array.cpp</a></td><td class="desc">Implementation of Linear <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/" target="_blank">Queue using array</a> </td></tr>
<tr id="row_4_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html" target="_self">queue_using_two_stacks.cpp</a></td><td class="desc"></td></tr>
<tr id="row_4_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d05/reverse__a__linked__list_8cpp.html" target="_self">reverse_a_linked_list.cpp</a></td><td class="desc">Implementation of <a href="https://simple.wikipedia.org/wiki/Linked_list" target="_blank">Reversing a single linked list</a> </td></tr>
<tr id="row_4_15_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d5a/skip__list_8cpp.html" target="_self">skip_list.cpp</a></td><td class="desc">Data structure for fast searching and insertion in \(O(\log n)\) time </td></tr>
<tr id="row_4_16_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d42/data__structures_2sparse__table_8cpp.html" target="_self">sparse_table.cpp</a></td><td class="desc">Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> for <code><a class="el" href="da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347" title="Takes input of the cost of three operations: Insert, Replace and Delete and return the minimum cost a...">min()</a></code> function </td></tr>
<tr id="row_4_17_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/de0/stack_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d7/de0/stack_8h.html" target="_self">stack.h</a></td><td class="desc">This class specifies the basic operation on a stack as a linked list </td></tr>
<tr id="row_4_18_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dbc/tree__234_8cpp.html" target="_self">tree_234.cpp</a></td><td class="desc">A demo 2-3-4 tree implementation </td></tr>
<tr id="row_4_19_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d93/trie__modern_8cpp.html" target="_self">trie_modern.cpp</a></td><td class="desc">A basic implementation of trie class to store only lower-case strings </td></tr>
<tr id="row_4_20_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d83/trie__tree_8cpp.html" target="_self">trie_tree.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure for English alphabets in small characters </td></tr>
<tr id="row_4_21_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d8a/trie__using__hashmap_8cpp.html" target="_self">trie_using_hashmap.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using HashMap for different characters and method for predicting words based on prefix </td></tr>
<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">&#9658;</span><span id="img_5_" class="iconfclosed" onclick="toggleFolder('5_')">&#160;</span><a class="el" href="dir_93bc990c5cceb745f78af6949e9ef947.html" target="_self">divide_and_conquer</a></td><td class="desc"></td></tr>
<tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html" target="_self">karatsuba_algorithm_for_fast_multiplication.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Karatsuba_algorithm" target="_blank">Karatsuba algorithm for fast multiplication</a> </td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">&#9658;</span><span id="img_6_" class="iconfclosed" onclick="toggleFolder('6_')">&#160;</span><a class="el" href="dir_8a20dd5bfd5341a725342bf72b6b686f.html" target="_self">dynamic_programming</a></td><td class="desc"></td></tr>

3
functions_d.html
View File

@@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('functions_d.html',''); initResizable()
<li>DeleteNode()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855">data_structures::tree_234::Tree234</a></li>
<li>deleteString()&#160;:&#160;<a class="el" href="d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie</a></li>
<li>DenseLayer()&#160;:&#160;<a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e">machine_learning::neural_network::layers::DenseLayer</a></li>
<li>depth&#160;:&#160;<a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>
<li>depth&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">dsu</a>, <a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>
<li>dequeue()&#160;:&#160;<a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array</a></li>
<li>deQueue()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#a089d4af5532e0a801f560070da6e1f86">queue&lt; Kind &gt;</a></li>
<li>dfs()&#160;:&#160;<a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">graph::HKGraph</a></li>
@@ -121,6 +121,7 @@ $(document).ready(function(){initNavTree('functions_d.html',''); initResizable()
<li>dist&#160;:&#160;<a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">graph::HKGraph</a></li>
<li>divide()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">uint256_t</a></li>
<li>draw_sample()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3">probability::geometric_dist::geometric_distribution</a></li>
<li>dsu()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

1
functions_f.html
View File

@@ -98,6 +98,7 @@ $(document).ready(function(){initNavTree('functions_f.html',''); initResizable()
<li>find_max()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">binary_search_tree&lt; T &gt;</a></li>
<li>find_min()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree&lt; T &gt;</a></li>
<li>find_zero()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>findSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">dsu</a></li>
<li>first&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">data_structures::linked_list::list</a></li>
<li>fit()&#160;:&#160;<a class="el" href="d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">machine_learning::adaline</a>, <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0">machine_learning::neural_network::NeuralNetwork</a></li>
<li>fit_from_csv()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">machine_learning::neural_network::NeuralNetwork</a></li>

1
functions_func_d.html
View File

@@ -117,6 +117,7 @@ $(document).ready(function(){initNavTree('functions_func_d.html',''); initResiza
<li>displayList()&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList</a></li>
<li>divide()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">uint256_t</a></li>
<li>draw_sample()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3">probability::geometric_dist::geometric_distribution</a></li>
<li>dsu()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

1
functions_func_f.html
View File

@@ -98,6 +98,7 @@ $(document).ready(function(){initNavTree('functions_func_f.html',''); initResiza
<li>find_max()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">binary_search_tree&lt; T &gt;</a></li>
<li>find_min()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree&lt; T &gt;</a></li>
<li>find_zero()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>findSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">dsu</a></li>
<li>fit()&#160;:&#160;<a class="el" href="d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">machine_learning::adaline</a>, <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0">machine_learning::neural_network::NeuralNetwork</a></li>
<li>fit_from_csv()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">machine_learning::neural_network::NeuralNetwork</a></li>
<li>front()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#a36d47fdbedc199609818385110d9f922">queue&lt; Kind &gt;</a></li>

5
functions_func_g.html
View File

@@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('functions_func_g.html',''); initResiza
<li>generate_keys()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher</a></li>
<li>generate_possible_moves()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>geometric_distribution()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797">probability::geometric_dist::geometric_distribution</a></li>
<li>get()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>get()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">dsu</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>get_all_words()&#160;:&#160;<a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">data_structures::trie_using_hashmap::Trie</a></li>
<li>get_char_idx()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41">ciphers::HillCipher</a></li>
<li>get_elements_inorder()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">binary_search_tree&lt; T &gt;</a></li>
@@ -109,6 +109,8 @@ $(document).ready(function(){initNavTree('functions_func_g.html',''); initResiza
<li>get_idx_char()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c">ciphers::HillCipher</a></li>
<li>get_inverse()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7">ciphers::HillCipher</a></li>
<li>get_level_order()&#160;:&#160;<a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
<li>get_max()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">dsu</a></li>
<li>get_min()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">dsu</a></li>
<li>get_size()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>get_state()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>get_XY_from_csv()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d">machine_learning::neural_network::NeuralNetwork</a></li>
@@ -130,6 +132,7 @@ $(document).ready(function(){initNavTree('functions_func_g.html',''); initResiza
<li>GetMinItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71">data_structures::tree_234::Node</a></li>
<li>GetNextPossibleChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46">data_structures::tree_234::Node</a></li>
<li>getPageFault()&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2">others::lru_cache::LRUCache</a></li>
<li>getParents()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280">dsu</a></li>
<li>GetRightmostChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94">data_structures::tree_234::Node</a></li>
<li>GetTreeMaxItem()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657">data_structures::tree_234::Tree234</a></li>
<li>GetTreeMinItem()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36">data_structures::tree_234::Tree234</a></li>

1
functions_func_i.html
View File

@@ -122,6 +122,7 @@ $(document).ready(function(){initNavTree('functions_func_i.html',''); initResiza
<li>isEmptyStack()&#160;:&#160;<a class="el" href="d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a">stack&lt; Type &gt;</a></li>
<li>IsFull()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd">data_structures::tree_234::Node</a></li>
<li>IsLeaf()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8">data_structures::tree_234::Node</a></li>
<li>isSame()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">dsu</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

2
functions_func_s.html
View File

@@ -109,7 +109,7 @@ $(document).ready(function(){initNavTree('functions_func_s.html',''); initResiza
<li>SG()&#160;:&#160;<a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></li>
<li>show()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594">data_structures::list_array::list</a></li>
<li>single_predict()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork</a></li>
<li>size()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a></li>
<li>size()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a></li>
<li>SkipList()&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">data_structures::SkipList</a></li>
<li>Solution()&#160;:&#160;<a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;</a></li>
<li>sort()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469">data_structures::list_array::list</a></li>

2
functions_func_u.html
View File

@@ -95,6 +95,8 @@ $(document).ready(function(){initNavTree('functions_func_u.html',''); initResiza
<h3><a id="index_u" name="index_u"></a>- u -</h3><ul>
<li>uint128_t()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t</a></li>
<li>uint256_t()&#160;:&#160;<a class="el" href="d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t</a></li>
<li>UnionSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
<li>unionSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu</a></li>
<li>update()&#160;:&#160;<a class="el" href="dd/d91/class_fenwick_tree.html#a2e9ea4fcbe0786487f4535c1cfc7aa00">FenwickTree</a>, <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a>, <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree</a></li>
<li>upper()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">uint256_t</a></li>
</ul>

5
functions_g.html
View File

@@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('functions_g.html',''); initResizable()
<li>generate_keys()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher</a></li>
<li>generate_possible_moves()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>geometric_distribution()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797">probability::geometric_dist::geometric_distribution</a></li>
<li>get()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>get()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">dsu</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>get_all_words()&#160;:&#160;<a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">data_structures::trie_using_hashmap::Trie</a></li>
<li>get_char_idx()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41">ciphers::HillCipher</a></li>
<li>get_elements_inorder()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">binary_search_tree&lt; T &gt;</a></li>
@@ -109,6 +109,8 @@ $(document).ready(function(){initNavTree('functions_g.html',''); initResizable()
<li>get_idx_char()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c">ciphers::HillCipher</a></li>
<li>get_inverse()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7">ciphers::HillCipher</a></li>
<li>get_level_order()&#160;:&#160;<a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
<li>get_max()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">dsu</a></li>
<li>get_min()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">dsu</a></li>
<li>get_size()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>get_state()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>get_XY_from_csv()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d">machine_learning::neural_network::NeuralNetwork</a></li>
@@ -130,6 +132,7 @@ $(document).ready(function(){initNavTree('functions_g.html',''); initResizable()
<li>GetMinItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71">data_structures::tree_234::Node</a></li>
<li>GetNextPossibleChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46">data_structures::tree_234::Node</a></li>
<li>getPageFault()&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2">others::lru_cache::LRUCache</a></li>
<li>getParents()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280">dsu</a></li>
<li>GetRightmostChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94">data_structures::tree_234::Node</a></li>
<li>GetTreeMaxItem()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657">data_structures::tree_234::Tree234</a></li>
<li>GetTreeMinItem()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36">data_structures::tree_234::Tree234</a></li>

1
functions_i.html
View File

@@ -123,6 +123,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
<li>isEndofWord&#160;:&#160;<a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">data_structures::trie</a></li>
<li>IsFull()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd">data_structures::tree_234::Node</a></li>
<li>IsLeaf()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8">data_structures::tree_234::Node</a></li>
<li>isSame()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">dsu</a></li>
<li>items&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">data_structures::tree_234::Node</a></li>
</ul>
</div><!-- contents -->

2
functions_m.html
View File

@@ -96,10 +96,12 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
<li>m&#160;:&#160;<a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph</a></li>
<li>main_q&#160;:&#160;<a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">data_structures::stack_using_queue::Stack</a></li>
<li>mat_mul()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590">ciphers::HillCipher</a></li>
<li>maxElement&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">dsu</a></li>
<li>mean()&#160;:&#160;<a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">statistics::stats_computer1&lt; T &gt;</a>, <a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">statistics::stats_computer2&lt; T &gt;</a></li>
<li>Merge()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">data_structures::tree_234::Tree234</a></li>
<li>MergeNode()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805">data_structures::tree_234::Tree234</a></li>
<li>MergeNodeNotFull()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">data_structures::tree_234::Tree234</a></li>
<li>minElement&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">dsu</a></li>
<li>MinHeap()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820">MinHeap</a></li>
<li>MinHeapify()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad">MinHeap</a></li>
<li>modInverse()&#160;:&#160;<a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a">math::ncr_modulo_p::NCRModuloP</a></li>

2
functions_p.html
View File

@@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('functions_p.html',''); initResizable()
<div class="textblock">Here is a list of all documented class members with links to the class documentation for each member:</div>
<h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
<li>p&#160;:&#160;<a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">math::ncr_modulo_p::NCRModuloP</a>, <a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">probability::geometric_dist::geometric_distribution</a></li>
<li>p&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">dsu</a>, <a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">math::ncr_modulo_p::NCRModuloP</a>, <a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">probability::geometric_dist::geometric_distribution</a></li>
<li>pageFault&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c">others::lru_cache::LRUCache</a></li>
<li>pageFrame&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893">others::lru_cache::LRUCache</a></li>
<li>pageMap&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c">others::lru_cache::LRUCache</a></li>

3
functions_s.html
View File

@@ -109,11 +109,12 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
<li>SetChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74">data_structures::tree_234::Node</a></li>
<li>SetCount()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1">data_structures::tree_234::Node</a></li>
<li>SetItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc">data_structures::tree_234::Node</a></li>
<li>setSize&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">dsu</a></li>
<li>SG()&#160;:&#160;<a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></li>
<li>show()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594">data_structures::list_array::list</a></li>
<li>side&#160;:&#160;<a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph</a></li>
<li>single_predict()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork</a></li>
<li>size()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a>, <a class="el" href="d1/dc2/classstack.html#ac512a3efdc84a5f5c9f53905c8e219b0">stack&lt; Type &gt;</a></li>
<li>size()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a>, <a class="el" href="d1/dc2/classstack.html#ac512a3efdc84a5f5c9f53905c8e219b0">stack&lt; Type &gt;</a></li>
<li>size_&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree&lt; T &gt;</a></li>
<li>SkipList()&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">data_structures::SkipList</a></li>
<li>Solution()&#160;:&#160;<a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;</a></li>

2
functions_u.html
View File

@@ -95,6 +95,8 @@ $(document).ready(function(){initNavTree('functions_u.html',''); initResizable()
<h3><a id="index_u" name="index_u"></a>- u -</h3><ul>
<li>uint128_t()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t</a></li>
<li>uint256_t()&#160;:&#160;<a class="el" href="d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t</a></li>
<li>UnionSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
<li>unionSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu</a></li>
<li>up&#160;:&#160;<a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">graph::LowestCommonAncestor</a></li>
<li>update()&#160;:&#160;<a class="el" href="dd/d91/class_fenwick_tree.html#a2e9ea4fcbe0786487f4535c1cfc7aa00">FenwickTree</a>, <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a>, <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree</a></li>
<li>upper()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">uint256_t</a></li>

7
functions_vars.html
View File

@@ -124,7 +124,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<h3><a id="index_d" name="index_d"></a>- d -</h3><ul>
<li>data&#160;:&#160;<a class="el" href="d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37">node&lt; Kind &gt;</a>, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node</a>, <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">operations_on_datastructures::reverse_binary_tree::Node</a>, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">others::iterative_tree_traversals::Node</a>, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">search::sublist_search::Node</a></li>
<li>day&#160;:&#160;<a class="el" href="d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51">EasterYearMonthDay</a></li>
<li>depth&#160;:&#160;<a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>
<li>depth&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">dsu</a>, <a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></li>
<li>dist&#160;:&#160;<a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">graph::HKGraph</a></li>
</ul>
@@ -177,6 +177,8 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<h3><a id="index_m" name="index_m"></a>- m -</h3><ul>
<li>m&#160;:&#160;<a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph</a></li>
<li>main_q&#160;:&#160;<a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">data_structures::stack_using_queue::Stack</a></li>
<li>maxElement&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">dsu</a></li>
<li>minElement&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">dsu</a></li>
<li>month&#160;:&#160;<a class="el" href="d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde">EasterYearMonthDay</a></li>
<li>moves&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
</ul>
@@ -191,7 +193,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
<li>p&#160;:&#160;<a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">math::ncr_modulo_p::NCRModuloP</a>, <a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">probability::geometric_dist::geometric_distribution</a></li>
<li>p&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">dsu</a>, <a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">math::ncr_modulo_p::NCRModuloP</a>, <a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">probability::geometric_dist::geometric_distribution</a></li>
<li>pageFault&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c">others::lru_cache::LRUCache</a></li>
<li>pageFrame&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893">others::lru_cache::LRUCache</a></li>
<li>pageMap&#160;:&#160;<a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c">others::lru_cache::LRUCache</a></li>
@@ -223,6 +225,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<li>s_size&#160;:&#160;<a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></li>
<li>s_tree&#160;:&#160;<a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></li>
<li>schedule&#160;:&#160;<a class="el" href="dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46">FCFS&lt; S, T, E &gt;</a></li>
<li>setSize&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">dsu</a></li>
<li>side&#160;:&#160;<a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph</a></li>
<li>size&#160;:&#160;<a class="el" href="d1/dc2/classstack.html#ac512a3efdc84a5f5c9f53905c8e219b0">stack&lt; Type &gt;</a></li>
<li>size_&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree&lt; T &gt;</a></li>

2
globals_func_m.html
View File

File diff suppressed because one or more lines are too long

4
globals_func_t.html
View File

File diff suppressed because one or more lines are too long

2
globals_m.html
View File

File diff suppressed because one or more lines are too long

4
globals_t.html
View File

File diff suppressed because one or more lines are too long

169
hierarchy.html
View File

@@ -105,98 +105,99 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">binary_search_tree&lt; T &gt;::bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_9_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare&lt; S, T, E &gt;</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare&lt; S, T, E &gt;</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_9_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::comparison_operator</a></td><td class="desc">Custom comparator for open_list </td></tr>
<tr id="row_11_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_self">geometry::jarvis::Convexhull</a></td><td class="desc"></td></tr>
<tr id="row_13_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">machine_learning::neural_network::layers::DenseLayer</a></td><td class="desc"></td></tr>
<tr id="row_15_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
<tr id="row_16_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_17_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_self">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/15_puzzle" target="_blank">EightPuzzle/15-Puzzle game</a> </td></tr>
<tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html" target="_self">double_hashing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d19/structlinear__probing_1_1_entry.html" target="_self">linear_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">quadratic_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/dca/class_f_c_f_s.html" target="_self">FCFS&lt; S, T, E &gt;</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
<tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">probability::geometric_dist::geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>
<tr id="row_25_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_26_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_26_" class="arrow" onclick="toggleFolder('26_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">graph::Graph&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_26_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">graph::RootedTree</a></td><td class="desc"></td></tr>
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_self">graph::is_graph_bipartite::Graph</a></td><td class="desc">Class for representing graph as an adjacency list </td></tr>
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html" target="_self">ciphers::HillCipher</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill Cipher</a> algorithm </td></tr>
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html" target="_self">graph::HKGraph</a></td><td class="desc">Represents Bipartite graph for Hopcroft Karp implementation </td></tr>
<tr id="row_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></td><td class="desc">Struct that handles all the information related to the current state </td></tr>
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html" target="_self">data_structures::linked_list::link</a></td><td class="desc"></td></tr>
<tr id="row_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html" target="_self">data_structures::linked_list::list</a></td><td class="desc"></td></tr>
<tr id="row_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html" target="_self">data_structures::list_array::list</a></td><td class="desc">Structure of List with supporting methods </td></tr>
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></td></tr>
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">others::lru_cache::LRUCache</a></td><td class="desc">LRU cache class </td></tr>
<tr id="row_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_42_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_44_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">math::ncr_modulo_p::NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
<tr id="row_45_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">machine_learning::neural_network::NeuralNetwork</a></td><td class="desc"></td></tr>
<tr id="row_46_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html" target="_self">data_structures::linked_list::Node</a></td><td class="desc"></td></tr>
<tr id="row_47_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</a></td><td class="desc"></td></tr>
<tr id="row_48_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">data_structures::tree_234::Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
<tr id="row_49_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" target="_self">data_structures::trie_using_hashmap::Trie::Node</a></td><td class="desc">Struct representing a trie node </td></tr>
<tr id="row_50_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_16_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1f/classdsu.html" target="_self">dsu</a></td><td class="desc">Disjoint sets union data structure, class based representation </td></tr>
<tr id="row_17_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_self">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/15_puzzle" target="_blank">EightPuzzle/15-Puzzle game</a> </td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html" target="_self">double_hashing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d19/structlinear__probing_1_1_entry.html" target="_self">linear_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">quadratic_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/dca/class_f_c_f_s.html" target="_self">FCFS&lt; S, T, E &gt;</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
<tr id="row_25_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">probability::geometric_dist::geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>
<tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_27_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_27_" class="arrow" onclick="toggleFolder('27_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">graph::Graph&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_27_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">graph::RootedTree</a></td><td class="desc"></td></tr>
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_self">graph::is_graph_bipartite::Graph</a></td><td class="desc">Class for representing graph as an adjacency list </td></tr>
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html" target="_self">ciphers::HillCipher</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill Cipher</a> algorithm </td></tr>
<tr id="row_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html" target="_self">graph::HKGraph</a></td><td class="desc">Represents Bipartite graph for Hopcroft Karp implementation </td></tr>
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></td><td class="desc">Struct that handles all the information related to the current state </td></tr>
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html" target="_self">data_structures::linked_list::link</a></td><td class="desc"></td></tr>
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html" target="_self">data_structures::linked_list::list</a></td><td class="desc"></td></tr>
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html" target="_self">data_structures::list_array::list</a></td><td class="desc">Structure of List with supporting methods </td></tr>
<tr id="row_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></td></tr>
<tr id="row_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">others::lru_cache::LRUCache</a></td><td class="desc">LRU cache class </td></tr>
<tr id="row_42_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_44_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_45_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">math::ncr_modulo_p::NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
<tr id="row_46_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">machine_learning::neural_network::NeuralNetwork</a></td><td class="desc"></td></tr>
<tr id="row_47_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html" target="_self">data_structures::linked_list::Node</a></td><td class="desc"></td></tr>
<tr id="row_48_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</a></td><td class="desc"></td></tr>
<tr id="row_49_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">data_structures::tree_234::Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
<tr id="row_50_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" target="_self">data_structures::trie_using_hashmap::Trie::Node</a></td><td class="desc">Struct representing a trie node </td></tr>
<tr id="row_51_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_52_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
<tr id="row_53_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">operations_on_datastructures::reverse_binary_tree::Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
<tr id="row_54_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">others::iterative_tree_traversals::Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_55_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">range_queries::perSegTree::Node</a></td><td class="desc"></td></tr>
<tr id="row_56_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">search::sublist_search::Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_57_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">range_queries::perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_58_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
<tr id="row_59_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_60_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_61_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_62_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_63_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_64_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_65_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_66_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_67_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_67_" class="arrow" onclick="toggleFolder('67_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">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 </td></tr>
<tr id="row_67_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_69_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_71_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure. <br />
<tr id="row_52_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_53_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
<tr id="row_54_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">operations_on_datastructures::reverse_binary_tree::Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
<tr id="row_55_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">others::iterative_tree_traversals::Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_56_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">range_queries::perSegTree::Node</a></td><td class="desc"></td></tr>
<tr id="row_57_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">search::sublist_search::Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_58_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">range_queries::perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_59_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
<tr id="row_60_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_61_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_62_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_63_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_64_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_65_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_66_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_67_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_68_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_68_" class="arrow" onclick="toggleFolder('68_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">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 </td></tr>
<tr id="row_68_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_69_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_71_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure. <br />
</td></tr>
<tr id="row_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_73_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack&lt; Type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_75_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_77_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_79_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_80_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_80_" class="arrow" onclick="toggleFolder('80_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td><td class="desc">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 </td></tr>
<tr id="row_80_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_81_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_82_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_83_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_84_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_85_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_86_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_86_" class="arrow" onclick="toggleFolder('86_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_86_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_86_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_86_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_86_3_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_86_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_86_5_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_87_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_88_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_89_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
<tr id="row_73_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack&lt; Type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_75_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_77_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_79_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_81_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_81_" class="arrow" onclick="toggleFolder('81_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td><td class="desc">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 </td></tr>
<tr id="row_81_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_82_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_83_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_84_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_85_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_86_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_87_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_87_" class="arrow" onclick="toggleFolder('87_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_87_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_87_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_87_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_87_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_87_4_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_87_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_88_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_89_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_90_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

5
hierarchy.js
View File

@@ -8,14 +8,15 @@ var hierarchy =
[ "binary_search_tree< T >::bst_node", "dd/db6/structbinary__search__tree_1_1bst__node.html", null ],
[ "Btree", "d9/d90/struct_btree.html", null ],
[ "cll", "d5/d15/classcll.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Compare< S, T, E >", "de/d4a/class_compare.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator", "d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html", null ],
[ "Complex", "da/d5a/class_complex.html", null ],
[ "geometry::jarvis::Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", null ],
[ "CycleCheck", "d3/dbb/class_cycle_check.html", null ],
[ "machine_learning::neural_network::layers::DenseLayer", "dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html", null ],
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],
[ "dsu", "dd/d1f/classdsu.html", null ],
[ "EasterYearMonthDay", "d1/df6/class_easter_year_month_day.html", null ],
[ "Edge", "d7/d77/class_edge.html", null ],
[ "machine_learning::aystar_search::EightPuzzle< N >", "dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html", null ],
@@ -52,8 +53,8 @@ var hierarchy =
[ "data_structures::Node", "d9/d49/structdata__structures_1_1_node.html", null ],
[ "data_structures::tree_234::Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", null ],
[ "data_structures::trie_using_hashmap::Trie::Node", "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html", null ],
[ "node< Kind >", "d5/da1/structnode.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
[ "node< Kind >", "d5/da1/structnode.html", null ],
[ "operations_on_datastructures::inorder_traversal_of_bst::Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", null ],
[ "operations_on_datastructures::reverse_binary_tree::Node", "d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html", null ],
[ "others::iterative_tree_traversals::Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", null ],

2
inherit_graph_26.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d1/df6/class_easter_year_month_day.html" title="for IO operations" alt="" coords="5,5,153,32"/>
<area shape="rect" id="node1" href="$dd/d1f/classdsu.html" title="Disjoint sets union data structure, class based representation." alt="" coords="5,5,49,32"/>
</map>

2
inherit_graph_26.md5
View File

@@ -1 +1 @@
4e8dab415e37a1596c92a7784e26264f
1b5bf6108506369aa2b9709b1ac08feb

12
inherit_graph_26.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="119pt" height="28pt"
viewBox="0.00 0.00 119.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="41pt" height="28pt"
viewBox="0.00 0.00 41.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 115,-24 115,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 37,-24 37,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d1/df6/class_easter_year_month_day.html" target="_top" xlink:title="for IO operations">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 111,-19.5 111,-0.5 0,-0.5"/>
<text text-anchor="middle" x="55.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">EasterYearMonthDay</text>
<g id="a_node1"><a xlink:href="dd/d1f/classdsu.html" target="_top" xlink:title="Disjoint sets union data structure, class based representation.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 33,-19.5 33,-0.5 0,-0.5"/>
<text text-anchor="middle" x="16.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">dsu</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_27.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d7/d77/class_edge.html" title=" " alt="" coords="5,5,59,32"/>
<area shape="rect" id="node1" href="$d1/df6/class_easter_year_month_day.html" title="for IO operations" alt="" coords="5,5,153,32"/>
</map>

2
inherit_graph_27.md5
View File

@@ -1 +1 @@
e148e1f3f544084b7aa1e7be1efaa9bb
4e8dab415e37a1596c92a7784e26264f

12
inherit_graph_27.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="48pt" height="28pt"
viewBox="0.00 0.00 48.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="119pt" height="28pt"
viewBox="0.00 0.00 119.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 44,-24 44,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 115,-24 115,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d7/d77/class_edge.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 40,-19.5 40,-0.5 0,-0.5"/>
<text text-anchor="middle" x="20" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Edge</text>
<g id="a_node1"><a xlink:href="d1/df6/class_easter_year_month_day.html" target="_top" xlink:title="for IO operations">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 111,-19.5 111,-0.5 0,-0.5"/>
<text text-anchor="middle" x="55.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">EasterYearMonthDay</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 988 B

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_28.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm." alt="" coords="5,5,124,32"/>
<area shape="rect" id="node1" href="$d7/d77/class_edge.html" title=" " alt="" coords="5,5,59,32"/>
</map>

2
inherit_graph_28.md5
View File

@@ -1 +1 @@
7ae10de1c3f65eab6645773f1d202807
e148e1f3f544084b7aa1e7be1efaa9bb

12
inherit_graph_28.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="97pt" height="28pt"
viewBox="0.00 0.00 97.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="48pt" height="28pt"
viewBox="0.00 0.00 48.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 93,-24 93,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 44,-24 44,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dd/dca/class_f_c_f_s.html" target="_top" xlink:title="Class which implements the FCFS scheduling algorithm.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 89,-19.5 89,-0.5 0,-0.5"/>
<text text-anchor="middle" x="44.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS&lt; S, T, E &gt;</text>
<g id="a_node1"><a xlink:href="d7/d77/class_edge.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 40,-19.5 40,-0.5 0,-0.5"/>
<text text-anchor="middle" x="20" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Edge</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 988 B

2
inherit_graph_29.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$dd/d91/class_fenwick_tree.html" title=" " alt="" coords="5,5,103,32"/>
<area shape="rect" id="node1" href="$dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm." alt="" coords="5,5,124,32"/>
</map>

2
inherit_graph_29.md5
View File

@@ -1 +1 @@
26396299a5a5a0cf88af656fc914cf13
7ae10de1c3f65eab6645773f1d202807

12
inherit_graph_29.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="81pt" height="28pt"
viewBox="0.00 0.00 81.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="97pt" height="28pt"
viewBox="0.00 0.00 97.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 77,-24 77,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 93,-24 93,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dd/d91/class_fenwick_tree.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 73,-19.5 73,-0.5 0,-0.5"/>
<text text-anchor="middle" x="36.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">FenwickTree</text>
<g id="a_node1"><a xlink:href="dd/dca/class_f_c_f_s.html" target="_top" xlink:title="Class which implements the FCFS scheduling algorithm.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 89,-19.5 89,-0.5 0,-0.5"/>
<text text-anchor="middle" x="44.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS&lt; S, T, E &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1005 B

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_30.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" title=" " alt="" coords="5,5,195,32"/>
<area shape="rect" id="node1" href="$dd/d91/class_fenwick_tree.html" title=" " alt="" coords="5,5,103,32"/>
</map>

Some files were not shown because too many files have changed in this diff Show More