mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
Documentation for def8f4937e
This commit is contained in:
github-actions
@@ -121,31 +121,33 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
|
||||
<tr id="row_13_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_14_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_15_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_16_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d9b/classgraph.html" target="_self">graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_18_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_20_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/df4/structlca.html" target="_self">lca</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_22_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_24_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_26_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_28_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_30_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_32_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dd2/class_queue___array.html" target="_self">Queue_Array</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_34_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_36_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_38_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dd9/structtrie.html" target="_self">trie</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_39_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_39_" class="arrow" onclick="toggleFolder('39_')">▼</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_39_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </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_16_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_16_" class="arrow" onclick="toggleFolder('16_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d9b/classgraph.html" target="_self">graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_1_"><td class="entry"><span style="width:32px;display:inline-block;"> </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">LowestCommonAncestor</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">RootedTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_17_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_19_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_21_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_23_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_25_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_27_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_29_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_31_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dd2/class_queue___array.html" target="_self">Queue_Array</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_33_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_35_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_37_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dd9/structtrie.html" target="_self">trie</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_38_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_38_" class="arrow" onclick="toggleFolder('38_')">▼</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_38_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </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>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -20,18 +20,17 @@ var annotated_dup =
|
||||
[ "hash_chain", "dd/d1c/classhash__chain.html", "dd/d1c/classhash__chain" ],
|
||||
[ "Item", "db/d66/struct_item.html", "db/d66/struct_item" ],
|
||||
[ "large_number", "db/d82/classlarge__number.html", "db/d82/classlarge__number" ],
|
||||
[ "lca", "dd/df4/structlca.html", "dd/df4/structlca" ],
|
||||
[ "linkedlist", "d0/dff/structlinkedlist.html", "d0/dff/structlinkedlist" ],
|
||||
[ "list", "d8/d10/structlist.html", "d8/d10/structlist" ],
|
||||
[ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ],
|
||||
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", "d5/d29/struct_min_heap_node" ],
|
||||
[ "mst", "d1/d77/structmst.html", "d1/d77/structmst" ],
|
||||
[ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ],
|
||||
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
|
||||
[ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ],
|
||||
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
|
||||
[ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
|
||||
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
|
||||
[ "Queue_Array", "d0/dd2/class_queue___array.html", "d0/dd2/class_queue___array" ],
|
||||
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ],
|
||||
[ "Solution", "dd/d4f/class_solution.html", "dd/d4f/class_solution" ],
|
||||
|
||||
133
classes.html
133
classes.html
@@ -94,103 +94,108 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
|
||||
<div class="title">Class Index</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<div class="qindex"><a class="qindex" href="#letter_a">a</a> | <a class="qindex" href="#letter_b">b</a> | <a class="qindex" href="#letter_c">c</a> | <a class="qindex" href="#letter_d">d</a> | <a class="qindex" href="#letter_e">e</a> | <a class="qindex" href="#letter_f">f</a> | <a class="qindex" href="#letter_g">g</a> | <a class="qindex" href="#letter_h">h</a> | <a class="qindex" href="#letter_i">i</a> | <a class="qindex" href="#letter_l">l</a> | <a class="qindex" href="#letter_m">m</a> | <a class="qindex" href="#letter_n">n</a> | <a class="qindex" href="#letter_p">p</a> | <a class="qindex" href="#letter_q">q</a> | <a class="qindex" href="#letter_s">s</a> | <a class="qindex" href="#letter_t">t</a></div>
|
||||
<div class="qindex"><a class="qindex" href="#letter_a">a</a> | <a class="qindex" href="#letter_b">b</a> | <a class="qindex" href="#letter_c">c</a> | <a class="qindex" href="#letter_d">d</a> | <a class="qindex" href="#letter_e">e</a> | <a class="qindex" href="#letter_f">f</a> | <a class="qindex" href="#letter_g">g</a> | <a class="qindex" href="#letter_h">h</a> | <a class="qindex" href="#letter_i">i</a> | <a class="qindex" href="#letter_l">l</a> | <a class="qindex" href="#letter_m">m</a> | <a class="qindex" href="#letter_n">n</a> | <a class="qindex" href="#letter_p">p</a> | <a class="qindex" href="#letter_q">q</a> | <a class="qindex" href="#letter_r">r</a> | <a class="qindex" href="#letter_s">s</a> | <a class="qindex" href="#letter_t">t</a></div>
|
||||
<table class="classindex">
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_a"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  a  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_e"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  e  </div></td></tr></table>
|
||||
<td valign="top"><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>)   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_l"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  l  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html">HillCipher</a> (<a class="el" href="d6/d4e/namespaceciphers.html">ciphers</a>)   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  n  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d1/d46/classdata__structure_1_1_skip_list.html">SkipList</a> (<a class="el" href="d1/db4/namespacedata__structure.html">data_structure</a>)   </td>
|
||||
</tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_i"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  i  </div></td></tr></table>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_p"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  p  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="dd/d4f/class_solution.html">Solution</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html">adaline</a> (<a class="el" href="d8/d77/namespacemachine__learning.html">machine_learning</a>)   </td>
|
||||
<td valign="top"><a class="el" href="d7/d77/class_edge.html">Edge</a>   </td>
|
||||
<td valign="top"><a class="el" href="db/d8b/struct_node.html">Node</a>   </td>
|
||||
<tr><td valign="top"><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>)   </td>
|
||||
<td valign="top"><a class="el" href="d1/dc2/classstack.html">stack</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html">adaline</a> (<a class="el" href="d8/d77/namespacemachine__learning.html">machine_learning</a>)   </td>
|
||||
<td valign="top"><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>)   </td>
|
||||
<td valign="top"><a class="el" href="db/d82/classlarge__number.html">large_number</a>   </td>
|
||||
<td valign="top"><a class="el" href="d8/dc8/struct_point.html">Point</a>   </td>
|
||||
<td valign="top"><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a>   </td>
|
||||
</tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_b"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  b  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><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>)   </td>
|
||||
<td valign="top"><a class="el" href="db/d66/struct_item.html">Item</a>   </td>
|
||||
<td valign="top"><a class="el" href="d3/d6f/structdata__structure_1_1_node.html">Node</a> (<a class="el" href="d1/db4/namespacedata__structure.html">data_structure</a>)   </td>
|
||||
<td valign="top"><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><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>)   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_l"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  l  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d5/da1/structnode.html">node</a>   </td>
|
||||
<td valign="top"><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d9/d90/struct_btree.html">Btree</a>   </td>
|
||||
<td valign="top"><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>)   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_p"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  p  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)   </td>
|
||||
</tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_c"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  c  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_f"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  f  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="db/d82/classlarge__number.html">large_number</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_t"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  t  </div></td></tr></table>
|
||||
</td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="dd/df4/structlca.html">lca</a>   </td>
|
||||
<td valign="top"><a class="el" href="d8/dc8/struct_point.html">Point</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d5/d15/classcll.html">cll</a>   </td>
|
||||
<td valign="top"><a class="el" href="dd/d91/class_fenwick_tree.html">FenwickTree</a>   </td>
|
||||
<td valign="top"><a class="el" href="d0/dff/structlinkedlist.html">linkedlist</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_q"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  q  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d2/d2c/structtower.html">tower</a>   </td>
|
||||
<td valign="top"><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d1/db3/structcompare.html">compare</a>   </td>
|
||||
<tr><td valign="top"><a class="el" href="d8/d10/structlist.html">list</a>   </td>
|
||||
<td valign="top"><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d9/d90/struct_btree.html">Btree</a>   </td>
|
||||
<td valign="top"><a class="el" href="dd/d91/class_fenwick_tree.html">FenwickTree</a>   </td>
|
||||
<td valign="top"><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a>   </td>
|
||||
<td valign="top"><a class="el" href="dd/d1b/structquery.html">query</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_t"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  t  </div></td></tr></table>
|
||||
</td>
|
||||
</tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_c"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  c  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_g"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  g  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d8/d10/structlist.html">list</a>   </td>
|
||||
<td valign="top"><a class="el" href="d4/dd9/structtrie.html">trie</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="da/d5a/class_complex.html">Complex</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_m"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  m  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="dd/d1b/structquery.html">query</a>   </td>
|
||||
<td valign="top"><a class="el" href="db/da9/classqueue.html">queue</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="dc/db5/struct_queue.html">Queue</a>   </td>
|
||||
<td valign="top"><a class="el" href="d2/d2c/structtower.html">tower</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d5/d15/classcll.html">cll</a>   </td>
|
||||
<td valign="top"><a class="el" href="da/d9a/class_graph.html">Graph</a>   </td>
|
||||
<td valign="top"><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a>   </td>
|
||||
<td valign="top"><a class="el" href="d0/dd2/class_queue___array.html">Queue_Array</a>   </td>
|
||||
<td valign="top"><a class="el" href="d4/dd9/structtrie.html">trie</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d1/db3/structcompare.html">compare</a>   </td>
|
||||
<td valign="top"><a class="el" href="dd/d9b/classgraph.html">graph</a>   </td>
|
||||
<td valign="top"><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_r"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  r  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="dd/d2f/class_trie.html">Trie</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a>   </td>
|
||||
<td valign="top"><a class="el" href="da/d9a/class_graph.html">Graph</a>   </td>
|
||||
<td valign="top"><a class="el" href="dc/db5/struct_queue.html">Queue</a>   </td>
|
||||
<tr><td valign="top"><a class="el" href="da/d5a/class_complex.html">Complex</a>   </td>
|
||||
<td valign="top"><a class="el" href="dc/d61/classgraph_1_1_graph.html">graph::Graph</a>   </td>
|
||||
<td valign="top"><a class="el" href="d1/d77/structmst.html">mst</a>   </td>
|
||||
<td valign="top"><a class="el" href="de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_h"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  h  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  n  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a>   </td>
|
||||
<td></td></tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_d"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  d  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="dd/d9b/classgraph.html">graph</a>   </td>
|
||||
<td valign="top"><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a>   </td>
|
||||
<td valign="top"><a class="el" href="db/da9/classqueue.html">queue</a>   </td>
|
||||
<td></td></tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_h"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  h  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a>   </td>
|
||||
<td valign="top"><a class="el" href="d0/dd2/class_queue___array.html">Queue_Array</a>   </td>
|
||||
<td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a>   </td>
|
||||
<td valign="top"><a class="el" href="d1/d77/structmst.html">mst</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_s"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  s  </div></td></tr></table>
|
||||
</td>
|
||||
<td></td></tr>
|
||||
<tr><td></td><td valign="top"><a class="el" href="dd/d1c/classhash__chain.html">hash_chain</a>   </td>
|
||||
<td></td><td></td></tr>
|
||||
<tr><td></td><td></td><td></td><td valign="top"><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a>   </td>
|
||||
<tr><td valign="top"><a class="el" href="dd/d1c/classhash__chain.html">hash_chain</a>   </td>
|
||||
<td valign="top"><a class="el" href="d3/d6f/structdata__structure_1_1_node.html">Node</a> (<a class="el" href="d1/db4/namespacedata__structure.html">data_structure</a>)   </td>
|
||||
<td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a>   </td>
|
||||
<td valign="top"><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html">HillCipher</a> (<a class="el" href="d6/d4e/namespaceciphers.html">ciphers</a>)   </td>
|
||||
<td valign="top"><a class="el" href="d5/da1/structnode.html">node</a>   </td>
|
||||
<td valign="top"><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a>   </td>
|
||||
<td></td></tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_e"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  e  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_i"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  i  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="db/d8b/struct_node.html">Node</a>   </td>
|
||||
<td valign="top"><a class="el" href="d1/d46/classdata__structure_1_1_skip_list.html">SkipList</a> (<a class="el" href="d1/db4/namespacedata__structure.html">data_structure</a>)   </td>
|
||||
<td></td></tr>
|
||||
<tr><td></td><td></td><td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="d7/d77/class_edge.html">Edge</a>   </td>
|
||||
<td valign="top"><a class="el" href="db/d66/struct_item.html">Item</a>   </td>
|
||||
<td></td><td></td><td></td></tr>
|
||||
<tr><td></td><td></td><td></td><td></td><td></td></tr>
|
||||
</table>
|
||||
<div class="qindex"><a class="qindex" href="#letter_a">a</a> | <a class="qindex" href="#letter_b">b</a> | <a class="qindex" href="#letter_c">c</a> | <a class="qindex" href="#letter_d">d</a> | <a class="qindex" href="#letter_e">e</a> | <a class="qindex" href="#letter_f">f</a> | <a class="qindex" href="#letter_g">g</a> | <a class="qindex" href="#letter_h">h</a> | <a class="qindex" href="#letter_i">i</a> | <a class="qindex" href="#letter_l">l</a> | <a class="qindex" href="#letter_m">m</a> | <a class="qindex" href="#letter_n">n</a> | <a class="qindex" href="#letter_p">p</a> | <a class="qindex" href="#letter_q">q</a> | <a class="qindex" href="#letter_s">s</a> | <a class="qindex" href="#letter_t">t</a></div>
|
||||
<div class="qindex"><a class="qindex" href="#letter_a">a</a> | <a class="qindex" href="#letter_b">b</a> | <a class="qindex" href="#letter_c">c</a> | <a class="qindex" href="#letter_d">d</a> | <a class="qindex" href="#letter_e">e</a> | <a class="qindex" href="#letter_f">f</a> | <a class="qindex" href="#letter_g">g</a> | <a class="qindex" href="#letter_h">h</a> | <a class="qindex" href="#letter_i">i</a> | <a class="qindex" href="#letter_l">l</a> | <a class="qindex" href="#letter_m">m</a> | <a class="qindex" href="#letter_n">n</a> | <a class="qindex" href="#letter_p">p</a> | <a class="qindex" href="#letter_q">q</a> | <a class="qindex" href="#letter_r">r</a> | <a class="qindex" href="#letter_s">s</a> | <a class="qindex" href="#letter_t">t</a></div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
|
||||
6
d0/d24/classgraph_1_1_rooted_tree__coll__graph.map
Normal file
6
d0/d24/classgraph_1_1_rooted_tree__coll__graph.map
Normal file
@@ -0,0 +1,6 @@
|
||||
<map id="graph::RootedTree" name="graph::RootedTree">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="86,213,217,240"/>
|
||||
<area shape="rect" id="node2" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="36,109,133,136"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,5,164,47"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="158,109,281,136"/>
|
||||
</map>
|
||||
1
d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5
Normal file
1
d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5
Normal file
@@ -0,0 +1 @@
|
||||
749777ad85452feddc9d7cd0fbff0c07
|
||||
71
d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg
Normal file
71
d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg
Normal file
@@ -0,0 +1,71 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::RootedTree Pages: 1 -->
|
||||
<svg width="215pt" height="184pt"
|
||||
viewBox="0.00 0.00 214.50 184.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 180)">
|
||||
<title>graph::RootedTree</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-180 210.5,-180 210.5,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="60.5,-0.5 60.5,-19.5 158.5,-19.5 158.5,-0.5 60.5,-0.5"/>
|
||||
<text text-anchor="middle" x="109.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="23,-78.5 23,-97.5 96,-97.5 96,-78.5 23,-78.5"/>
|
||||
<text text-anchor="middle" x="59.5" y="-85.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M70.97,-69.57C81.24,-53.95 95.88,-31.7 103.83,-19.62"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="67.81,-68 65.24,-78.28 73.66,-71.85 67.81,-68"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-145.5 0,-175.5 119,-175.5 119,-145.5 0,-145.5"/>
|
||||
<text text-anchor="start" x="8" y="-163.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< std::vector</text>
|
||||
<text text-anchor="middle" x="59.5" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">< int > ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node2 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node3->Node2</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M59.5,-135.09C59.5,-122.21 59.5,-107.2 59.5,-97.89"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="56,-135.23 59.5,-145.23 63,-135.23 56,-135.23"/>
|
||||
<text text-anchor="middle" x="82.5" y="-119" font-family="Helvetica,sans-Serif" font-size="10.00"> neighbors</text>
|
||||
</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/container/vector.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="114.5,-78.5 114.5,-97.5 206.5,-97.5 206.5,-78.5 114.5,-78.5"/>
|
||||
<text text-anchor="middle" x="160.5" y="-85.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< int ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node1 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node4->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M148.8,-69.57C138.32,-53.95 123.39,-31.7 115.28,-19.62"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="146.17,-71.93 154.65,-78.28 151.98,-68.03 146.17,-71.93"/>
|
||||
<text text-anchor="middle" x="156" y="-52" font-family="Helvetica,sans-Serif" font-size="10.00"> parent</text>
|
||||
<text text-anchor="middle" x="156" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">level</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.5 KiB |
290
d0/d58/classgraph_1_1_rooted_tree.html
Normal file
290
d0/d58/classgraph_1_1_rooted_tree.html
Normal file
@@ -0,0 +1,290 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: graph::RootedTree 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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d0/d58/classgraph_1_1_rooted_tree.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> |
|
||||
<a href="#pub-attribs">Public Attributes</a> |
|
||||
<a href="#pro-methods">Protected Member Functions</a> |
|
||||
<a href="../../d5/d55/classgraph_1_1_rooted_tree-members.html">List of all members</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">graph::RootedTree Class Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<div class="dynheader">
|
||||
Inheritance diagram for graph::RootedTree:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.svg" width="142" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for graph::RootedTree:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg" width="287" height="246"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
||||
Public Member Functions</h2></td></tr>
|
||||
<tr class="memitem:aacdeecac857623e9fbfe92590f3c504d"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">RootedTree</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< int, int > > &undirected_edges, int root_)</td></tr>
|
||||
<tr class="memdesc:aacdeecac857623e9fbfe92590f3c504d"><td class="mdescLeft"> </td><td class="mdescRight">Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is provided. <a href="../../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">More...</a><br /></td></tr>
|
||||
<tr class="separator:aacdeecac857623e9fbfe92590f3c504d"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="inherit_header pub_methods_classgraph_1_1_graph"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_classgraph_1_1_graph')"><img src="../../closed.png" alt="-"/> Public Member Functions inherited from <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td></tr>
|
||||
<tr class="memitem:a34414f67c2e3ea89774839b36b1575f8 inherit pub_methods_classgraph_1_1_graph"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">Graph</a> (size_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< int, int > > &undirected_edges)</td></tr>
|
||||
<tr class="memdesc:a34414f67c2e3ea89774839b36b1575f8 inherit pub_methods_classgraph_1_1_graph"><td class="mdescLeft"> </td><td class="mdescRight">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices. <a href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">More...</a><br /></td></tr>
|
||||
<tr class="separator:a34414f67c2e3ea89774839b36b1575f8 inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae2f6992450faa2c3da93edea0818869a inherit pub_methods_classgraph_1_1_graph"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a> () const</td></tr>
|
||||
<tr class="separator:ae2f6992450faa2c3da93edea0818869a inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
|
||||
Public Attributes</h2></td></tr>
|
||||
<tr class="memitem:a3831583a91914988897a4cc8748fda43"><td class="memItemLeft" align="right" valign="top"><a id="a3831583a91914988897a4cc8748fda43"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a></td></tr>
|
||||
<tr class="memdesc:a3831583a91914988897a4cc8748fda43"><td class="mdescLeft"> </td><td class="mdescRight">Stores parent of every vertex and for root its own index. The root is technically not its own parent, but it's very practical for the lowest common ancestor algorithm. <br /></td></tr>
|
||||
<tr class="separator:a3831583a91914988897a4cc8748fda43"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a2ee3ad1161ac2532da30c3e22c265ad3"><td class="memItemLeft" align="right" valign="top"><a id="a2ee3ad1161ac2532da30c3e22c265ad3"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a></td></tr>
|
||||
<tr class="memdesc:a2ee3ad1161ac2532da30c3e22c265ad3"><td class="mdescLeft"> </td><td class="mdescRight">Stores the distance from the root. <br /></td></tr>
|
||||
<tr class="separator:a2ee3ad1161ac2532da30c3e22c265ad3"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ab22a97bf6209a085fc2d788c3c0dacbe"><td class="memItemLeft" align="right" valign="top"><a id="ab22a97bf6209a085fc2d788c3c0dacbe"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a></td></tr>
|
||||
<tr class="memdesc:ab22a97bf6209a085fc2d788c3c0dacbe"><td class="mdescLeft"> </td><td class="mdescRight">Index of the root vertex. <br /></td></tr>
|
||||
<tr class="separator:ab22a97bf6209a085fc2d788c3c0dacbe"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="inherit_header pub_attribs_classgraph_1_1_graph"><td colspan="2" onclick="javascript:toggleInherit('pub_attribs_classgraph_1_1_graph')"><img src="../../closed.png" alt="-"/> Public Attributes inherited from <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td></tr>
|
||||
<tr class="memitem:aee72d7dd4778097a6d852c659de8fe58 inherit pub_attribs_classgraph_1_1_graph"><td class="memItemLeft" align="right" valign="top"><a id="aee72d7dd4778097a6d852c659de8fe58"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">neighbors</a></td></tr>
|
||||
<tr class="memdesc:aee72d7dd4778097a6d852c659de8fe58 inherit pub_attribs_classgraph_1_1_graph"><td class="mdescLeft"> </td><td class="mdescRight">for each vertex it stores a list indicies of its neighbors <br /></td></tr>
|
||||
<tr class="separator:aee72d7dd4778097a6d852c659de8fe58 inherit pub_attribs_classgraph_1_1_graph"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-methods"></a>
|
||||
Protected Member Functions</h2></td></tr>
|
||||
<tr class="memitem:ae6928f3ebd491541e9570e746b877c1e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">populate_parents</a> ()</td></tr>
|
||||
<tr class="memdesc:ae6928f3ebd491541e9570e746b877c1e"><td class="mdescLeft"> </td><td class="mdescRight">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm starting from the root vertex searching the entire tree and labeling parents for all vertices. <a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">More...</a><br /></td></tr>
|
||||
<tr class="separator:ae6928f3ebd491541e9570e746b877c1e"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Representation of a rooted tree. For every vertex its parent is precalculated. </p>
|
||||
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
|
||||
<a id="aacdeecac857623e9fbfe92590f3c504d"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aacdeecac857623e9fbfe92590f3c504d">◆ </a></span>RootedTree()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">graph::RootedTree::RootedTree </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< int, int > > & </td>
|
||||
<td class="paramname"><em>undirected_edges</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>root_</em> </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>Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is provided. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">undirected_edges</td><td>list of graph's undirected edges </td></tr>
|
||||
<tr><td class="paramname">root_</td><td>index of the root vertex </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  : <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">Graph</a>(undirected_edges.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() + 1, undirected_edges), <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>(root_) {</div>
|
||||
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">populate_parents</a>();</div>
|
||||
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<h2 class="groupheader">Member Function Documentation</h2>
|
||||
<a id="ae6928f3ebd491541e9570e746b877c1e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae6928f3ebd491541e9570e746b877c1e">◆ </a></span>populate_parents()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void graph::RootedTree::populate_parents </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm starting from the root vertex searching the entire tree and labeling parents for all vertices. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  {</div>
|
||||
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// Initialize the vector with -1 which indicates the vertex</span></div>
|
||||
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">// wasn't yet visited.</span></div>
|
||||
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a> = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>(<a class="code" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a>(), -1);</div>
|
||||
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a> = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>(<a class="code" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a>());</div>
|
||||
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>] = <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>;</div>
|
||||
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>] = 0;</div>
|
||||
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue<int></a> queue_of_vertices;</div>
|
||||
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  queue_of_vertices.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>);</div>
|
||||
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">while</span> (!queue_of_vertices.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
|
||||
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">int</span> vertex = queue_of_vertices.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>();</div>
|
||||
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  queue_of_vertices.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div>
|
||||
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> neighbor : <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">neighbors</a>[vertex]) {</div>
|
||||
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// As long as the vertex was not yet visited.</span></div>
|
||||
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[neighbor] == -1) {</div>
|
||||
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[neighbor] = vertex;</div>
|
||||
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[neighbor] = <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[vertex] + 1;</div>
|
||||
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  queue_of_vertices.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(neighbor);</div>
|
||||
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  }</div>
|
||||
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div>
|
||||
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div>
|
||||
<div class="line"><a name="l00137"></a><span class="lineno"> 137</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="../../d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.svg" width="510" height="256"><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 file:<ul>
|
||||
<li>graph/<a class="el" href="../../de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_a34414f67c2e3ea89774839b36b1575f8"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">graph::Graph::Graph</a></div><div class="ttdeci">Graph(size_t N, const std::vector< std::pair< int, int > > &undirected_edges)</div><div class="ttdoc">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid v...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:61</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector< int > level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:105</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< int ></a></div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ae6928f3ebd491541e9570e746b877c1e"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree::populate_parents</a></div><div class="ttdeci">void populate_parents()</div><div class="ttdoc">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:116</div></div>
|
||||
<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector< int > parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:103</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_aee72d7dd4778097a6d852c659de8fe58"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector< std::vector< int > > neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:78</div></div>
|
||||
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_ae2f6992450faa2c3da93edea0818869a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:73</div></div>
|
||||
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
|
||||
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ab22a97bf6209a085fc2d788c3c0dacbe"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">Index of the root vertex.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:107</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dd/d9b/classgraph.html">graph</a></li><li class="navelem"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a></li>
|
||||
<li class="footer">Generated by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
8
d0/d58/classgraph_1_1_rooted_tree.js
Normal file
8
d0/d58/classgraph_1_1_rooted_tree.js
Normal file
@@ -0,0 +1,8 @@
|
||||
var classgraph_1_1_rooted_tree =
|
||||
[
|
||||
[ "RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d", null ],
|
||||
[ "populate_parents", "d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e", null ],
|
||||
[ "level", "d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3", null ],
|
||||
[ "parent", "d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43", null ],
|
||||
[ "root", "d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe", null ]
|
||||
];
|
||||
@@ -0,0 +1,9 @@
|
||||
<map id="graph::RootedTree::populate_parents" name="graph::RootedTree::populate_parents">
|
||||
<area shape="rect" id="node1" title="Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm..." alt="" coords="5,107,144,149"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="203,5,329,32"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="207,56,325,83"/>
|
||||
<area shape="rect" id="node4" href="$dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a" title=" " alt="" coords="192,107,340,149"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="210,173,322,200"/>
|
||||
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="207,224,325,251"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="388,115,504,141"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
30afca0f7f3d555dd0b3b04338cf4c7b
|
||||
@@ -0,0 +1,114 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::RootedTree::populate_parents Pages: 1 -->
|
||||
<svg width="382pt" height="192pt"
|
||||
viewBox="0.00 0.00 382.00 192.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 188)">
|
||||
<title>graph::RootedTree::populate_parents</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-188 378,-188 378,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-77 0,-107 104,-107 104,-77 0,-77"/>
|
||||
<text text-anchor="start" x="8" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree::</text>
|
||||
<text text-anchor="middle" x="52" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">populate_parents</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="148,-164.5 148,-183.5 243,-183.5 243,-164.5 148,-164.5"/>
|
||||
<text text-anchor="middle" x="195.5" y="-171.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M70.65,-107.17C87.55,-121.09 114.21,-141.54 140,-155 144.01,-157.09 148.29,-159.03 152.63,-160.82"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="151.55,-164.15 162.14,-164.46 154.06,-157.62 151.55,-164.15"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="151.5,-126.5 151.5,-145.5 239.5,-145.5 239.5,-126.5 151.5,-126.5"/>
|
||||
<text text-anchor="middle" x="195.5" y="-133.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M101.3,-107.02C118.41,-112.34 137.46,-118.26 153.87,-123.37"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="153.11,-126.79 163.7,-126.42 155.19,-120.11 153.11,-126.79"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="140,-77 140,-107 251,-107 251,-77 140,-77"/>
|
||||
<text text-anchor="start" x="148" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
|
||||
<text text-anchor="middle" x="195.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M104.08,-92C112.3,-92 120.9,-92 129.39,-92"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="129.67,-95.5 139.67,-92 129.67,-88.5 129.67,-95.5"/>
|
||||
</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/container/queue/pop.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="153.5,-38.5 153.5,-57.5 237.5,-57.5 237.5,-38.5 153.5,-38.5"/>
|
||||
<text text-anchor="middle" x="195.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M101.3,-76.98C118.41,-71.66 137.46,-65.74 153.87,-60.63"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="155.19,-63.89 163.7,-57.58 153.11,-57.21 155.19,-63.89"/>
|
||||
</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/container/queue/push.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="151,-0.5 151,-19.5 240,-19.5 240,-0.5 151,-0.5"/>
|
||||
<text text-anchor="middle" x="195.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node7 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M70.65,-76.83C87.55,-62.91 114.21,-42.46 140,-29 144.01,-26.91 148.29,-24.97 152.63,-23.18"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="154.06,-26.38 162.14,-19.54 151.55,-19.85 154.06,-26.38"/>
|
||||
</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/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="287,-82.5 287,-101.5 374,-101.5 374,-82.5 287,-82.5"/>
|
||||
<text text-anchor="middle" x="330.5" y="-89.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node4->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M251.36,-92C259.81,-92 268.51,-92 276.91,-92"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="276.95,-95.5 286.95,-92 276.95,-88.5 276.95,-95.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 5.7 KiB |
@@ -0,0 +1,7 @@
|
||||
<map id="graph::LowestCommonAncestor" name="graph::LowestCommonAncestor">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,303,215,329"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="31,5,189,47"/>
|
||||
<area shape="rect" id="node4" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="127,109,224,136"/>
|
||||
<area shape="rect" id="node3" href="$d0/d58/classgraph_1_1_rooted_tree.html" title=" " alt="" coords="126,213,257,240"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="249,109,371,136"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
bd547a89ac56ae089298b3a8c71cefc7
|
||||
@@ -0,0 +1,94 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::LowestCommonAncestor Pages: 1 -->
|
||||
<svg width="283pt" height="251pt"
|
||||
viewBox="0.00 0.00 282.50 251.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 247)">
|
||||
<title>graph::LowestCommonAncestor</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-247 278.5,-247 278.5,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 157,-19.5 157,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="78.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="19,-212.5 19,-242.5 138,-242.5 138,-212.5 19,-212.5"/>
|
||||
<text text-anchor="start" x="27" y="-230.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< std::vector</text>
|
||||
<text text-anchor="middle" x="78.5" y="-219.5" font-family="Helvetica,sans-Serif" font-size="10.00">< int > ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M78.5,-202.32C78.5,-154.71 78.5,-50.74 78.5,-19.83"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="75,-202.36 78.5,-212.36 82,-202.36 75,-202.36"/>
|
||||
<text text-anchor="middle" x="85.5" y="-113.5" font-family="Helvetica,sans-Serif" font-size="10.00"> up</text>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="91,-145.5 91,-164.5 164,-164.5 164,-145.5 91,-145.5"/>
|
||||
<text text-anchor="middle" x="127.5" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M94.13,-204.01C103.36,-190.73 114.53,-174.66 121.32,-164.89"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="91.25,-202.02 88.42,-212.23 97,-206.02 91.25,-202.02"/>
|
||||
<text text-anchor="middle" x="130.5" y="-186" font-family="Helvetica,sans-Serif" font-size="10.00"> neighbors</text>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d0/d58/classgraph_1_1_rooted_tree.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="90.5,-67.5 90.5,-86.5 188.5,-86.5 188.5,-67.5 90.5,-67.5"/>
|
||||
<text text-anchor="middle" x="139.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node1 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node3->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M124.14,-59.63C112.21,-46.92 96.14,-29.8 86.6,-19.63"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="121.88,-62.34 131.27,-67.23 126.98,-57.55 121.88,-62.34"/>
|
||||
<text text-anchor="middle" x="123.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00"> tree</text>
|
||||
</g>
|
||||
<!-- Node4->Node3 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node4->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M130.46,-135.22C132.92,-119.7 136.29,-98.36 138.14,-86.62"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="126.98,-134.86 128.88,-145.28 133.89,-135.95 126.98,-134.86"/>
|
||||
</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/container/vector.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="182.5,-145.5 182.5,-164.5 274.5,-164.5 274.5,-145.5 182.5,-145.5"/>
|
||||
<text text-anchor="middle" x="228.5" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< int ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node3 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node5->Node3</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M210.62,-138.73C192.28,-123.07 164.41,-99.27 149.59,-86.62"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="208.41,-141.45 218.29,-145.28 212.96,-136.13 208.41,-141.45"/>
|
||||
<text text-anchor="middle" x="211" y="-119" font-family="Helvetica,sans-Serif" font-size="10.00"> parent</text>
|
||||
<text text-anchor="middle" x="211" y="-108" font-family="Helvetica,sans-Serif" font-size="10.00">level</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 4.9 KiB |
@@ -412,10 +412,12 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="aequal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/equal.html">std::equal</a></div><div class="ttdeci">T equal(T... args)</div></div>
|
||||
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_a34414f67c2e3ea89774839b36b1575f8"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">graph::Graph::Graph</a></div><div class="ttdeci">Graph(size_t N, const std::vector< std::pair< int, int > > &undirected_edges)</div><div class="ttdoc">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid v...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:61</div></div>
|
||||
<div class="ttc" id="afibonacci__fast_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
|
||||
<div class="ttc" id="aclass_graph_html_ac5a4d9a4f894a179198936042c778413"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph::addVertices</a></div><div class="ttdeci">void addVertices(unsigned int num=1)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:118</div></div>
|
||||
<div class="ttc" id="alarge__factorial_8cpp_html_a3f93b60e229b6683e24c4754a7106ee8"><div class="ttname"><a href="../../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8">test1</a></div><div class="ttdeci">bool test1()</div><div class="ttdef"><b>Definition:</b> large_factorial.cpp:17</div></div>
|
||||
<div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a80825a4fd4c41860b689d253dd2c8e93"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">graph::LowestCommonAncestor::LowestCommonAncestor</a></div><div class="ttdeci">LowestCommonAncestor(const RootedTree &tree_)</div><div class="ttdoc">Stores the tree and precomputs "up lifts".</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:151</div></div>
|
||||
<div class="ttc" id="ainner_product_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html">std::inner_product</a></div><div class="ttdeci">T inner_product(T... args)</div></div>
|
||||
<div class="ttc" id="astructlinear__probing_1_1_entry_html_a2139f643a3caf074da1db8a9fa16fa77"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">linear_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:36</div></div>
|
||||
<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
|
||||
@@ -432,6 +434,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="anamespacedouble__hashing_html"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a></div><div class="ttdoc">An implementation of hash table using double hashing algorithm.</div></div>
|
||||
<div class="ttc" id="astructlinear__probing_1_1_entry_html"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:35</div></div>
|
||||
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector< int > level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:105</div></div>
|
||||
<div class="ttc" id="adouble__factorial_8cpp_html_a0a3c417360400093891a9ccddaa4be26"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26">double_factorial_iterative</a></div><div class="ttdeci">uint64_t double_factorial_iterative(uint64_t n)</div><div class="ttdef"><b>Definition:</b> double_factorial.cpp:17</div></div>
|
||||
<div class="ttc" id="anamespacedouble__hashing_html_a5d06e4598569526294f10104875f6824"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:227</div></div>
|
||||
<div class="ttc" id="aclasshash__chain_html_a55aa5c6753cb8853152d469c375d946a"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a">hash_chain::find</a></div><div class="ttdeci">bool find(int x, int h) const</div><div class="ttdoc">Find if a value and corresponding hash exist.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:101</div></div>
|
||||
@@ -462,6 +465,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aspirograph_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> spirograph.cpp:268</div></div>
|
||||
<div class="ttc" id="aclass_complex_html_a466cd7b664cc6a864937ceb3dead1323"><div class="ttname"><a href="../../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323">Complex::Complex</a></div><div class="ttdeci">Complex(const Complex &other)</div><div class="ttdoc">Copy Constructor.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:58</div></div>
|
||||
<div class="ttc" id="aemplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">std::queue::emplace</a></div><div class="ttdeci">T emplace(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a42589cc39d6bbff6c997152f1b96e356"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor::populate_up</a></div><div class="ttdeci">void populate_up()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:212</div></div>
|
||||
<div class="ttc" id="aclass_complex_html_a3cfc522c782726f49ee20af17b77f867"><div class="ttname"><a href="../../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867">Complex::Complex</a></div><div class="ttdeci">Complex(double x=0.f, double y=0.f, bool is_polar=false)</div><div class="ttdoc">Complex Constructor which initialises our complex number.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:43</div></div>
|
||||
<div class="ttc" id="abasic_stringstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="aclass_complex_html_ae5b51b749ea4964104b9527af9d8f556"><div class="ttname"><a href="../../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556">Complex::abs</a></div><div class="ttdeci">double abs() const</div><div class="ttdoc">Member function to give the modulus of our complex number. Member function to which gives the absolut...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:79</div></div>
|
||||
@@ -472,6 +476,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition:</b> gcd_recursive_euclidean.cpp:14</div></div>
|
||||
<div class="ttc" id="alarge__number_8h_html"><div class="ttname"><a href="../../d4/d86/large__number_8h.html">large_number.h</a></div><div class="ttdoc">Library to perform arithmatic operations on arbitrarily large numbers.</div></div>
|
||||
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> avltree.cpp:13</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:84</div></div>
|
||||
<div class="ttc" id="acomplex__numbers_8cpp_html_a5d4d5b8250b50703de888514c8e7a7a0"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a></div><div class="ttdeci">double get_rand()</div><div class="ttdoc">Function to get random numbers to generate our complex numbers for test.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:201</div></div>
|
||||
<div class="ttc" id="abinary__exponent_8cpp_html_a31dbf5f7ceb9c9eec831ef9f7782291f"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f">binExpo_alt</a></div><div class="ttdeci">int binExpo_alt(int a, int b)</div><div class="ttdef"><b>Definition:</b> binary_exponent.cpp:42</div></div>
|
||||
<div class="ttc" id="aclassgraph_html_a6398e513b9574e029fbee07c6ac6e028"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a6398e513b9574e029fbee07c6ac6e028">graph::explore</a></div><div class="ttdeci">void explore(int, vector< bool > &)</div><div class="ttdoc">Utility function for depth first seach algorithm this function explores the vertex which is passed in...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:101</div></div>
|
||||
@@ -494,6 +499,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="anamespacelinear__probing_html_a942fc8407b8001890ea26830cdcd9d77"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">linear_probing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:110</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ab11242d9ad5b03a75911e29b04f78fd3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">machine_learning::adaline::predict</a></div><div class="ttdeci">int predict(const std::vector< double > &x, double *out=nullptr)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:95</div></div>
|
||||
<div class="ttc" id="acomplex__numbers_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:206</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ae6928f3ebd491541e9570e746b877c1e"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree::populate_parents</a></div><div class="ttdeci">void populate_parents()</div><div class="ttdoc">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:116</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">Machine learning algorithms.</div></div>
|
||||
<div class="ttc" id="aclass_complex_html_a889215b7b004a3e7ec4d785ca5e7a2ba"><div class="ttname"><a href="../../da/d5a/class_complex.html#a889215b7b004a3e7ec4d785ca5e7a2ba">Complex::operator=</a></div><div class="ttdeci">const Complex & operator=(const Complex &other)</div><div class="ttdoc">Operator overload of '=' on Complex class. Operator overload to be able to copy RHS instance of Compl...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:160</div></div>
|
||||
<div class="ttc" id="astrerror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strerror.html">std::strerror</a></div><div class="ttdeci">T strerror(T... args)</div></div>
|
||||
@@ -522,7 +528,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aclasshash__chain_html_a6b4b4de1a8c96f98a63a77f650a9dcff"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">hash_chain::add</a></div><div class="ttdeci">void add(int x, int h)</div><div class="ttdoc">create and add a new node with a give value and at a given height</div><div class="ttdef"><b>Definition:</b> chaining.cpp:45</div></div>
|
||||
<div class="ttc" id="anamespacequadratic__probing_html_a07a0467b24102260fbb6b554c453c20a"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a">quadratic_probing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:194</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_ac27b399ed872731758ec33ebb102730e"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e">large_number::operator+=</a></div><div class="ttdeci">large_number & operator+=(large_number n)</div><div class="ttdef"><b>Definition:</b> large_number.h:192</div></div>
|
||||
<div class="ttc" id="astructquery_html"><div class="ttname"><a href="../../dd/d1b/structquery.html">query</a></div><div class="ttdef"><b>Definition:</b> mo.cpp:6</div></div>
|
||||
<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:55</div></div>
|
||||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_ab6171f4db68a5e50ae0f3500a63acd26"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab6171f4db68a5e50ae0f3500a63acd26">operator*</a></div><div class="ttdeci">std::vector< std::vector< T > > operator*(std::vector< std::vector< T >> const &A, std::vector< std::vector< T >> const &B)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:78</div></div>
|
||||
<div class="ttc" id="agroup__machine__learning_html_ga5118e5cbc4f0886e27b3a7a2544dded1"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">MAX_ITER</a></div><div class="ttdeci">constexpr int MAX_ITER</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:40</div></div>
|
||||
@@ -546,10 +551,12 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="akohonen__som__topology_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:537</div></div>
|
||||
<div class="ttc" id="aavltree_8cpp_html_a1ecfaaea49d452772dbb2b28133e36e0"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a1ecfaaea49d452772dbb2b28133e36e0">createNode</a></div><div class="ttdeci">node * createNode(int data)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:21</div></div>
|
||||
<div class="ttc" id="aclass_cycle_check_html"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html">CycleCheck</a></div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:158</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector< int > parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:103</div></div>
|
||||
<div class="ttc" id="aclass_cycle_check_html_a2f4485c08b45e7a21a2e86f9c3f01d8b"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">CycleCheck::isCyclicDFSHelper</a></div><div class="ttdeci">static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:170</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_ab1af3e0f425cdf7ea2039c9dcfe22f0b"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ab1af3e0f425cdf7ea2039c9dcfe22f0b">large_number::operator*=</a></div><div class="ttdeci">large_number & operator*=(const T n)</div><div class="ttdef"><b>Definition:</b> large_number.h:238</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_a10119a83839e65962621b73df46a5337"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number::large_number</a></div><div class="ttdeci">large_number()</div><div class="ttdef"><b>Definition:</b> large_number.h:27</div></div>
|
||||
<div class="ttc" id="abinary__exponent_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> binary_exponent.cpp:55</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_aacdeecac857623e9fbfe92590f3c504d"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">graph::RootedTree::RootedTree</a></div><div class="ttdeci">RootedTree(const std::vector< std::pair< int, int > > &undirected_edges, int root_)</div><div class="ttdoc">Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is ...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:93</div></div>
|
||||
<div class="ttc" id="astruct_min_heap_node_html"><div class="ttname"><a href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a></div><div class="ttdef"><b>Definition:</b> huffman.cpp:7</div></div>
|
||||
<div class="ttc" id="aline__segment__intersection_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:92</div></div>
|
||||
<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a75f72858f08a2fc8b94402de98db12d8"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">quadratic_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:39</div></div>
|
||||
@@ -570,6 +577,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a28160d17e492597a2f112e0d38551cda"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">machine_learning::adaline::eta</a></div><div class="ttdeci">const double eta</div><div class="ttdoc">learning rate of the algorithm</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:207</div></div>
|
||||
<div class="ttc" id="amin_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">std::min_element</a></div><div class="ttdeci">T min_element(T... args)</div></div>
|
||||
<div class="ttc" id="aeulers__totient__function_8cpp_html_a35e4874a3e1d67eb708dc57944c8aea0"><div class="ttname"><a href="../../da/d23/eulers__totient__function_8cpp.html#a35e4874a3e1d67eb708dc57944c8aea0">phiFunction</a></div><div class="ttdeci">uint64_t phiFunction(uint64_t n)</div><div class="ttdef"><b>Definition:</b> eulers_totient_function.cpp:32</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_aee72d7dd4778097a6d852c659de8fe58"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector< std::vector< int > > neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:78</div></div>
|
||||
<div class="ttc" id="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:47</div></div>
|
||||
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
|
||||
<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/top.html">std::stack::top</a></div><div class="ttdeci">T top(T... args)</div></div>
|
||||
@@ -662,6 +670,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aclasshash__chain_html_a48236d44349c3ebce4774b706f4f8a0f"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f">hash_chain::next</a></div><div class="ttdeci">std::shared_ptr< struct Node > next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition:</b> chaining.cpp:23</div></div>
|
||||
<div class="ttc" id="aclassgraph_html_a45045da3d080cb81472ce6d5cc02b911"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a45045da3d080cb81472ce6d5cc02b911">graph::adj</a></div><div class="ttdeci">vector< vector< int > > adj</div><div class="ttdoc">adj stores adjacency list representation of graph</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:40</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_a7ba872b9a3ce1f3da6c06c5409663cca"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">large_number::operator==</a></div><div class="ttdeci">friend bool operator==(large_number const &a, large_number const &b)</div><div class="ttdef"><b>Definition:</b> large_number.h:155</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:145</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a1d821a24e1503d468c95d4acedca58b3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a1d821a24e1503d468c95d4acedca58b3">machine_learning::adaline::operator<<</a></div><div class="ttdeci">friend std::ostream & operator<<(std::ostream &out, const adaline &ada)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:76</div></div>
|
||||
<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
|
||||
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
|
||||
@@ -674,13 +683,16 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a7220dbb7fa896d83bfb7a50e4fce1786"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786">machine_learning::MIN_DISTANCE</a></div><div class="ttdeci">constexpr double MIN_DISTANCE</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:129</div></div>
|
||||
<div class="ttc" id="anamespacelinear__probing_html_a75854f5aa216e61219154c62167ce8f0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:201</div></div>
|
||||
<div class="ttc" id="atower__of__hanoi_8cpp_html_a746d9a3984bba88fd6dd91978f6931ed"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed">show</a></div><div class="ttdeci">void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:19</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_ae2f6992450faa2c3da93edea0818869a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:73</div></div>
|
||||
<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition:</b> huffman.cpp:28</div></div>
|
||||
<div class="ttc" id="async_with_stdio_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html">std::ios_base::sync_with_stdio</a></div><div class="ttdeci">T sync_with_stdio(T... args)</div></div>
|
||||
<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdef"><b>Definition:</b> stack.h:26</div></div>
|
||||
<div class="ttc" id="alowest__common__ancestor_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:234</div></div>
|
||||
<div class="ttc" id="akohonen__som__topology_8cpp_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:577</div></div>
|
||||
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a25034543c20f271da04fb24ad2b2747a"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a">gcd</a></div><div class="ttdeci">int gcd(int *a, int n)</div><div class="ttdef"><b>Definition:</b> gcd_of_n_numbers.cpp:15</div></div>
|
||||
<div class="ttc" id="anamespacedouble__hashing_html_a79a9c914a6c68275b3640303d7faad8a"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">double_hashing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:185</div></div>
|
||||
<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:71</div></div>
|
||||
<div class="ttc" id="alowest__common__ancestor_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:256</div></div>
|
||||
<div class="ttc" id="afast__power_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fast_power.cpp:68</div></div>
|
||||
<div class="ttc" id="adouble__factorial_8cpp_html_a68ba20fed2ce427f6469c7689437829d"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d">double_factorial_recursive</a></div><div class="ttdeci">uint64_t double_factorial_recursive(uint64_t n)</div><div class="ttdef"><b>Definition:</b> double_factorial.cpp:30</div></div>
|
||||
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph algorithms.</div></div>
|
||||
@@ -688,6 +700,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="acount_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a></div><div class="ttdeci">T count(T... args)</div></div>
|
||||
<div class="ttc" id="aptrdiff_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/ptrdiff_t.html">std::ptrdiff_t</a></div></div>
|
||||
<div class="ttc" id="aclass_trie_html_a411e77126930a0942dd7b65e96b15206"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">Trie::search</a></div><div class="ttdeci">bool search(const std::string &word)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:132</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:52</div></div>
|
||||
<div class="ttc" id="afixed_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::fixed</a></div><div class="ttdeci">T fixed(T... args)</div></div>
|
||||
<div class="ttc" id="astruct_item_html"><div class="ttname"><a href="../../db/d66/struct_item.html">Item</a></div><div class="ttdef"><b>Definition:</b> knapsack.cpp:4</div></div>
|
||||
<div class="ttc" id="alinear__probing__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:224</div></div>
|
||||
@@ -705,7 +718,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="astr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html">std::stringstream::str</a></div><div class="ttdeci">T str(T... args)</div></div>
|
||||
<div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div>
|
||||
<div class="ttc" id="astructlca_html"><div class="ttname"><a href="../../dd/df4/structlca.html">lca</a></div><div class="ttdef"><b>Definition:</b> lca.cpp:10</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_af4598f1f2794b5e17e10c25e0501e41a"><div class="ttname"><a href="../../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a">large_number::large_number</a></div><div class="ttdeci">large_number(int n)</div><div class="ttdef"><b>Definition:</b> large_number.h:39</div></div>
|
||||
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
|
||||
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
|
||||
@@ -722,6 +734,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> gcd_iterative_euclidean.cpp:47</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="akohonen__som__topology_8cpp_html_a6b5e744876fd980a3451cbb385d4e755"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6b5e744876fd980a3451cbb385d4e755">test_2d_classes</a></div><div class="ttdeci">void test_2d_classes(std::vector< std::valarray< double >> *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:330</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ab22a97bf6209a085fc2d788c3c0dacbe"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">Index of the root vertex.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:107</div></div>
|
||||
<div class="ttc" id="arange_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:12</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_a72ae1ef050c4c28c50952ecab22d4b94"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94">large_number::operator!=</a></div><div class="ttdeci">friend bool operator!=(large_number const &a, large_number const &b)</div><div class="ttdef"><b>Definition:</b> large_number.h:168</div></div>
|
||||
@@ -736,7 +749,9 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aclass_graph_html_af765dda8f21280e1cecea19e129f1bc5"><div class="ttname"><a href="../../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">Graph::addEdge</a></div><div class="ttdeci">void addEdge(Edge const &edge)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:124</div></div>
|
||||
<div class="ttc" id="afast__power_8cpp_html_a0d4e3f0099a6975b74a314a35bd0f94d"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a></div><div class="ttdeci">double fast_power_linear(T a, T b)</div><div class="ttdef"><b>Definition:</b> fast_power.cpp:50</div></div>
|
||||
<div class="ttc" id="anamespacespirograph_html_aeca22dbe4563358960e907a40cd3e1ac"><div class="ttname"><a href="../../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac">spirograph::spirograph</a></div><div class="ttdeci">void spirograph(std::array< std::pair< double, double >, N > *points, double l, double k, double rot)</div><div class="ttdef"><b>Definition:</b> spirograph.cpp:70</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a60151e19512b48cc0b14ea121df00488"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">graph::LowestCommonAncestor::lowest_common_ancestor</a></div><div class="ttdeci">int lowest_common_ancestor(int u, int v) const</div><div class="ttdoc">Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:164</div></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="aclassgraph_1_1_lowest_common_ancestor_html_ad2032148b2443f5b6a0d01e4519d6898"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">graph::LowestCommonAncestor::up</a></div><div class="ttdeci">std::vector< std::vector< int > > up</div><div class="ttdoc">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:206</div></div>
|
||||
<div class="ttc" id="aclasshash__chain_html_a706964ad13587fc9a8b3fe8381d410ed"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">hash_chain::display</a></div><div class="ttdeci">void display()</div><div class="ttdoc">Display the chain.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:63</div></div>
|
||||
<div class="ttc" id="aclass_graph_html_ae30edce9b4e7c6347e67edc343f366d8"><div class="ttname"><a href="../../da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList const &adjList)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:68</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_ac4fafa6289295419d48d444f0ae4b706"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac4fafa6289295419d48d444f0ae4b706">large_number::operator++</a></div><div class="ttdeci">large_number & operator++(int)</div><div class="ttdef"><b>Definition:</b> large_number.h:183</div></div>
|
||||
|
||||
@@ -1,4 +0,0 @@
|
||||
<map id="lca" name="lca">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="47,95,86,121"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,5,128,32"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
d14c8be22877978195a9e43ea9c94e0e
|
||||
@@ -1,38 +0,0 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: lca Pages: 1 -->
|
||||
<svg width="100pt" height="95pt"
|
||||
viewBox="0.00 0.00 100.00 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>lca</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 96,-91 96,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="31.5,-0.5 31.5,-19.5 60.5,-19.5 60.5,-0.5 31.5,-0.5"/>
|
||||
<text text-anchor="middle" x="46" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">lca</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-67.5 0,-86.5 92,-86.5 92,-67.5 0,-67.5"/>
|
||||
<text text-anchor="middle" x="46" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< int ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M46,-57.04C46,-44.67 46,-29.12 46,-19.63"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="42.5,-57.23 46,-67.23 49.5,-57.23 42.5,-57.23"/>
|
||||
<text text-anchor="middle" x="54" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00"> adj</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 1.7 KiB |
4
d5/d08/classgraph_1_1_graph__coll__graph.map
Normal file
4
d5/d08/classgraph_1_1_graph__coll__graph.map
Normal file
@@ -0,0 +1,4 @@
|
||||
<map id="graph::Graph" name="graph::Graph">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="36,109,133,136"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,5,164,47"/>
|
||||
</map>
|
||||
1
d5/d08/classgraph_1_1_graph__coll__graph.md5
Normal file
1
d5/d08/classgraph_1_1_graph__coll__graph.md5
Normal file
@@ -0,0 +1 @@
|
||||
5c18b58932f5443083b287acc5b3ed7f
|
||||
39
d5/d08/classgraph_1_1_graph__coll__graph.svg
Normal file
39
d5/d08/classgraph_1_1_graph__coll__graph.svg
Normal file
@@ -0,0 +1,39 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::Graph Pages: 1 -->
|
||||
<svg width="127pt" height="106pt"
|
||||
viewBox="0.00 0.00 127.00 106.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 102)">
|
||||
<title>graph::Graph</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-102 123,-102 123,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="23,-0.5 23,-19.5 96,-19.5 96,-0.5 23,-0.5"/>
|
||||
<text text-anchor="middle" x="59.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-67.5 0,-97.5 119,-97.5 119,-67.5 0,-67.5"/>
|
||||
<text text-anchor="start" x="8" y="-85.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< std::vector</text>
|
||||
<text text-anchor="middle" x="59.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">< int > ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M59.5,-57.09C59.5,-44.21 59.5,-29.2 59.5,-19.89"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="56,-57.23 59.5,-67.23 63,-57.23 56,-57.23"/>
|
||||
<text text-anchor="middle" x="82.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00"> neighbors</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.9 KiB |
119
d5/d55/classgraph_1_1_rooted_tree-members.html
Normal file
119
d5/d55/classgraph_1_1_rooted_tree-members.html
Normal file
@@ -0,0 +1,119 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d0/d58/classgraph_1_1_rooted_tree.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">graph::RootedTree Member List</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">Graph</a>(size_t N, const std::vector< std::pair< int, int > > &undirected_edges)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a></td><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></td><td class="entry"></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">neighbors</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td><td class="entry"></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a>() const</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a></td><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></td><td class="entry"></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">populate_parents</a>()</td><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a></td><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></td><td class="entry"></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">RootedTree</a>(const std::vector< std::pair< int, int > > &undirected_edges, int root_)</td><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</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="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -192,7 +192,7 @@ Graph</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/hamiltons_cycle.cpp">Hamiltons Cycle</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/kosaraju.cpp">Kosaraju</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/kruskal.cpp">Kruskal</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/lca.cpp">Lca</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/lowest_common_ancestor.cpp">Lowest Common Ancestor</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp">Max Flow With Ford Fulkerson And Edmond Karp Algo</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/prim.cpp">Prim</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/topological_sort.cpp">Topological Sort</a></li>
|
||||
|
||||
4
d7/dc1/classgraph_1_1_graph__inherit__graph.map
Normal file
4
d7/dc1/classgraph_1_1_graph__inherit__graph.map
Normal file
@@ -0,0 +1,4 @@
|
||||
<map id="graph::Graph" name="graph::Graph">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="22,5,119,32"/>
|
||||
<area shape="rect" id="node2" href="$d0/d58/classgraph_1_1_rooted_tree.html" title=" " alt="" coords="5,80,136,107"/>
|
||||
</map>
|
||||
1
d7/dc1/classgraph_1_1_graph__inherit__graph.md5
Normal file
1
d7/dc1/classgraph_1_1_graph__inherit__graph.md5
Normal file
@@ -0,0 +1 @@
|
||||
1a9b4fcdd12e5e4774146501e35513f2
|
||||
37
d7/dc1/classgraph_1_1_graph__inherit__graph.svg
Normal file
37
d7/dc1/classgraph_1_1_graph__inherit__graph.svg
Normal 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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::Graph Pages: 1 -->
|
||||
<svg width="106pt" height="84pt"
|
||||
viewBox="0.00 0.00 106.00 84.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 80)">
|
||||
<title>graph::Graph</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 102,-80 102,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="12.5,-56.5 12.5,-75.5 85.5,-75.5 85.5,-56.5 12.5,-56.5"/>
|
||||
<text text-anchor="middle" x="49" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d0/d58/classgraph_1_1_rooted_tree.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 98,-19.5 98,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="49" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M49,-45.8C49,-36.91 49,-26.78 49,-19.75"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="45.5,-46.08 49,-56.08 52.5,-46.08 45.5,-46.08"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.6 KiB |
334
d9/d23/classgraph_1_1_lowest_common_ancestor.html
Normal file
334
d9/d23/classgraph_1_1_lowest_common_ancestor.html
Normal file
@@ -0,0 +1,334 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: graph::LowestCommonAncestor 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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d9/d23/classgraph_1_1_lowest_common_ancestor.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> |
|
||||
<a href="#pub-attribs">Public Attributes</a> |
|
||||
<a href="#pro-methods">Protected Member Functions</a> |
|
||||
<a href="../../da/d73/classgraph_1_1_lowest_common_ancestor-members.html">List of all members</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">graph::LowestCommonAncestor Class Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for graph::LowestCommonAncestor:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg" width="378" height="335"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
||||
Public Member Functions</h2></td></tr>
|
||||
<tr class="memitem:a80825a4fd4c41860b689d253dd2c8e93"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">LowestCommonAncestor</a> (const <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> &tree_)</td></tr>
|
||||
<tr class="memdesc:a80825a4fd4c41860b689d253dd2c8e93"><td class="mdescLeft"> </td><td class="mdescRight">Stores the tree and precomputs "up lifts". <a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">More...</a><br /></td></tr>
|
||||
<tr class="separator:a80825a4fd4c41860b689d253dd2c8e93"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a60151e19512b48cc0b14ea121df00488"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">lowest_common_ancestor</a> (int u, int v) const</td></tr>
|
||||
<tr class="memdesc:a60151e19512b48cc0b14ea121df00488"><td class="mdescLeft"> </td><td class="mdescRight">Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid indices of vertices. Iterativelly modifies ("lifts") u an v until it finnds their lowest common ancestor. <a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">More...</a><br /></td></tr>
|
||||
<tr class="separator:a60151e19512b48cc0b14ea121df00488"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
|
||||
Public Attributes</h2></td></tr>
|
||||
<tr class="memitem:ad6ae1f39c3ce27fc009970e6aa3c022a"><td class="memItemLeft" align="right" valign="top"><a id="ad6ae1f39c3ce27fc009970e6aa3c022a"></a>
|
||||
const <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> & </td><td class="memItemRight" valign="bottom"><b>tree</b></td></tr>
|
||||
<tr class="separator:ad6ae1f39c3ce27fc009970e6aa3c022a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ad2032148b2443f5b6a0d01e4519d6898"><td class="memItemLeft" align="right" valign="top"><a id="ad2032148b2443f5b6a0d01e4519d6898"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a></td></tr>
|
||||
<tr class="memdesc:ad2032148b2443f5b6a0d01e4519d6898"><td class="mdescLeft"> </td><td class="mdescRight">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element of the corresponding list contains the index of its parent. The i-th element of the list is an index of the (2^i)-th ancestor of the vertex. <br /></td></tr>
|
||||
<tr class="separator:ad2032148b2443f5b6a0d01e4519d6898"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-methods"></a>
|
||||
Protected Member Functions</h2></td></tr>
|
||||
<tr class="memitem:a42589cc39d6bbff6c997152f1b96e356"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">populate_up</a> ()</td></tr>
|
||||
<tr class="separator:a42589cc39d6bbff6c997152f1b96e356"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>A structure that holds a rooted tree and allow for effecient queries of the lowest common ancestor of two given vertices in the tree. </p>
|
||||
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
|
||||
<a id="a80825a4fd4c41860b689d253dd2c8e93"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a80825a4fd4c41860b689d253dd2c8e93">◆ </a></span>LowestCommonAncestor()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">graph::LowestCommonAncestor::LowestCommonAncestor </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> & </td>
|
||||
<td class="paramname"><em>tree_</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>Stores the tree and precomputs "up lifts". </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">tree_</td><td>rooted tree. </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  : tree(tree_) {</div>
|
||||
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">populate_up</a>();</div>
|
||||
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.svg" width="100%" height="416"><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>
|
||||
<h2 class="groupheader">Member Function Documentation</h2>
|
||||
<a id="a60151e19512b48cc0b14ea121df00488"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a60151e19512b48cc0b14ea121df00488">◆ </a></span>lowest_common_ancestor()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">int graph::LowestCommonAncestor::lowest_common_ancestor </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>u</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>v</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td> const</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>Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid indices of vertices. Iterativelly modifies ("lifts") u an v until it finnds their lowest common ancestor. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">u</td><td>index of one of the queried vertex </td></tr>
|
||||
<tr><td class="paramname">v</td><td>index of the other queried vertex </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>index of the vertex which is the lowet common ancestor of u and v </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  {</div>
|
||||
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// Ensure u is the deeper (higher level) of the two vertices</span></div>
|
||||
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">if</span> (tree.<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[v] > tree.<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[u]) {</div>
|
||||
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(u, v);</div>
|
||||
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</div>
|
||||
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  </div>
|
||||
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// "Lift" u to the same level as v.</span></div>
|
||||
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordtype">int</span> level_diff = tree.<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[u] - tree.<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[v];</div>
|
||||
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; (1 << i) <= level_diff; ++i) {</div>
|
||||
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">if</span> (level_diff & (1 << i)) {</div>
|
||||
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  u = <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[u][i];</div>
|
||||
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</div>
|
||||
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div>
|
||||
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  assert(tree.<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[u] == tree.<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[v]);</div>
|
||||
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  </div>
|
||||
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">if</span> (u == v) {</div>
|
||||
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">return</span> u;</div>
|
||||
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div>
|
||||
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  </div>
|
||||
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// "Lift" u and v to their 2^i th ancestor if they are different</span></div>
|
||||
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(<a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[u].size()) - 1; i >= 0; --i) {</div>
|
||||
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[u][i] != <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[v][i]) {</div>
|
||||
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  u = <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[u][i];</div>
|
||||
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  v = <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[v][i];</div>
|
||||
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
|
||||
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  }</div>
|
||||
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  </div>
|
||||
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// As we regressed u an v such that they cannot further be lifted so</span></div>
|
||||
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// that their ancestor would be different, the only logical</span></div>
|
||||
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// consequence is that their parent is the sought answer.</span></div>
|
||||
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  assert(<a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[u][0] == <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[v][0]);</div>
|
||||
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">return</span> <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[u][0];</div>
|
||||
<div class="line"><a name="l00196"></a><span class="lineno"> 196</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="../../d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.svg" width="347" height="52"><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="a42589cc39d6bbff6c997152f1b96e356"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a42589cc39d6bbff6c997152f1b96e356">◆ </a></span>populate_up()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void graph::LowestCommonAncestor::populate_up </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Populate the "up" structure. See above. </p>
|
||||
<div class="fragment"><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  {</div>
|
||||
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(tree.<a class="code" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a>());</div>
|
||||
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vertex = 0; vertex < tree.<a class="code" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a>(); ++vertex) {</div>
|
||||
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[vertex].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(tree.<a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[vertex]);</div>
|
||||
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div>
|
||||
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = 0; (1 << level) < tree.<a class="code" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a>(); ++level) {</div>
|
||||
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vertex = 0; vertex < tree.<a class="code" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a>(); ++vertex) {</div>
|
||||
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// up[vertex][level + 1] = 2^(level + 1) th ancestor of vertex =</span></div>
|
||||
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">// = 2^level th ancestor of 2^level th ancestor of vertex =</span></div>
|
||||
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// = 2^level th ancestor of up[vertex][level]</span></div>
|
||||
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[vertex].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[<a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a>[vertex][level]][level]);</div>
|
||||
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  }</div>
|
||||
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div>
|
||||
<div class="line"><a name="l00225"></a><span class="lineno"> 225</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="../../d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.svg" width="587" height="155"><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 file:<ul>
|
||||
<li>graph/<a class="el" href="../../de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector< int > level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:105</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a42589cc39d6bbff6c997152f1b96e356"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor::populate_up</a></div><div class="ttdeci">void populate_up()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:212</div></div>
|
||||
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector< int > parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:103</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 class="ttc" id="aclassgraph_1_1_graph_html_ae2f6992450faa2c3da93edea0818869a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:73</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_ad2032148b2443f5b6a0d01e4519d6898"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">graph::LowestCommonAncestor::up</a></div><div class="ttdeci">std::vector< std::vector< int > > up</div><div class="ttdoc">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:206</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dd/d9b/classgraph.html">graph</a></li><li class="navelem"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a></li>
|
||||
<li class="footer">Generated by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
8
d9/d23/classgraph_1_1_lowest_common_ancestor.js
Normal file
8
d9/d23/classgraph_1_1_lowest_common_ancestor.js
Normal file
@@ -0,0 +1,8 @@
|
||||
var classgraph_1_1_lowest_common_ancestor =
|
||||
[
|
||||
[ "LowestCommonAncestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93", null ],
|
||||
[ "lowest_common_ancestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488", null ],
|
||||
[ "populate_up", "d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356", null ],
|
||||
[ "tree", "d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad6ae1f39c3ce27fc009970e6aa3c022a", null ],
|
||||
[ "up", "d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898", null ]
|
||||
];
|
||||
@@ -0,0 +1,7 @@
|
||||
<map id="graph::LowestCommonAncestor::populate_up" name="graph::LowestCommonAncestor::populate_up">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,64,215,105"/>
|
||||
<area shape="rect" id="node2" href="$dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a" title=" " alt="" coords="266,5,414,47"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="263,71,417,98"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="277,122,403,149"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="465,13,581,39"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
832cdd79cd298ba0f0e23035bd473a9f
|
||||
@@ -0,0 +1,84 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::LowestCommonAncestor::populate_up Pages: 1 -->
|
||||
<svg width="440pt" height="116pt"
|
||||
viewBox="0.00 0.00 440.00 115.50" 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 111.5)">
|
||||
<title>graph::LowestCommonAncestor::populate_up</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-111.5 436,-111.5 436,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-33 0,-63 157,-63 157,-33 0,-33"/>
|
||||
<text text-anchor="start" x="8" y="-51" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
|
||||
<text text-anchor="middle" x="78.5" y="-40" font-family="Helvetica,sans-Serif" font-size="10.00">::populate_up</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="195.5,-77 195.5,-107 306.5,-107 306.5,-77 195.5,-77"/>
|
||||
<text text-anchor="start" x="203.5" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
|
||||
<text text-anchor="middle" x="251" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M137.7,-63.02C152.97,-66.96 169.54,-71.24 185.14,-75.26"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="184.67,-78.75 195.22,-77.86 186.42,-71.98 184.67,-78.75"/>
|
||||
</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/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="193,-38.5 193,-57.5 309,-57.5 309,-38.5 193,-38.5"/>
|
||||
<text text-anchor="middle" x="251" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M157.27,-48C165.82,-48 174.48,-48 182.88,-48"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="183,-51.5 193,-48 183,-44.5 183,-51.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/container/vector/resize.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="203.5,-0.5 203.5,-19.5 298.5,-19.5 298.5,-0.5 203.5,-0.5"/>
|
||||
<text text-anchor="middle" x="251" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M146.89,-32.98C163.61,-29.25 181.29,-25.31 197.2,-21.77"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="198.37,-25.09 207.37,-19.5 196.85,-18.26 198.37,-25.09"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="345,-82.5 345,-101.5 432,-101.5 432,-82.5 345,-82.5"/>
|
||||
<text text-anchor="middle" x="388.5" y="-89.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M306.72,-92C315.9,-92 325.41,-92 334.55,-92"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="334.66,-95.5 344.66,-92 334.66,-88.5 334.66,-95.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 4.1 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="graph::LowestCommonAncestor::lowest_common_ancestor" name="graph::LowestCommonAncestor::lowest_common_ancestor">
|
||||
<area shape="rect" id="node1" title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i..." alt="" coords="5,5,215,47"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="263,13,341,39"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
6160ae8a35a7fff40af895010fdb61e2
|
||||
@@ -0,0 +1,38 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::LowestCommonAncestor::lowest_common_ancestor Pages: 1 -->
|
||||
<svg width="260pt" height="39pt"
|
||||
viewBox="0.00 0.00 260.00 39.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 35)">
|
||||
<title>graph::LowestCommonAncestor::lowest_common_ancestor</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 256,-35 256,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 157,-30.5 157,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
|
||||
<text text-anchor="middle" x="78.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::lowest_common_ancestor</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="193,-6 193,-25 252,-25 252,-6 193,-6"/>
|
||||
<text text-anchor="middle" x="222.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M157.15,-15.5C165.97,-15.5 174.66,-15.5 182.65,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="182.72,-19 192.72,-15.5 182.72,-12 182.72,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.9 KiB |
@@ -0,0 +1,8 @@
|
||||
<map id="graph::LowestCommonAncestor::LowestCommonAncestor" name="graph::LowestCommonAncestor::LowestCommonAncestor">
|
||||
<area shape="rect" id="node1" title="Stores the tree and precomputs "up lifts"." alt="" coords="5,64,215,105"/>
|
||||
<area shape="rect" id="node2" href="$d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356" title=" " alt="" coords="263,64,472,105"/>
|
||||
<area shape="rect" id="node3" href="$dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a" title=" " alt="" coords="523,5,671,47"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="520,71,675,98"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="534,122,661,149"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="723,13,839,39"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
80f5cb55c94a6507710a932c448232ff
|
||||
@@ -0,0 +1,188 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::LowestCommonAncestor::LowestCommonAncestor Pages: 1 -->
|
||||
<!--zoomable 116 -->
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
|
||||
<style type="text/css"><![CDATA[
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="text/javascript"><![CDATA[
|
||||
var edges = document.getElementsByTagName('g');
|
||||
if (edges && edges.length) {
|
||||
for (var i=0;i<edges.length;i++) {
|
||||
if (edges[i].id.substr(0,4)=='edge') {
|
||||
edges[i].setAttribute('class','edge');
|
||||
}
|
||||
}
|
||||
}
|
||||
]]></script>
|
||||
<defs>
|
||||
<circle id="rim" cx="0" cy="0" r="7"/>
|
||||
<circle id="rim2" cx="0" cy="0" r="3.5"/>
|
||||
<g id="zoomPlus">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
|
||||
</use>
|
||||
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="zoomMin">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
|
||||
</use>
|
||||
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="dirArrow">
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="resetDef">
|
||||
<use xlink:href="#rim2" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
|
||||
</use>
|
||||
</g>
|
||||
</defs>
|
||||
|
||||
<script type="text/javascript">
|
||||
var viewWidth = 633;
|
||||
var viewHeight = 116;
|
||||
var sectionId = 'dynsection-1';
|
||||
</script>
|
||||
<script xlink:href="../../svgpan.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="viewport">
|
||||
<title>graph::LowestCommonAncestor::LowestCommonAncestor</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-111.5 629,-111.5 629,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Stores the tree and precomputs "up lifts".">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-33 0,-63 157,-63 157,-33 0,-33"/>
|
||||
<text text-anchor="start" x="8" y="-51" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
|
||||
<text text-anchor="middle" x="78.5" y="-40" font-family="Helvetica,sans-Serif" font-size="10.00">::LowestCommonAncestor</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="193,-33 193,-63 350,-63 350,-33 193,-33"/>
|
||||
<text text-anchor="start" x="201" y="-51" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
|
||||
<text text-anchor="middle" x="271.5" y="-40" font-family="Helvetica,sans-Serif" font-size="10.00">::populate_up</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M157.19,-48C165.65,-48 174.31,-48 182.88,-48"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="182.88,-51.5 192.88,-48 182.88,-44.5 182.88,-51.5"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="388.5,-77 388.5,-107 499.5,-107 499.5,-77 388.5,-77"/>
|
||||
<text text-anchor="start" x="396.5" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
|
||||
<text text-anchor="middle" x="444" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M330.7,-63.02C345.97,-66.96 362.54,-71.24 378.14,-75.26"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="377.67,-78.75 388.22,-77.86 379.42,-71.98 377.67,-78.75"/>
|
||||
</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/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="386,-38.5 386,-57.5 502,-57.5 502,-38.5 386,-38.5"/>
|
||||
<text text-anchor="middle" x="444" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M350.27,-48C358.82,-48 367.48,-48 375.88,-48"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="376,-51.5 386,-48 376,-44.5 376,-51.5"/>
|
||||
</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/container/vector/resize.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="396.5,-0.5 396.5,-19.5 491.5,-19.5 491.5,-0.5 396.5,-0.5"/>
|
||||
<text text-anchor="middle" x="444" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node2->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M339.89,-32.98C356.61,-29.25 374.29,-25.31 390.2,-21.77"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="391.37,-25.09 400.37,-19.5 389.85,-18.26 391.37,-25.09"/>
|
||||
</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/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="538,-82.5 538,-101.5 625,-101.5 625,-82.5 538,-82.5"/>
|
||||
<text text-anchor="middle" x="581.5" y="-89.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M499.72,-92C508.9,-92 518.41,-92 527.55,-92"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="527.66,-95.5 537.66,-92 527.66,-88.5 527.66,-95.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
<g id="navigator" transform="translate(0 0)" fill="#404254">
|
||||
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
|
||||
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
|
||||
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
|
||||
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
|
||||
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
</g>
|
||||
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
|
||||
<g id="arrow_out" transform="scale(0.3 0.3)">
|
||||
<a xlink:href="classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph_org.svg" target="_base">
|
||||
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
|
||||
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
|
||||
<path id="arrow"
|
||||
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
|
||||
style="fill:#404040;"/>
|
||||
</a>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 10 KiB |
@@ -0,0 +1,100 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::LowestCommonAncestor::LowestCommonAncestor Pages: 1 -->
|
||||
<svg width="633pt" height="116pt"
|
||||
viewBox="0.00 0.00 633.00 115.50" 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 111.5)">
|
||||
<title>graph::LowestCommonAncestor::LowestCommonAncestor</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-111.5 629,-111.5 629,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Stores the tree and precomputs "up lifts".">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-33 0,-63 157,-63 157,-33 0,-33"/>
|
||||
<text text-anchor="start" x="8" y="-51" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
|
||||
<text text-anchor="middle" x="78.5" y="-40" font-family="Helvetica,sans-Serif" font-size="10.00">::LowestCommonAncestor</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="193,-33 193,-63 350,-63 350,-33 193,-33"/>
|
||||
<text text-anchor="start" x="201" y="-51" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
|
||||
<text text-anchor="middle" x="271.5" y="-40" font-family="Helvetica,sans-Serif" font-size="10.00">::populate_up</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M157.19,-48C165.65,-48 174.31,-48 182.88,-48"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="182.88,-51.5 192.88,-48 182.88,-44.5 182.88,-51.5"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="388.5,-77 388.5,-107 499.5,-107 499.5,-77 388.5,-77"/>
|
||||
<text text-anchor="start" x="396.5" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
|
||||
<text text-anchor="middle" x="444" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M330.7,-63.02C345.97,-66.96 362.54,-71.24 378.14,-75.26"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="377.67,-78.75 388.22,-77.86 379.42,-71.98 377.67,-78.75"/>
|
||||
</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/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="386,-38.5 386,-57.5 502,-57.5 502,-38.5 386,-38.5"/>
|
||||
<text text-anchor="middle" x="444" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M350.27,-48C358.82,-48 367.48,-48 375.88,-48"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="376,-51.5 386,-48 376,-44.5 376,-51.5"/>
|
||||
</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/container/vector/resize.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="396.5,-0.5 396.5,-19.5 491.5,-19.5 491.5,-0.5 396.5,-0.5"/>
|
||||
<text text-anchor="middle" x="444" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node2->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M339.89,-32.98C356.61,-29.25 374.29,-25.31 390.2,-21.77"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="391.37,-25.09 400.37,-19.5 389.85,-18.26 391.37,-25.09"/>
|
||||
</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/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="538,-82.5 538,-101.5 625,-101.5 625,-82.5 538,-82.5"/>
|
||||
<text text-anchor="middle" x="581.5" y="-89.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M499.72,-92C508.9,-92 518.41,-92 527.55,-92"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="527.66,-95.5 537.66,-92 527.66,-88.5 527.66,-95.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 5.0 KiB |
@@ -71,7 +71,7 @@ $(function() {
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('dd/df4/structlca.html','../../'); initResizable(); });
|
||||
$(document).ready(function(){initNavTree('d9/d23/classgraph_1_1_lowest_common_ancestor.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
@@ -91,21 +91,17 @@ $(document).ready(function(){initNavTree('dd/df4/structlca.html','../../'); init
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle">
|
||||
<div class="title">lca Member List</div> </div>
|
||||
<div class="title">graph::LowestCommonAncestor Member List</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../dd/df4/structlca.html">lca</a>, including all inherited members.</p>
|
||||
<p>This is the complete list of members for <a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>adj</b> (defined in <a class="el" href="../../dd/df4/structlca.html">lca</a>)</td><td class="entry"><a class="el" href="../../dd/df4/structlca.html">lca</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>build</b>() (defined in <a class="el" href="../../dd/df4/structlca.html">lca</a>)</td><td class="entry"><a class="el" href="../../dd/df4/structlca.html">lca</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>dfs</b>(int node, int par) (defined in <a class="el" href="../../dd/df4/structlca.html">lca</a>)</td><td class="entry"><a class="el" href="../../dd/df4/structlca.html">lca</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>lca</b>(int n_) (defined in <a class="el" href="../../dd/df4/structlca.html">lca</a>)</td><td class="entry"><a class="el" href="../../dd/df4/structlca.html">lca</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>level</b> (defined in <a class="el" href="../../dd/df4/structlca.html">lca</a>)</td><td class="entry"><a class="el" href="../../dd/df4/structlca.html">lca</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>n</b> (defined in <a class="el" href="../../dd/df4/structlca.html">lca</a>)</td><td class="entry"><a class="el" href="../../dd/df4/structlca.html">lca</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>query</b>(int u, int v) (defined in <a class="el" href="../../dd/df4/structlca.html">lca</a>)</td><td class="entry"><a class="el" href="../../dd/df4/structlca.html">lca</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>up</b> (defined in <a class="el" href="../../dd/df4/structlca.html">lca</a>)</td><td class="entry"><a class="el" href="../../dd/df4/structlca.html">lca</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>verify</b>() (defined in <a class="el" href="../../dd/df4/structlca.html">lca</a>)</td><td class="entry"><a class="el" href="../../dd/df4/structlca.html">lca</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">lowest_common_ancestor</a>(int u, int v) const</td><td class="entry"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">LowestCommonAncestor</a>(const RootedTree &tree_)</td><td class="entry"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</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="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">populate_up</a>()</td><td class="entry"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>tree</b> (defined in <a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a>)</td><td class="entry"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></td><td class="entry"></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">up</a></td><td class="entry"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></td><td class="entry"></td></tr>
|
||||
</table></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
114
db/d1e/classgraph_1_1_graph-members.html
Normal file
114
db/d1e/classgraph_1_1_graph-members.html
Normal file
@@ -0,0 +1,114 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('dc/d61/classgraph_1_1_graph.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">graph::Graph Member List</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">Graph</a>(size_t N, const std::vector< std::pair< int, int > > &undirected_edges)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">neighbors</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td><td class="entry"></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a>() const</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</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="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
8
db/d8e/lowest__common__ancestor_8cpp__incl.map
Normal file
8
db/d8e/lowest__common__ancestor_8cpp__incl.map
Normal file
@@ -0,0 +1,8 @@
|
||||
<map id="graph/lowest_common_ancestor.cpp" name="graph/lowest_common_ancestor.cpp">
|
||||
<area shape="rect" id="node1" title="Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary l..." alt="" coords="131,5,285,47"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,95,77,121"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="101,95,155,121"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="179,95,237,121"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="262,95,319,121"/>
|
||||
<area shape="rect" id="node6" title=" " alt="" coords="343,95,409,121"/>
|
||||
</map>
|
||||
1
db/d8e/lowest__common__ancestor_8cpp__incl.md5
Normal file
1
db/d8e/lowest__common__ancestor_8cpp__incl.md5
Normal file
@@ -0,0 +1 @@
|
||||
feebcb6a27d1da6fc5957bddbf9dee90
|
||||
98
db/d8e/lowest__common__ancestor_8cpp__incl.svg
Normal file
98
db/d8e/lowest__common__ancestor_8cpp__incl.svg
Normal file
@@ -0,0 +1,98 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph/lowest_common_ancestor.cpp Pages: 1 -->
|
||||
<svg width="311pt" height="95pt"
|
||||
viewBox="0.00 0.00 310.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>graph/lowest_common_ancestor.cpp</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 306.5,-91 306.5,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary l...">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="94.5,-56.5 94.5,-86.5 209.5,-86.5 209.5,-56.5 94.5,-56.5"/>
|
||||
<text text-anchor="start" x="102.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph/lowest_common</text>
|
||||
<text text-anchor="middle" x="152" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_ancestor.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 54,-19.5 54,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M122.38,-56.4C101.78,-46.59 74.52,-33.62 54.42,-24.05"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="55.72,-20.8 45.19,-19.66 52.71,-27.12 55.72,-20.8"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="72,-0.5 72,-19.5 112,-19.5 112,-0.5 72,-0.5"/>
|
||||
<text text-anchor="middle" x="92" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">utility</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M137.78,-56.4C128.79,-47.49 117.16,-35.95 107.87,-26.74"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="110.3,-24.21 100.73,-19.66 105.37,-29.18 110.3,-24.21"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="130,-0.5 130,-19.5 174,-19.5 174,-0.5 130,-0.5"/>
|
||||
<text text-anchor="middle" x="152" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M152,-56.4C152,-48.47 152,-38.46 152,-29.86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="155.5,-29.66 152,-19.66 148.5,-29.66 155.5,-29.66"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="192.5,-0.5 192.5,-19.5 235.5,-19.5 235.5,-0.5 192.5,-0.5"/>
|
||||
<text text-anchor="middle" x="214" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M166.69,-56.4C175.98,-47.49 188,-35.95 197.6,-26.74"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="200.19,-29.11 204.98,-19.66 195.34,-24.06 200.19,-29.11"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="253.5,-0.5 253.5,-19.5 302.5,-19.5 302.5,-0.5 253.5,-0.5"/>
|
||||
<text text-anchor="middle" x="278" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M181.86,-56.4C202.62,-46.59 230.1,-33.62 250.36,-24.05"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="252.12,-27.09 259.67,-19.66 249.13,-20.76 252.12,-27.09"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 4.3 KiB |
245
dc/d61/classgraph_1_1_graph.html
Normal file
245
dc/d61/classgraph_1_1_graph.html
Normal file
@@ -0,0 +1,245 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: graph::Graph 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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('dc/d61/classgraph_1_1_graph.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> |
|
||||
<a href="#pub-attribs">Public Attributes</a> |
|
||||
<a href="../../db/d1e/classgraph_1_1_graph-members.html">List of all members</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">graph::Graph Class Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<div class="dynheader">
|
||||
Inheritance diagram for graph::Graph:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dc1/classgraph_1_1_graph__inherit__graph.svg" width="142" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for graph::Graph:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d08/classgraph_1_1_graph__coll__graph.svg" width="170" height="142"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
||||
Public Member Functions</h2></td></tr>
|
||||
<tr class="memitem:a34414f67c2e3ea89774839b36b1575f8"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">Graph</a> (size_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< int, int > > &undirected_edges)</td></tr>
|
||||
<tr class="memdesc:a34414f67c2e3ea89774839b36b1575f8"><td class="mdescLeft"> </td><td class="mdescRight">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices. <a href="../../dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">More...</a><br /></td></tr>
|
||||
<tr class="separator:a34414f67c2e3ea89774839b36b1575f8"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae2f6992450faa2c3da93edea0818869a"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">number_of_vertices</a> () const</td></tr>
|
||||
<tr class="separator:ae2f6992450faa2c3da93edea0818869a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
|
||||
Public Attributes</h2></td></tr>
|
||||
<tr class="memitem:aee72d7dd4778097a6d852c659de8fe58"><td class="memItemLeft" align="right" valign="top"><a id="aee72d7dd4778097a6d852c659de8fe58"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">neighbors</a></td></tr>
|
||||
<tr class="memdesc:aee72d7dd4778097a6d852c659de8fe58"><td class="mdescLeft"> </td><td class="mdescRight">for each vertex it stores a list indicies of its neighbors <br /></td></tr>
|
||||
<tr class="separator:aee72d7dd4778097a6d852c659de8fe58"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Class for representing a graph as an adjacency list. Its vertices are indexed 0, 1, ..., N - 1. </p>
|
||||
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
|
||||
<a id="a34414f67c2e3ea89774839b36b1575f8"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a34414f67c2e3ea89774839b36b1575f8">◆ </a></span>Graph()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">graph::Graph::Graph </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">size_t </td>
|
||||
<td class="paramname"><em>N</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< int, int > > & </td>
|
||||
<td class="paramname"><em>undirected_edges</em> </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>Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">N</td><td>number of vertices in the graph </td></tr>
|
||||
<tr><td class="paramname">undirected_edges</td><td>list of graph's undirected edges </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  {</div>
|
||||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">neighbors</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(N);</div>
|
||||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> &edge : undirected_edges) {</div>
|
||||
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">neighbors</a>[edge.first].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(edge.second);</div>
|
||||
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">neighbors</a>[edge.second].<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(edge.first);</div>
|
||||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  }</div>
|
||||
<div class="line"><a name="l00067"></a><span class="lineno"> 67</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="../../dc/d61/classgraph_1_1_graph_a34414f67c2e3ea89774839b36b1575f8_cgraph.svg" width="354" height="88"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<h2 class="groupheader">Member Function Documentation</h2>
|
||||
<a id="ae2f6992450faa2c3da93edea0818869a"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae2f6992450faa2c3da93edea0818869a">◆ </a></span>number_of_vertices()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">int graph::Graph::number_of_vertices </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td> const</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>Function to get the number of vertices in the graph </p><dl class="section return"><dt>Returns</dt><dd>the number of vertices in the graph. </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  {</div>
|
||||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span> <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">neighbors</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</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="../../dc/d61/classgraph_1_1_graph_ae2f6992450faa2c3da93edea0818869a_cgraph.svg" width="323" height="52"><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 file:<ul>
|
||||
<li>graph/<a class="el" href="../../de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_aee72d7dd4778097a6d852c659de8fe58"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector< std::vector< int > > neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:78</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dd/d9b/classgraph.html">graph</a></li><li class="navelem"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a></li>
|
||||
<li class="footer">Generated by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
6
dc/d61/classgraph_1_1_graph.js
Normal file
6
dc/d61/classgraph_1_1_graph.js
Normal file
@@ -0,0 +1,6 @@
|
||||
var classgraph_1_1_graph =
|
||||
[
|
||||
[ "Graph", "dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8", null ],
|
||||
[ "number_of_vertices", "dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a", null ],
|
||||
[ "neighbors", "dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58", null ]
|
||||
];
|
||||
@@ -0,0 +1,5 @@
|
||||
<map id="graph::Graph::Graph" name="graph::Graph::Graph">
|
||||
<area shape="rect" id="node1" title="Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid v..." alt="" coords="5,31,145,57"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="193,5,348,32"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="207,56,334,83"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
e538c988bc33576564824cdee89b0e2a
|
||||
@@ -0,0 +1,52 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::Graph::Graph Pages: 1 -->
|
||||
<svg width="265pt" height="66pt"
|
||||
viewBox="0.00 0.00 265.00 66.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 62)">
|
||||
<title>graph::Graph::Graph</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-62 261,-62 261,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid v...">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-19.5 0,-38.5 105,-38.5 105,-19.5 0,-19.5"/>
|
||||
<text text-anchor="middle" x="52.5" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::Graph</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="141,-38.5 141,-57.5 257,-57.5 257,-38.5 141,-38.5"/>
|
||||
<text text-anchor="middle" x="199" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M105.26,-35.81C113.52,-36.89 122.18,-38.03 130.74,-39.16"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="130.35,-42.63 140.72,-40.47 131.26,-35.69 130.35,-42.63"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="151.5,-0.5 151.5,-19.5 246.5,-19.5 246.5,-0.5 151.5,-0.5"/>
|
||||
<text text-anchor="middle" x="199" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M105.26,-22.19C116.91,-20.66 129.33,-19.03 141.18,-17.47"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="141.95,-20.9 151.4,-16.13 141.03,-13.96 141.95,-20.9"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.5 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="graph::Graph::number_of_vertices" name="graph::Graph::number_of_vertices">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,153,47"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="201,13,317,39"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
f53c0fb8b60b21d44b94c1e93215a573
|
||||
@@ -0,0 +1,38 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::Graph::number_of_vertices Pages: 1 -->
|
||||
<svg width="242pt" height="39pt"
|
||||
viewBox="0.00 0.00 242.00 39.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 35)">
|
||||
<title>graph::Graph::number_of_vertices</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 238,-35 238,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 111,-30.5 111,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
|
||||
<text text-anchor="middle" x="55.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="147,-6 147,-25 234,-25 234,-6 147,-6"/>
|
||||
<text text-anchor="middle" x="190.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M111.36,-15.5C119.81,-15.5 128.51,-15.5 136.91,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="136.95,-19 146.95,-15.5 136.95,-12 136.95,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.8 KiB |
@@ -91,6 +91,7 @@ $(document).ready(function(){initNavTree('dd/d9b/classgraph.html','../../'); ini
|
||||
|
||||
<div class="header">
|
||||
<div class="summary">
|
||||
<a href="#nested-classes">Classes</a> |
|
||||
<a href="#pub-methods">Public Member Functions</a> |
|
||||
<a href="#pri-methods">Private Member Functions</a> |
|
||||
<a href="#pri-attribs">Private Attributes</a> |
|
||||
@@ -106,6 +107,15 @@ Collaboration diagram for graph:</div>
|
||||
</div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
|
||||
Classes</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
||||
Public Member Functions</h2></td></tr>
|
||||
<tr class="memitem:a6da44f9820d3b7bae2f0f74bc149c27e"><td class="memItemLeft" align="right" valign="top"><a id="a6da44f9820d3b7bae2f0f74bc149c27e"></a>
|
||||
|
||||
@@ -1,5 +1,8 @@
|
||||
var classgraph =
|
||||
[
|
||||
[ "Graph", "dc/d61/classgraph_1_1_graph.html", "dc/d61/classgraph_1_1_graph" ],
|
||||
[ "LowestCommonAncestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html", "d9/d23/classgraph_1_1_lowest_common_ancestor" ],
|
||||
[ "RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html", "d0/d58/classgraph_1_1_rooted_tree" ],
|
||||
[ "graph", "dd/d9b/classgraph.html#a6da44f9820d3b7bae2f0f74bc149c27e", null ],
|
||||
[ "addEdge", "dd/d9b/classgraph.html#a35c12fba596d8bb48b1877b128c4ba6d", null ],
|
||||
[ "depth_first_search", "dd/d9b/classgraph.html#a135921a59082b669678b029b301b8a1c", null ],
|
||||
|
||||
4
dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.map
Normal file
4
dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.map
Normal file
@@ -0,0 +1,4 @@
|
||||
<map id="graph::RootedTree" name="graph::RootedTree">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,80,136,107"/>
|
||||
<area shape="rect" id="node2" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="22,5,119,32"/>
|
||||
</map>
|
||||
1
dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.md5
Normal file
1
dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.md5
Normal file
@@ -0,0 +1 @@
|
||||
872f17ab54284495ce1b233a79b27b93
|
||||
37
dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.svg
Normal file
37
dd/d9b/classgraph_1_1_rooted_tree__inherit__graph.svg
Normal 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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::RootedTree Pages: 1 -->
|
||||
<svg width="106pt" height="84pt"
|
||||
viewBox="0.00 0.00 106.00 84.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 80)">
|
||||
<title>graph::RootedTree</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 102,-80 102,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 98,-19.5 98,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="49" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="12.5,-56.5 12.5,-75.5 85.5,-75.5 85.5,-56.5 12.5,-56.5"/>
|
||||
<text text-anchor="middle" x="49" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M49,-45.8C49,-36.91 49,-26.78 49,-19.75"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="45.5,-46.08 49,-56.08 52.5,-46.08 45.5,-46.08"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.6 KiB |
@@ -1,156 +0,0 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: lca Struct 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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('dd/df4/structlca.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> |
|
||||
<a href="#pub-attribs">Public Attributes</a> |
|
||||
<a href="../../d5/dc2/structlca-members.html">List of all members</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">lca Struct Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for lca:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dbd/structlca__coll__graph.svg" width="134" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
||||
Public Member Functions</h2></td></tr>
|
||||
<tr class="memitem:af1749a2effd0d3818ad6a788cdaa7428"><td class="memItemLeft" align="right" valign="top"><a id="af1749a2effd0d3818ad6a788cdaa7428"></a>
|
||||
 </td><td class="memItemRight" valign="bottom"><b>lca</b> (int n_)</td></tr>
|
||||
<tr class="separator:af1749a2effd0d3818ad6a788cdaa7428"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae4feede657d048b9ffa9e375d1c1f2f8"><td class="memItemLeft" align="right" valign="top"><a id="ae4feede657d048b9ffa9e375d1c1f2f8"></a>
|
||||
void </td><td class="memItemRight" valign="bottom"><b>verify</b> ()</td></tr>
|
||||
<tr class="separator:ae4feede657d048b9ffa9e375d1c1f2f8"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ab8e51315d17f1dea5f868789c7728991"><td class="memItemLeft" align="right" valign="top"><a id="ab8e51315d17f1dea5f868789c7728991"></a>
|
||||
void </td><td class="memItemRight" valign="bottom"><b>build</b> ()</td></tr>
|
||||
<tr class="separator:ab8e51315d17f1dea5f868789c7728991"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a32c8be06ce7ed44b643354f0c0ae47a6"><td class="memItemLeft" align="right" valign="top"><a id="a32c8be06ce7ed44b643354f0c0ae47a6"></a>
|
||||
void </td><td class="memItemRight" valign="bottom"><b>dfs</b> (int <a class="el" href="../../d5/da1/structnode.html">node</a>, int par)</td></tr>
|
||||
<tr class="separator:a32c8be06ce7ed44b643354f0c0ae47a6"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a7570bbb77f84fbc1b53927b0c9696511"><td class="memItemLeft" align="right" valign="top"><a id="a7570bbb77f84fbc1b53927b0c9696511"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>query</b> (int u, int v)</td></tr>
|
||||
<tr class="separator:a7570bbb77f84fbc1b53927b0c9696511"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
|
||||
Public Attributes</h2></td></tr>
|
||||
<tr class="memitem:a1db0a3861d8cb6b3da785646654adb1c"><td class="memItemLeft" align="right" valign="top"><a id="a1db0a3861d8cb6b3da785646654adb1c"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>n</b></td></tr>
|
||||
<tr class="separator:a1db0a3861d8cb6b3da785646654adb1c"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a14b42cdfa4ea593bc0d0571c513c0e23"><td class="memItemLeft" align="right" valign="top"><a id="a14b42cdfa4ea593bc0d0571c513c0e23"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>< int > </td><td class="memItemRight" valign="bottom"><b>adj</b> [N]</td></tr>
|
||||
<tr class="separator:a14b42cdfa4ea593bc0d0571c513c0e23"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae53b8b2b47baa0097c6e3186279b154b"><td class="memItemLeft" align="right" valign="top"><a id="ae53b8b2b47baa0097c6e3186279b154b"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>up</b> [LG][N]</td></tr>
|
||||
<tr class="separator:ae53b8b2b47baa0097c6e3186279b154b"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a2a794275904ce312065fea07e362aaef"><td class="memItemLeft" align="right" valign="top"><a id="a2a794275904ce312065fea07e362aaef"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>level</b> [N]</td></tr>
|
||||
<tr class="separator:a2a794275904ce312065fea07e362aaef"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<hr/>The documentation for this struct was generated from the following file:<ul>
|
||||
<li>graph/lca.cpp</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/df4/structlca.html">lca</a></li>
|
||||
<li class="footer">Generated by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,12 +0,0 @@
|
||||
var structlca =
|
||||
[
|
||||
[ "lca", "dd/df4/structlca.html#af1749a2effd0d3818ad6a788cdaa7428", null ],
|
||||
[ "build", "dd/df4/structlca.html#ab8e51315d17f1dea5f868789c7728991", null ],
|
||||
[ "dfs", "dd/df4/structlca.html#a32c8be06ce7ed44b643354f0c0ae47a6", null ],
|
||||
[ "query", "dd/df4/structlca.html#a7570bbb77f84fbc1b53927b0c9696511", null ],
|
||||
[ "verify", "dd/df4/structlca.html#ae4feede657d048b9ffa9e375d1c1f2f8", null ],
|
||||
[ "adj", "dd/df4/structlca.html#a14b42cdfa4ea593bc0d0571c513c0e23", null ],
|
||||
[ "level", "dd/df4/structlca.html#a2a794275904ce312065fea07e362aaef", null ],
|
||||
[ "n", "dd/df4/structlca.html#a1db0a3861d8cb6b3da785646654adb1c", null ],
|
||||
[ "up", "dd/df4/structlca.html#ae53b8b2b47baa0097c6e3186279b154b", null ]
|
||||
];
|
||||
262
de/dde/lowest__common__ancestor_8cpp.html
Normal file
262
de/dde/lowest__common__ancestor_8cpp.html
Normal file
@@ -0,0 +1,262 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: graph/lowest_common_ancestor.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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('de/dde/lowest__common__ancestor_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> |
|
||||
<a href="#namespaces">Namespaces</a> |
|
||||
<a href="#func-members">Functions</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">lowest_common_ancestor.cpp File Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting.
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <utility></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
<code>#include <queue></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for lowest_common_ancestor.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d8e/lowest__common__ancestor_8cpp__incl.svg" width="415" 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 name="nested-classes"></a>
|
||||
Classes</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:df/dce/namespacegraph"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
|
||||
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft"> </td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
|
||||
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting. </p>
|
||||
<p>Algorithm: <a href="https://cp-algorithms.com/graph/lca_binary_lifting.html">https://cp-algorithms.com/graph/lca_binary_lifting.html</a></p>
|
||||
<p>Complexity:</p><ul>
|
||||
<li>Precomputation: \(O(N \log N)\) where \(N\) is the number of vertices in the tree</li>
|
||||
<li>Query: \(O(\log N)\)</li>
|
||||
<li>Space: \(O(N \log N)\)</li>
|
||||
</ul>
|
||||
<p>Example: <br />
|
||||
Tree: </p><pre>
|
||||
_ 3 _
|
||||
/ | \
|
||||
1 6 4
|
||||
/ | / \ \
|
||||
7 5 2 8 0
|
||||
|
|
||||
9
|
||||
</pre><p><br />
|
||||
lowest_common_ancestor(7, 4) = 3 <br />
|
||||
lowest_common_ancestor(9, 6) = 6 <br />
|
||||
lowest_common_ancestor(0, 0) = 0 <br />
|
||||
lowest_common_ancestor(8, 2) = 6</p>
|
||||
<p>The query is symmetrical, therefore lowest_common_ancestor(x, y) = lowest_common_ancestor(y, x) </p>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">int main </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Main function </p>
|
||||
<div class="fragment"><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  {</div>
|
||||
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <a class="code" href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
|
||||
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00259"></a><span class="lineno"> 259</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="../../de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="544" height="52"><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="a483bb8ccf42aaf7375a83e91490eda1e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">◆ </a></span>tests()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">static void tests </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>Unit tests @rerturns none </p>
|
||||
<pre class="fragment"> _ 3 _
|
||||
/ | \
|
||||
1 6 4
|
||||
</pre><p> / | / \ \ 7 5 2 8 0 | 9</p>
|
||||
<div class="fragment"><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment"> /**</span></div>
|
||||
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment"> * _ 3 _</span></div>
|
||||
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment"> * / | \</span></div>
|
||||
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment"> * 1 6 4</span></div>
|
||||
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"> * / | / \ \</span></div>
|
||||
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment"> * 7 5 2 8 0</span></div>
|
||||
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment"> * |</span></div>
|
||||
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment"> * 9</span></div>
|
||||
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="comment"> */</span></div>
|
||||
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< std::pair<int, int></a> > edges = {</div>
|
||||
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  {7, 1}, {1, 5}, {1, 3}, {3, 6}, {6, 2}, {2, 9}, {6, 8}, {4, 3}, {0, 4}</div>
|
||||
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  };</div>
|
||||
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="code" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a> t(edges, 3);</div>
|
||||
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <a class="code" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a> lca(t);</div>
|
||||
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  assert(lca.lowest_common_ancestor(7, 4) == 3);</div>
|
||||
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  assert(lca.lowest_common_ancestor(9, 6) == 6);</div>
|
||||
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  assert(lca.lowest_common_ancestor(0, 0) == 0);</div>
|
||||
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  assert(lca.lowest_common_ancestor(8, 2) == 6);</div>
|
||||
<div class="line"><a name="l00253"></a><span class="lineno"> 253</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="../../de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="446" height="52"><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 -->
|
||||
<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 class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:84</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:145</div></div>
|
||||
<div class="ttc" id="alowest__common__ancestor_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:234</div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></li>
|
||||
<li class="footer">Generated by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
8
de/dde/lowest__common__ancestor_8cpp.js
Normal file
8
de/dde/lowest__common__ancestor_8cpp.js
Normal file
@@ -0,0 +1,8 @@
|
||||
var lowest__common__ancestor_8cpp =
|
||||
[
|
||||
[ "Graph", "dc/d61/classgraph_1_1_graph.html", "dc/d61/classgraph_1_1_graph" ],
|
||||
[ "RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html", "d0/d58/classgraph_1_1_rooted_tree" ],
|
||||
[ "LowestCommonAncestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html", "d9/d23/classgraph_1_1_lowest_common_ancestor" ],
|
||||
[ "main", "de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "tests", "de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
|
||||
];
|
||||
@@ -0,0 +1,5 @@
|
||||
<map id="tests" name="tests">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,13,56,39"/>
|
||||
<area shape="rect" id="node2" href="$d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488" title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i..." alt="" coords="104,5,313,47"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="361,13,440,39"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
2c0917ba04abf4d2d5a288943459e543
|
||||
@@ -0,0 +1,53 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: tests Pages: 1 -->
|
||||
<svg width="334pt" height="39pt"
|
||||
viewBox="0.00 0.00 334.00 39.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 35)">
|
||||
<title>tests</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 330,-35 330,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-6 0,-25 38,-25 38,-6 0,-6"/>
|
||||
<text text-anchor="middle" x="19" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488" target="_top" xlink:title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...">
|
||||
<polygon fill="white" stroke="black" points="74,-0.5 74,-30.5 231,-30.5 231,-0.5 74,-0.5"/>
|
||||
<text text-anchor="start" x="82" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
|
||||
<text text-anchor="middle" x="152.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::lowest_common_ancestor</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.01,-15.5C45.21,-15.5 54.08,-15.5 63.65,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="63.84,-19 73.84,-15.5 63.84,-12 63.84,-19"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="267,-6 267,-25 326,-25 326,-6 267,-6"/>
|
||||
<text text-anchor="middle" x="296.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M231.15,-15.5C239.97,-15.5 248.66,-15.5 256.65,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="256.72,-19 266.72,-15.5 256.72,-12 256.72,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.5 KiB |
@@ -0,0 +1,6 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,13,56,39"/>
|
||||
<area shape="rect" id="node2" href="$de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title=" " alt="" coords="104,13,155,39"/>
|
||||
<area shape="rect" id="node3" href="$d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488" title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i..." alt="" coords="203,5,412,47"/>
|
||||
<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="460,13,539,39"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
5ed5314781633e24099a48690e85f137
|
||||
@@ -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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="408pt" height="39pt"
|
||||
viewBox="0.00 0.00 408.00 39.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 35)">
|
||||
<title>main</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 404,-35 404,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-6 0,-25 38,-25 38,-6 0,-6"/>
|
||||
<text text-anchor="middle" x="19" y="-13" 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="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="74,-6 74,-25 112,-25 112,-6 74,-6"/>
|
||||
<text text-anchor="middle" x="93" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.17,-15.5C45.87,-15.5 55.03,-15.5 63.58,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="63.59,-19 73.59,-15.5 63.59,-12 63.59,-19"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488" target="_top" xlink:title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...">
|
||||
<polygon fill="white" stroke="black" points="148,-0.5 148,-30.5 305,-30.5 305,-0.5 148,-0.5"/>
|
||||
<text text-anchor="start" x="156" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
|
||||
<text text-anchor="middle" x="226.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::lowest_common_ancestor</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M112.01,-15.5C119.21,-15.5 128.08,-15.5 137.65,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="137.84,-19 147.84,-15.5 137.84,-12 137.84,-19"/>
|
||||
</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="341,-6 341,-25 400,-25 400,-6 341,-6"/>
|
||||
<text text-anchor="middle" x="370.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M305.15,-15.5C313.97,-15.5 322.66,-15.5 330.65,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="330.72,-19 340.72,-15.5 330.72,-12 330.72,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.2 KiB |
@@ -115,7 +115,7 @@ Include dependency graph for breadth_first_search.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:df/dce/namespacegraph"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
|
||||
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft"> </td><td class="mdescRight"><a class="el" href="../../da/d9a/class_graph.html">Graph</a> algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft"> </td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
|
||||
@@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('df/dce/namespacegraph.html','../../');
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p><a class="el" href="../../da/d9a/class_graph.html">Graph</a> algorithms.
|
||||
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms.
|
||||
<a href="../../df/dce/namespacegraph.html#details">More...</a></p>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
@@ -113,7 +113,7 @@ Functions</h2></td></tr>
|
||||
<tr class="separator:a618dce14b4883c20aace1d743d3a3f60"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p><a class="el" href="../../da/d9a/class_graph.html">Graph</a> algorithms. </p>
|
||||
<div class="textblock"><p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms. </p>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="adbe6cd1fd148173ce6a01669925d2d72"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#adbe6cd1fd148173ce6a01669925d2d72">◆ </a></span>add_directed_edge()</h2>
|
||||
|
||||
@@ -106,6 +106,9 @@ Files</h2></td></tr>
|
||||
<tr class="memitem:dd/d0c/hamiltons__cycle_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html">hamiltons_cycle.cpp</a></td></tr>
|
||||
<tr class="memdesc:dd/d0c/hamiltons__cycle_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">The implementation of <a href="https://en.wikipedia.org/wiki/Hamiltonian_path">Hamilton's cycle</a> dynamic solution for vertices number less than 20. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:de/dde/lowest__common__ancestor_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></td></tr>
|
||||
<tr class="memdesc:de/dde/lowest__common__ancestor_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
|
||||
@@ -2,5 +2,6 @@ var dir_12552d7fa429bf94a2e32e5cf39f7e69 =
|
||||
[
|
||||
[ "breadth_first_search.cpp", "df/d82/breadth__first__search_8cpp.html", "df/d82/breadth__first__search_8cpp" ],
|
||||
[ "connected_components.cpp", "df/ddd/connected__components_8cpp.html", "df/ddd/connected__components_8cpp" ],
|
||||
[ "hamiltons_cycle.cpp", "dd/d0c/hamiltons__cycle_8cpp.html", "dd/d0c/hamiltons__cycle_8cpp" ]
|
||||
[ "hamiltons_cycle.cpp", "dd/d0c/hamiltons__cycle_8cpp.html", "dd/d0c/hamiltons__cycle_8cpp" ],
|
||||
[ "lowest_common_ancestor.cpp", "de/dde/lowest__common__ancestor_8cpp.html", "de/dde/lowest__common__ancestor_8cpp" ]
|
||||
];
|
||||
@@ -127,6 +127,7 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
|
||||
<tr id="row_4_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/d82/breadth__first__search_8cpp.html" target="_self">breadth_first_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Breadth-first_search">Breadth First Search Algorithm (Breadth First Search)</a> </td></tr>
|
||||
<tr id="row_4_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/ddd/connected__components_8cpp.html" target="_self">connected_components.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Component_(graph_theory)">Graph Connected Components (Connected Components)</a> </td></tr>
|
||||
<tr id="row_4_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html" target="_self">hamiltons_cycle.cpp</a></td><td class="desc">The implementation of <a href="https://en.wikipedia.org/wiki/Hamiltonian_path">Hamilton's cycle</a> dynamic solution for vertices number less than 20 </td></tr>
|
||||
<tr id="row_4_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/dde/lowest__common__ancestor_8cpp.html" target="_self">lowest_common_ancestor.cpp</a></td><td class="desc">Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting </td></tr>
|
||||
<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">►</span><span id="img_5_" class="iconfclosed" onclick="toggleFolder('5_')"> </span><a class="el" href="dir_e79632891301b850df87e9c0030293fa.html" target="_self">graphics</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;"> </span><span class="icondoc"></span><a class="el" href="da/d77/spirograph_8cpp.html" target="_self">spirograph.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Spirograph">Spirograph</a> </td></tr>
|
||||
<tr id="row_6_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">►</span><span id="img_6_" class="iconfclosed" onclick="toggleFolder('6_')"> </span><a class="el" href="dir_ece9b94c107bbaa1dd68197a8c9983b9.html" target="_self">hashing</a></td><td class="desc"></td></tr>
|
||||
|
||||
@@ -286,7 +286,7 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
: <a class="el" href="dd/d9b/classgraph.html#a6da44f9820d3b7bae2f0f74bc149c27e">graph</a>
|
||||
</li>
|
||||
<li>Graph()
|
||||
: <a class="el" href="da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">Graph</a>
|
||||
: <a class="el" href="dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">graph::Graph</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
@@ -367,6 +367,13 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
</li>
|
||||
<li>level
|
||||
: <a class="el" href="d1/d46/classdata__structure_1_1_skip_list.html#ae0c022174510fd9ca1b84d8e996cd1a5">data_structure::SkipList</a>
|
||||
, <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree</a>
|
||||
</li>
|
||||
<li>lowest_common_ancestor()
|
||||
: <a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">graph::LowestCommonAncestor</a>
|
||||
</li>
|
||||
<li>LowestCommonAncestor()
|
||||
: <a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">graph::LowestCommonAncestor</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
@@ -392,6 +399,9 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
|
||||
|
||||
<h3><a id="index_n"></a>- n -</h3><ul>
|
||||
<li>neighbors
|
||||
: <a class="el" href="dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">graph::Graph</a>
|
||||
</li>
|
||||
<li>new_val()
|
||||
: <a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">statistics::stats_computer1< T ></a>
|
||||
, <a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2< T ></a>
|
||||
@@ -408,6 +418,9 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
<li>num_digits()
|
||||
: <a class="el" href="db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">large_number</a>
|
||||
</li>
|
||||
<li>number_of_vertices()
|
||||
: <a class="el" href="dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">graph::Graph</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -469,12 +482,21 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
|
||||
|
||||
<h3><a id="index_p"></a>- p -</h3><ul>
|
||||
<li>parent
|
||||
: <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree</a>
|
||||
</li>
|
||||
<li>Point()
|
||||
: <a class="el" href="d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">Point</a>
|
||||
</li>
|
||||
<li>pop()
|
||||
: <a class="el" href="d1/dc2/classstack.html#a6cd4b95d5de00d41b2491392338384dc">stack< Type ></a>
|
||||
</li>
|
||||
<li>populate_parents()
|
||||
: <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree</a>
|
||||
</li>
|
||||
<li>populate_up()
|
||||
: <a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor</a>
|
||||
</li>
|
||||
<li>predict()
|
||||
: <a class="el" href="d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">machine_learning::adaline</a>
|
||||
</li>
|
||||
@@ -513,6 +535,12 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
<li>right()
|
||||
: <a class="el" href="d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e">MinHeap</a>
|
||||
</li>
|
||||
<li>root
|
||||
: <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree</a>
|
||||
</li>
|
||||
<li>RootedTree()
|
||||
: <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">graph::RootedTree</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -563,6 +591,9 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
|
||||
|
||||
<h3><a id="index_u"></a>- u -</h3><ul>
|
||||
<li>up
|
||||
: <a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">graph::LowestCommonAncestor</a>
|
||||
</li>
|
||||
<li>update()
|
||||
: <a class="el" href="dd/d91/class_fenwick_tree.html#a2e9ea4fcbe0786487f4535c1cfc7aa00">FenwickTree</a>
|
||||
</li>
|
||||
|
||||
@@ -249,12 +249,13 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
|
||||
<li>getVertices()
|
||||
: <a class="el" href="da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1">Graph</a>
|
||||
</li>
|
||||
<li>Graph()
|
||||
: <a class="el" href="da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8">Graph</a>
|
||||
</li>
|
||||
<li>graph()
|
||||
: <a class="el" href="dd/d9b/classgraph.html#a6da44f9820d3b7bae2f0f74bc149c27e">graph</a>
|
||||
</li>
|
||||
<li>Graph()
|
||||
: <a class="el" href="da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8">Graph</a>
|
||||
, <a class="el" href="dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">graph::Graph</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -309,6 +310,12 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
|
||||
<li>left()
|
||||
: <a class="el" href="d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca">MinHeap</a>
|
||||
</li>
|
||||
<li>lowest_common_ancestor()
|
||||
: <a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">graph::LowestCommonAncestor</a>
|
||||
</li>
|
||||
<li>LowestCommonAncestor()
|
||||
: <a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">graph::LowestCommonAncestor</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -343,6 +350,9 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
|
||||
<li>num_digits()
|
||||
: <a class="el" href="db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">large_number</a>
|
||||
</li>
|
||||
<li>number_of_vertices()
|
||||
: <a class="el" href="dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">graph::Graph</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -395,6 +405,12 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
|
||||
<li>pop()
|
||||
: <a class="el" href="d1/dc2/classstack.html#a6cd4b95d5de00d41b2491392338384dc">stack< Type ></a>
|
||||
</li>
|
||||
<li>populate_parents()
|
||||
: <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree</a>
|
||||
</li>
|
||||
<li>populate_up()
|
||||
: <a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor</a>
|
||||
</li>
|
||||
<li>predict()
|
||||
: <a class="el" href="d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">machine_learning::adaline</a>
|
||||
</li>
|
||||
@@ -427,6 +443,9 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
|
||||
<li>right()
|
||||
: <a class="el" href="d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e">MinHeap</a>
|
||||
</li>
|
||||
<li>RootedTree()
|
||||
: <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">graph::RootedTree</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
|
||||
@@ -173,11 +173,15 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
|
||||
<h3><a id="index_l"></a>- l -</h3><ul>
|
||||
<li>level
|
||||
: <a class="el" href="d1/d46/classdata__structure_1_1_skip_list.html#ae0c022174510fd9ca1b84d8e996cd1a5">data_structure::SkipList</a>
|
||||
, <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
<h3><a id="index_n"></a>- n -</h3><ul>
|
||||
<li>neighbors
|
||||
: <a class="el" href="dc/d61/classgraph_1_1_graph.html#aee72d7dd4778097a6d852c659de8fe58">graph::Graph</a>
|
||||
</li>
|
||||
<li>next
|
||||
: <a class="el" href="dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f">hash_chain</a>
|
||||
, <a class="el" href="d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">list</a>
|
||||
@@ -186,6 +190,13 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
|
||||
</ul>
|
||||
|
||||
|
||||
<h3><a id="index_p"></a>- p -</h3><ul>
|
||||
<li>parent
|
||||
: <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
<h3><a id="index_q"></a>- q -</h3><ul>
|
||||
<li>queueFront
|
||||
: <a class="el" href="db/da9/classqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queue< Kind ></a>
|
||||
@@ -196,6 +207,13 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
|
||||
</ul>
|
||||
|
||||
|
||||
<h3><a id="index_r"></a>- r -</h3><ul>
|
||||
<li>root
|
||||
: <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
<h3><a id="index_s"></a>- s -</h3><ul>
|
||||
<li>size
|
||||
: <a class="el" href="d1/dc2/classstack.html#ac512a3efdc84a5f5c9f53905c8e219b0">stack< Type ></a>
|
||||
@@ -213,6 +231,13 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
|
||||
</ul>
|
||||
|
||||
|
||||
<h3><a id="index_u"></a>- u -</h3><ul>
|
||||
<li>up
|
||||
: <a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">graph::LowestCommonAncestor</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
<h3><a id="index_v"></a>- v -</h3><ul>
|
||||
<li>value
|
||||
: <a class="el" href="d3/d6f/structdata__structure_1_1_node.html#a24580ec4e79f7bb82e55a9c4d8369a6e">data_structure::Node</a>
|
||||
|
||||
@@ -99,16 +99,16 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
|
||||
, <a class="el" href="d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">n_queens.cpp</a>
|
||||
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">vigenere_cipher.cpp</a>
|
||||
, <a class="el" href="d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">line_segment_intersection.cpp</a>
|
||||
, <a class="el" href="db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_prime.cpp</a>
|
||||
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_amicable_pair.cpp</a>
|
||||
, <a class="el" href="dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.cpp</a>
|
||||
, <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">newton_raphson_method.cpp</a>
|
||||
, <a class="el" href="db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_prime.cpp</a>
|
||||
, <a class="el" href="db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_forward_euler.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">complex_numbers.cpp</a>
|
||||
, <a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.cpp</a>
|
||||
, <a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_factorial.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">complex_numbers.cpp</a>
|
||||
, <a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.cpp</a>
|
||||
, <a class="el" href="d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.cpp</a>
|
||||
, <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.cpp</a>
|
||||
, <a class="el" href="d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">rabin_karp.cpp</a>
|
||||
, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">knuth_morris_pratt.cpp</a>
|
||||
, <a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">brute_force_string_searching.cpp</a>
|
||||
@@ -150,15 +150,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
|
||||
, <a class="el" href="d4/de8/fast__interger__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_interger_input.cpp</a>
|
||||
, <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">decimal_to_roman_numeral.cpp</a>
|
||||
, <a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">decimal_to_hexadecimal.cpp</a>
|
||||
, <a class="el" href="da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">eulers_totient_function.cpp</a>
|
||||
, <a class="el" href="df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">successive_approximation.cpp</a>
|
||||
, <a class="el" href="d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">buzz_number.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_factorial.cpp</a>
|
||||
, <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.cpp</a>
|
||||
, <a class="el" href="df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">successive_approximation.cpp</a>
|
||||
, <a class="el" href="d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">xor_cipher.cpp</a>
|
||||
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
|
||||
, <a class="el" href="da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">eulers_totient_function.cpp</a>
|
||||
, <a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">extended_euclid_algorithm.cpp</a>
|
||||
, <a class="el" href="d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">factorial.cpp</a>
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.cpp</a>
|
||||
, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">golden_search_extrema.cpp</a>
|
||||
, <a class="el" href="d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gaussian_elimination.cpp</a>
|
||||
, <a class="el" href="dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">false_position.cpp</a>
|
||||
@@ -182,15 +182,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
|
||||
, <a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_of_n_numbers.cpp</a>
|
||||
, <a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_iterative_euclidean.cpp</a>
|
||||
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_fast.cpp</a>
|
||||
, <a class="el" href="d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_power.cpp</a>
|
||||
, <a class="el" href="d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci.cpp</a>
|
||||
, <a class="el" href="d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">factorial.cpp</a>
|
||||
, <a class="el" href="d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_power.cpp</a>
|
||||
, <a class="el" href="d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sudoku_solve.cpp</a>
|
||||
, <a class="el" href="d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">avltree.cpp</a>
|
||||
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.cpp</a>
|
||||
, <a class="el" href="d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">chaining.cpp</a>
|
||||
, <a class="el" href="de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">disjoint_set.cpp</a>
|
||||
, <a class="el" href="d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_hash_hash_table.cpp</a>
|
||||
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_amicable_pair.cpp</a>
|
||||
, <a class="el" href="d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">chaining.cpp</a>
|
||||
, <a class="el" href="de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">binary_exponent.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">armstrong_number.cpp</a>
|
||||
, <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ordinary_least_squares_regressor.cpp</a>
|
||||
@@ -199,6 +199,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.cpp</a>
|
||||
, <a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">quadratic_probing_hash_table.cpp</a>
|
||||
, <a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_probing_hash_table.cpp</a>
|
||||
, <a class="el" href="d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_hash_hash_table.cpp</a>
|
||||
, <a class="el" href="df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">minimax.cpp</a>
|
||||
, <a class="el" href="d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">caesar_cipher.cpp</a>
|
||||
, <a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linkedlist_implentation_usingarray.cpp</a>
|
||||
|
||||
@@ -172,22 +172,23 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
|
||||
: <a class="el" href="d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">realtime_stats.cpp</a>
|
||||
</li>
|
||||
<li>test_int()
|
||||
: <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a>
|
||||
, <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>
|
||||
: <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>
|
||||
, <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a>
|
||||
</li>
|
||||
<li>test_lamniscate()
|
||||
: <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60">kohonen_som_trace.cpp</a>
|
||||
</li>
|
||||
<li>tests()
|
||||
: <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
|
||||
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">breadth_first_search.cpp</a>
|
||||
: <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
|
||||
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
|
||||
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>
|
||||
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
|
||||
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
</li>
|
||||
<li>TH()
|
||||
: <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a>
|
||||
|
||||
@@ -120,15 +120,15 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
|
||||
<li>is_square()
|
||||
: <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a4921874435266592b222e3f2eda0e01f">ordinary_least_squares_regressor.cpp</a>
|
||||
</li>
|
||||
<li>isPrime()
|
||||
: <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a>
|
||||
</li>
|
||||
<li>IsPrime()
|
||||
: <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a>
|
||||
</li>
|
||||
<li>isprime
|
||||
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.cpp</a>
|
||||
</li>
|
||||
<li>isPrime()
|
||||
: <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a>
|
||||
</li>
|
||||
<li>it_ternary_search()
|
||||
: <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a>
|
||||
</li>
|
||||
|
||||
@@ -99,27 +99,27 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">n_queens.cpp</a>
|
||||
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">vigenere_cipher.cpp</a>
|
||||
, <a class="el" href="d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">line_segment_intersection.cpp</a>
|
||||
, <a class="el" href="db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_prime.cpp</a>
|
||||
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_amicable_pair.cpp</a>
|
||||
, <a class="el" href="dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.cpp</a>
|
||||
, <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">newton_raphson_method.cpp</a>
|
||||
, <a class="el" href="db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_prime.cpp</a>
|
||||
, <a class="el" href="db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_forward_euler.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">complex_numbers.cpp</a>
|
||||
, <a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.cpp</a>
|
||||
, <a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_factorial.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">complex_numbers.cpp</a>
|
||||
, <a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.cpp</a>
|
||||
, <a class="el" href="d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_factorial.cpp</a>
|
||||
, <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.cpp</a>
|
||||
, <a class="el" href="da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">eulers_totient_function.cpp</a>
|
||||
, <a class="el" href="df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">successive_approximation.cpp</a>
|
||||
, <a class="el" href="d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">buzz_number.cpp</a>
|
||||
, <a class="el" href="d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">xor_cipher.cpp</a>
|
||||
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
|
||||
, <a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">extended_euclid_algorithm.cpp</a>
|
||||
, <a class="el" href="da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">eulers_totient_function.cpp</a>
|
||||
, <a class="el" href="d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">buzz_number.cpp</a>
|
||||
, <a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">decimal_to_hexadecimal.cpp</a>
|
||||
, <a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">extended_euclid_algorithm.cpp</a>
|
||||
, <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">decimal_to_roman_numeral.cpp</a>
|
||||
, <a class="el" href="d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">factorial.cpp</a>
|
||||
, <a class="el" href="d4/de8/fast__interger__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_interger_input.cpp</a>
|
||||
, <a class="el" href="db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">happy_number.cpp</a>
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">rabin_karp.cpp</a>
|
||||
, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">knuth_morris_pratt.cpp</a>
|
||||
@@ -155,22 +155,22 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sparse_matrix.cpp</a>
|
||||
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">smallest_circle.cpp</a>
|
||||
, <a class="el" href="da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">primality_test.cpp</a>
|
||||
, <a class="el" href="d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_power.cpp</a>
|
||||
, <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">matrix_exponentiation.cpp</a>
|
||||
, <a class="el" href="da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">palindrome_of_number.cpp</a>
|
||||
, <a class="el" href="d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci.cpp</a>
|
||||
, <a class="el" href="dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">pascal_triangle.cpp</a>
|
||||
, <a class="el" href="d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">factorial.cpp</a>
|
||||
, <a class="el" href="db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">happy_number.cpp</a>
|
||||
, <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">matrix_exponentiation.cpp</a>
|
||||
, <a class="el" href="d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_power.cpp</a>
|
||||
, <a class="el" href="da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">palindrome_of_number.cpp</a>
|
||||
, <a class="el" href="d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sudoku_solve.cpp</a>
|
||||
, <a class="el" href="d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">avltree.cpp</a>
|
||||
, <a class="el" href="da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.cpp</a>
|
||||
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci.cpp</a>
|
||||
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_fast.cpp</a>
|
||||
, <a class="el" href="da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.cpp</a>
|
||||
, <a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_iterative_euclidean.cpp</a>
|
||||
, <a class="el" href="d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">chaining.cpp</a>
|
||||
, <a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_of_n_numbers.cpp</a>
|
||||
, <a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_recursive_euclidean.cpp</a>
|
||||
, <a class="el" href="de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">disjoint_set.cpp</a>
|
||||
, <a class="el" href="d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_hash_hash_table.cpp</a>
|
||||
, <a class="el" href="dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.cpp</a>
|
||||
, <a class="el" href="d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">chaining.cpp</a>
|
||||
, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">golden_search_extrema.cpp</a>
|
||||
, <a class="el" href="d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gaussian_elimination.cpp</a>
|
||||
, <a class="el" href="dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">false_position.cpp</a>
|
||||
@@ -187,25 +187,26 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">power_for_huge_numbers.cpp</a>
|
||||
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">number_of_positive_divisors.cpp</a>
|
||||
, <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">modular_inverse_fermat_little_theorem.cpp</a>
|
||||
, <a class="el" href="d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">large_factorial.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_probing_hash_table.cpp</a>
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">miller_rabin.cpp</a>
|
||||
, <a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_recursive_euclidean.cpp</a>
|
||||
, <a class="el" href="d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">large_factorial.cpp</a>
|
||||
, <a class="el" href="d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_hash_hash_table.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">minimax.cpp</a>
|
||||
, <a class="el" href="d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">caesar_cipher.cpp</a>
|
||||
, <a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linkedlist_implentation_usingarray.cpp</a>
|
||||
, <a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_probing_hash_table.cpp</a>
|
||||
, <a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">quadratic_probing_hash_table.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.cpp</a>
|
||||
, <a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">queue_using_two_stacks.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.cpp</a>
|
||||
, <a class="el" href="d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hill_cipher.cpp</a>
|
||||
, <a class="el" href="d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">skip_list.cpp</a>
|
||||
, <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ordinary_least_squares_regressor.cpp</a>
|
||||
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_amicable_pair.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">armstrong_number.cpp</a>
|
||||
, <a class="el" href="dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_modern.cpp</a>
|
||||
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.cpp</a>
|
||||
, <a class="el" href="de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">binary_exponent.cpp</a>
|
||||
, <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ordinary_least_squares_regressor.cpp</a>
|
||||
, <a class="el" href="dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_modern.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">armstrong_number.cpp</a>
|
||||
</li>
|
||||
<li>mat_mul()
|
||||
: <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a7558fd7779bf207157ced66f275951a0">qr_eigen_values.cpp</a>
|
||||
|
||||
@@ -172,8 +172,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
: <a class="el" href="d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">realtime_stats.cpp</a>
|
||||
</li>
|
||||
<li>test_int()
|
||||
: <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>
|
||||
, <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a>
|
||||
: <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a>
|
||||
, <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>
|
||||
</li>
|
||||
<li>test_lamniscate()
|
||||
: <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60">kohonen_som_trace.cpp</a>
|
||||
@@ -182,15 +182,16 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
: <a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">brute_force_string_searching.cpp</a>
|
||||
</li>
|
||||
<li>tests()
|
||||
: <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
|
||||
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>
|
||||
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
|
||||
: <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
|
||||
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>
|
||||
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
|
||||
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
|
||||
</li>
|
||||
<li>TH()
|
||||
: <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a>
|
||||
|
||||
160
hierarchy.html
Normal file
160
hierarchy.html
Normal file
@@ -0,0 +1,160 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: Class Hierarchy</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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('hierarchy.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">Class Hierarchy</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<div class="textblock">
|
||||
<p><a href="inherits.html">Go to the graphical class hierarchy</a></p>
|
||||
This inheritance list is sorted roughly, but not completely, alphabetically:</div><div class="directory">
|
||||
<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span>]</div><table class="directory">
|
||||
<tr id="row_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html" target="_self">machine_learning::adaline</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_1_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_3_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_5_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_7_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_9_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_11_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_13_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d9b/classgraph.html" target="_self">graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">▼</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</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </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_15_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_16_"><td class="entry"><span style="width:16px;display:inline-block;"> </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">Hill Cipher</a> algorithm </td></tr>
|
||||
<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_18_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_20_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_22_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_24_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d6f/structdata__structure_1_1_node.html" target="_self">data_structure::Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_28_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_30_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dd2/class_queue___array.html" target="_self">Queue_Array</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d46/classdata__structure_1_1_skip_list.html" target="_self">data_structure::SkipList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;"> </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< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_42_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dd9/structtrie.html" target="_self">trie</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_44_"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</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="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
50
hierarchy.js
Normal file
50
hierarchy.js
Normal file
@@ -0,0 +1,50 @@
|
||||
var hierarchy =
|
||||
[
|
||||
[ "machine_learning::adaline", "d6/d30/classmachine__learning_1_1adaline.html", null ],
|
||||
[ "Btree", "d9/d90/struct_btree.html", null ],
|
||||
[ "cll", "d5/d15/classcll.html", null ],
|
||||
[ "compare", "d1/db3/structcompare.html", null ],
|
||||
[ "Complex", "da/d5a/class_complex.html", null ],
|
||||
[ "CycleCheck", "d3/dbb/class_cycle_check.html", null ],
|
||||
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],
|
||||
[ "Edge", "d7/d77/class_edge.html", null ],
|
||||
[ "linear_probing::Entry", "db/d19/structlinear__probing_1_1_entry.html", null ],
|
||||
[ "quadratic_probing::Entry", "da/dd1/structquadratic__probing_1_1_entry.html", null ],
|
||||
[ "double_hashing::Entry", "d9/dde/structdouble__hashing_1_1_entry.html", null ],
|
||||
[ "FenwickTree", "dd/d91/class_fenwick_tree.html", null ],
|
||||
[ "Graph", "da/d9a/class_graph.html", null ],
|
||||
[ "graph", "dd/d9b/classgraph.html", null ],
|
||||
[ "graph::Graph", "dc/d61/classgraph_1_1_graph.html", [
|
||||
[ "graph::RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html", null ]
|
||||
] ],
|
||||
[ "hash_chain", "dd/d1c/classhash__chain.html", null ],
|
||||
[ "ciphers::HillCipher", "d6/d26/classciphers_1_1_hill_cipher.html", null ],
|
||||
[ "Item", "db/d66/struct_item.html", null ],
|
||||
[ "large_number", "db/d82/classlarge__number.html", null ],
|
||||
[ "linkedlist", "d0/dff/structlinkedlist.html", null ],
|
||||
[ "list", "d8/d10/structlist.html", null ],
|
||||
[ "graph::LowestCommonAncestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html", null ],
|
||||
[ "MinHeap", "d2/d05/class_min_heap.html", null ],
|
||||
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ],
|
||||
[ "mst", "d1/d77/structmst.html", null ],
|
||||
[ "data_structure::Node", "d3/d6f/structdata__structure_1_1_node.html", null ],
|
||||
[ "node< Kind >", "d5/da1/structnode.html", null ],
|
||||
[ "Node", "db/d8b/struct_node.html", null ],
|
||||
[ "node< Type >", "d5/da1/structnode.html", null ],
|
||||
[ "Point", "d8/dc8/struct_point.html", null ],
|
||||
[ "query", "dd/d1b/structquery.html", null ],
|
||||
[ "queue< Kind >", "db/da9/classqueue.html", null ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", null ],
|
||||
[ "Queue_Array", "d0/dd2/class_queue___array.html", null ],
|
||||
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ],
|
||||
[ "data_structure::SkipList", "d1/d46/classdata__structure_1_1_skip_list.html", null ],
|
||||
[ "Solution", "dd/d4f/class_solution.html", null ],
|
||||
[ "stack< Type >", "d1/dc2/classstack.html", null ],
|
||||
[ "stack_linkedList", "d2/dc4/classstack__linked_list.html", null ],
|
||||
[ "statistics::stats_computer1< T >", "d7/d7c/classstatistics_1_1stats__computer1.html", null ],
|
||||
[ "statistics::stats_computer2< T >", "d8/dab/classstatistics_1_1stats__computer2.html", null ],
|
||||
[ "tower", "d2/d2c/structtower.html", null ],
|
||||
[ "trie", "d4/dd9/structtrie.html", null ],
|
||||
[ "Trie", "dd/d2f/class_trie.html", null ],
|
||||
[ "Trie::TrieNode", "de/d48/struct_trie_1_1_trie_node.html", null ]
|
||||
];
|
||||
3
inherit_graph_0.map
Normal file
3
inherit_graph_0.map
Normal file
@@ -0,0 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$d9/d90/struct_btree.html" title=" " alt="" coords="5,5,59,32"/>
|
||||
</map>
|
||||
1
inherit_graph_0.md5
Normal file
1
inherit_graph_0.md5
Normal file
@@ -0,0 +1 @@
|
||||
da75557a67799654c5fa372580a1d631
|
||||
22
inherit_graph_0.svg
Normal file
22
inherit_graph_0.svg
Normal file
@@ -0,0 +1,22 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- 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">
|
||||
<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"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="d9/d90/struct_btree.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">Btree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 991 B |
3
inherit_graph_1.map
Normal file
3
inherit_graph_1.map
Normal file
@@ -0,0 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$d6/d26/classciphers_1_1_hill_cipher.html" title="Implementation of Hill Cipher algorithm." alt="" coords="5,5,135,32"/>
|
||||
</map>
|
||||
1
inherit_graph_1.md5
Normal file
1
inherit_graph_1.md5
Normal file
@@ -0,0 +1 @@
|
||||
a92e6b9007a3d346531af376c643b0d7
|
||||
22
inherit_graph_1.svg
Normal file
22
inherit_graph_1.svg
Normal file
@@ -0,0 +1,22 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="105pt" height="28pt"
|
||||
viewBox="0.00 0.00 105.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 101,-24 101,4 -4,4"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="d6/d26/classciphers_1_1_hill_cipher.html" target="_top" xlink:title="Implementation of Hill Cipher algorithm.">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 97,-19.5 97,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="48.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.0 KiB |
3
inherit_graph_10.map
Normal file
3
inherit_graph_10.map
Normal file
@@ -0,0 +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,57,32"/>
|
||||
</map>
|
||||
1
inherit_graph_10.md5
Normal file
1
inherit_graph_10.md5
Normal file
@@ -0,0 +1 @@
|
||||
e148e1f3f544084b7aa1e7be1efaa9bb
|
||||
22
inherit_graph_10.svg
Normal file
22
inherit_graph_10.svg
Normal file
@@ -0,0 +1,22 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="47pt" height="28pt"
|
||||
viewBox="0.00 0.00 47.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 43,-24 43,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 39,-19.5 39,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="19.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Edge</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 990 B |
3
inherit_graph_11.map
Normal file
3
inherit_graph_11.map
Normal file
@@ -0,0 +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"/>
|
||||
</map>
|
||||
1
inherit_graph_11.md5
Normal file
1
inherit_graph_11.md5
Normal file
@@ -0,0 +1 @@
|
||||
26396299a5a5a0cf88af656fc914cf13
|
||||
22
inherit_graph_11.svg
Normal file
22
inherit_graph_11.svg
Normal file
@@ -0,0 +1,22 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- 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">
|
||||
<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"/>
|
||||
<!-- 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>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1005 B |
3
inherit_graph_12.map
Normal file
3
inherit_graph_12.map
Normal file
@@ -0,0 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$da/d9a/class_graph.html" title=" " alt="" coords="5,5,63,32"/>
|
||||
</map>
|
||||
1
inherit_graph_12.md5
Normal file
1
inherit_graph_12.md5
Normal file
@@ -0,0 +1 @@
|
||||
4eeb1b22e1ab39b25c3d6d16904bf56f
|
||||
22
inherit_graph_12.svg
Normal file
22
inherit_graph_12.svg
Normal file
@@ -0,0 +1,22 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="51pt" height="28pt"
|
||||
viewBox="0.00 0.00 51.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 47,-24 47,4 -4,4"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="da/d9a/class_graph.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 43,-19.5 43,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="21.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Graph</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 992 B |
3
inherit_graph_13.map
Normal file
3
inherit_graph_13.map
Normal file
@@ -0,0 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$dd/d9b/classgraph.html" title=" " alt="" coords="5,5,60,32"/>
|
||||
</map>
|
||||
1
inherit_graph_13.md5
Normal file
1
inherit_graph_13.md5
Normal file
@@ -0,0 +1 @@
|
||||
d715eb4f37eb251490cfc58aa1ae17d0
|
||||
22
inherit_graph_13.svg
Normal file
22
inherit_graph_13.svg
Normal file
@@ -0,0 +1,22 @@
|
||||
<?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.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="49pt" height="28pt"
|
||||
viewBox="0.00 0.00 49.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 45,-24 45,4 -4,4"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="dd/d9b/classgraph.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 41,-19.5 41,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="20.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 991 B |
4
inherit_graph_14.map
Normal file
4
inherit_graph_14.map
Normal file
@@ -0,0 +1,4 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="5,5,103,32"/>
|
||||
<area shape="rect" id="node2" href="$d0/d58/classgraph_1_1_rooted_tree.html" title=" " alt="" coords="151,5,281,32"/>
|
||||
</map>
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user