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

Documentation for 0931d530ae

Browse Source
This commit is contained in:
github-actions
2023-01-22 19:44:10 +00:00
parent a448f64699
commit b48f6e8671
2457 changed files with 9513 additions and 8691 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: operations_on_datastructures::trie_operations::Tnode Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -129,34 +129,34 @@ Public Member Functions</h2></td></tr>
<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><b>operator=</b> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;&amp;)=default</td></tr>
<tr class="separator:a72c3d60c8afaf31a9b490030fa9cffb4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afca808362c13273ca8c8ae7d58e8eee0"><td class="memItemLeft" align="right" valign="top">uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="memdesc:afca808362c13273ca8c8ae7d58e8eee0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to count the number of children a node in the trie has. <a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">More...</a><br /></td></tr>
<tr class="memdesc:afca808362c13273ca8c8ae7d58e8eee0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to count the number of children a node in the trie has. <br /></td></tr>
<tr class="separator:afca808362c13273ca8c8ae7d58e8eee0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7ecb75b985b1ffc575a880274f855b1c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">Insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;entry)</td></tr>
<tr class="memdesc:a7ecb75b985b1ffc575a880274f855b1c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to insert a word in the trie. <a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">More...</a><br /></td></tr>
<tr class="memdesc:a7ecb75b985b1ffc575a880274f855b1c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to insert a word in the trie. <br /></td></tr>
<tr class="separator:a7ecb75b985b1ffc575a880274f855b1c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aefd24626ac47277431c9b8604e064340"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340">Delete</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> entry)</td></tr>
<tr class="memdesc:aefd24626ac47277431c9b8604e064340"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to verify presence and hence delete an entry from the trie. <a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340">More...</a><br /></td></tr>
<tr class="memdesc:aefd24626ac47277431c9b8604e064340"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to verify presence and hence delete an entry from the trie. <br /></td></tr>
<tr class="separator:aefd24626ac47277431c9b8604e064340"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adef6940391f981ab86767775176b7169"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">DeleteFrom</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *delete_from, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> delete_string, int remove_index)</td></tr>
<tr class="memdesc:adef6940391f981ab86767775176b7169"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function recursively deletes the substring character by character iterating through the string to be deleted. It traverses till the end of word in a recursive fashion, from there it deletes characters one by one till it reaches back to the initial call. <a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">More...</a><br /></td></tr>
<tr class="memdesc:adef6940391f981ab86767775176b7169"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function recursively deletes the substring character by character iterating through the string to be deleted. It traverses till the end of word in a recursive fashion, from there it deletes characters one by one till it reaches back to the initial call. <br /></td></tr>
<tr class="separator:adef6940391f981ab86767775176b7169"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4a624fcdf3c3beb2025d69f2cfda8023"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023">SearchPresence</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
<tr class="memdesc:a4a624fcdf3c3beb2025d69f2cfda8023"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check a word's presence in the trie (Basic) <a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023">More...</a><br /></td></tr>
<tr class="memdesc:a4a624fcdf3c3beb2025d69f2cfda8023"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check a word's presence in the trie (Basic) <br /></td></tr>
<tr class="separator:a4a624fcdf3c3beb2025d69f2cfda8023"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a097913c4badec2b60d50a171ecc299fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix)</td></tr>
<tr class="memdesc:a097913c4badec2b60d50a171ecc299fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to suggest all the entries of trie which have a given common prefix. <a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">More...</a><br /></td></tr>
<tr class="memdesc:a097913c4badec2b60d50a171ecc299fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to suggest all the entries of trie which have a given common prefix. <br /></td></tr>
<tr class="separator:a097913c4badec2b60d50a171ecc299fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a18b70172ca4fb2811dbfb9a86e48b34c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c">SearchSuggestions</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
<tr class="memdesc:a18b70172ca4fb2811dbfb9a86e48b34c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Lists out all the words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and if the search key is "abcdezz", then the longest common prefix is "abcde" and hence search results will be "abcde", "abcdefg". <a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c">More...</a><br /></td></tr>
<tr class="memdesc:a18b70172ca4fb2811dbfb9a86e48b34c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Lists out all the words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and if the search key is "abcdezz", then the longest common prefix is "abcde" and hence search results will be "abcde", "abcdefg". <br /></td></tr>
<tr class="separator:a18b70172ca4fb2811dbfb9a86e48b34c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9e556f52c837190ecf4265b1f05cfe9c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *suggestions)</td></tr>
<tr class="memdesc:a9e556f52c837190ecf4265b1f05cfe9c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to suggest most frequently searched entries of trie which have a given common prefix. <a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">More...</a><br /></td></tr>
<tr class="memdesc:a9e556f52c837190ecf4265b1f05cfe9c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to suggest most frequently searched entries of trie which have a given common prefix. <br /></td></tr>
<tr class="separator:a9e556f52c837190ecf4265b1f05cfe9c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7c5ab271d8042540f64ef16d259d1503"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503">SearchFreqSuggestions</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
<tr class="memdesc:a7c5ab271d8042540f64ef16d259d1503"><td class="mdescLeft">&#160;</td><td class="mdescRight">Lists out the most frequent words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and they have been previously searched for 3, 1, 2, 4 times respectively, if the search key is "ab", then the longest common prefix is "ab" and only the top 3 frequencies among the matches would be displayed viz. "abcddef", "abc", "abcdefg". <a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503">More...</a><br /></td></tr>
<tr class="memdesc:a7c5ab271d8042540f64ef16d259d1503"><td class="mdescLeft">&#160;</td><td class="mdescRight">Lists out the most frequent words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and they have been previously searched for 3, 1, 2, 4 times respectively, if the search key is "ab", then the longest common prefix is "ab" and only the top 3 frequencies among the matches would be displayed viz. "abcddef", "abc", "abcdefg". <br /></td></tr>
<tr class="separator:a7c5ab271d8042540f64ef16d259d1503"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *suggestions)</td></tr>
<tr class="memdesc:aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to display the 3 suggestions with highest frequency of search hits. <a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">More...</a><br /></td></tr>
<tr class="memdesc:aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to display the 3 suggestions with highest frequency of search hits. <br /></td></tr>
<tr class="separator:aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
@@ -178,7 +178,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
<tr class="separator:a0f310c3d4d7b82e5ee1036771cade702"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Class defining the structure of trie node and containing the methods to perform operations on them. </p>
<div class="textblock"><p>Class defining the structure of trie node and containing the methods to perform operations on them. </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="aef1ef6608e5876312d9ae7f36f469ba7" name="aef1ef6608e5876312d9ae7f36f469ba7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aef1ef6608e5876312d9ae7f36f469ba7">&#9670;&#160;</a></span>Tnode() <span class="overload">[1/2]</span></h2>
@@ -912,7 +912,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></li><li class="navelem"><b>trie_operations</b></li><li class="navelem"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.5 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
</ul>
</div>
</body>

2
d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete Pages: 1 -->
<svg width="243pt" height="67pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

2
d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: operations_on_datastructures::trie_operations::Tnode::SearchSuggestions Pages: 1 -->
<svg width="424pt" height="82pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.8 KiB

After

Width:  |  Height:  |  Size: 3.8 KiB

2
d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions Pages: 1 -->
<svg width="451pt" height="140pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

2
d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete Pages: 1 -->
<svg width="270pt" height="67pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

2
d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: operations_on_datastructures::trie_operations::Tnode::SelectionTop_3 Pages: 1 -->
<svg width="243pt" height="49pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.9 KiB

After

Width:  |  Height:  |  Size: 1.9 KiB

2
d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: operations_on_datastructures::trie_operations::Tnode::DeleteFrom Pages: 1 -->
<svg width="273pt" height="67pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

2
d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: operations_on_datastructures::trie_operations::Tnode::Delete Pages: 1 -->
<svg width="454pt" height="202pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.1 KiB

After

Width:  |  Height:  |  Size: 6.1 KiB

2
d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: operations_on_datastructures::trie_operations::Tnode::numberOfChildren Pages: 1 -->
<svg width="249pt" height="49pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.9 KiB

After

Width:  |  Height:  |  Size: 1.9 KiB