Documentation for 4f4585d4c1

This commit is contained in:
github-actions
2023-05-20 01:28:48 +00:00
parent 1aa699dc74
commit 84985ecf11
45 changed files with 346 additions and 313 deletions

View File

@@ -98,12 +98,13 @@ $(document).ready(function(){initNavTree('d0/d77/longest__palindromic__subsequen
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">longest_palindromic_subsequence.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Program to find the Longest Palindormic Subsequence of a string.
<p>Program to find the <a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" target="_blank">Longest Palindormic Subsequence</a> of a string.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;string&gt;</code><br />
@@ -115,97 +116,29 @@ Include dependency graph for longest_palindromic_subsequence.cpp:</div>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d24/namespacedynamic__programming"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
<tr class="memdesc:dd/d24/namespacedynamic__programming"><td class="mdescLeft">&#160;</td><td class="mdescRight">Dynamic Programming algorithms. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a4f863610aebbc218f90a7adfde240cb4"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4">lps</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;a)</td></tr>
<tr class="separator:a4f863610aebbc218f90a7adfde240cb4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
<tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afe9f45b6e30ee187509da2d1d0093412"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;a)</td></tr>
<tr class="memdesc:afe9f45b6e30ee187509da2d1d0093412"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that returns the longest palindromic subsequence of a string. <br /></td></tr>
<tr class="separator:afe9f45b6e30ee187509da2d1d0093412"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main Function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Program to find the Longest Palindormic Subsequence of a string. </p>
<div class="textblock"><p>Program to find the <a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" target="_blank">Longest Palindormic Subsequence</a> of a string. </p>
<p><a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">Palindrome</a> string sequence of characters which reads the same backward as forward <a href="https://en.wikipedia.org/wiki/Subsequence" target="_blank">Subsequence</a> is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/anjali1903" target="_blank">Anjali Jha</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a4f863610aebbc218f90a7adfde240cb4" name="a4f863610aebbc218f90a7adfde240cb4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4f863610aebbc218f90a7adfde240cb4">&#9670;&#160;</a></span>lps()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> lps </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>a</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> Function that returns the longest palindromic subsequence of a string </p>
<div class="fragment"><div class="line"><span class="lineno"> 24</span> {</div>
<div class="line"><span class="lineno"> 25</span> <span class="keyword">const</span> <span class="keyword">auto</span> b = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(a.rbegin(), a.rend());</div>
<div class="line"><span class="lineno"> 26</span> <span class="keyword">const</span> <span class="keyword">auto</span> m = a.length();</div>
<div class="line"><span class="lineno"> 27</span> <span class="keyword">using </span>ind_type = std::string::size_type;</div>
<div class="line"><span class="lineno"> 28</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;ind_type&gt;</a> &gt; res(m + 1,</div>
<div class="line"><span class="lineno"> 29</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;ind_type&gt;</a>(m + 1));</div>
<div class="line"><span class="lineno"> 30</span> </div>
<div class="line"><span class="lineno"> 31</span> <span class="comment">// Finding the length of the longest</span></div>
<div class="line"><span class="lineno"> 32</span> <span class="comment">// palindromic subsequence and storing</span></div>
<div class="line"><span class="lineno"> 33</span> <span class="comment">// in a 2D array in bottoms-up manner</span></div>
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">for</span> (ind_type i = 0; i &lt;= m; i++) {</div>
<div class="line"><span class="lineno"> 35</span> <span class="keywordflow">for</span> (ind_type j = 0; j &lt;= m; j++) {</div>
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">if</span> (i == 0 || j == 0) {</div>
<div class="line"><span class="lineno"> 37</span> res[i][j] = 0;</div>
<div class="line"><span class="lineno"> 38</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (a[i - 1] == b[j - 1]) {</div>
<div class="line"><span class="lineno"> 39</span> res[i][j] = res[i - 1][j - 1] + 1;</div>
<div class="line"><span class="lineno"> 40</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 41</span> res[i][j] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(res[i - 1][j], res[i][j - 1]);</div>
<div class="line"><span class="lineno"> 42</span> }</div>
<div class="line"><span class="lineno"> 43</span> }</div>
<div class="line"><span class="lineno"> 44</span> }</div>
<div class="line"><span class="lineno"> 45</span> <span class="comment">// Length of longest palindromic subsequence</span></div>
<div class="line"><span class="lineno"> 46</span> <span class="keyword">auto</span> idx = res[m][m];</div>
<div class="line"><span class="lineno"> 47</span> <span class="comment">// Creating string of index+1 length</span></div>
<div class="line"><span class="lineno"> 48</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ans(idx, <span class="charliteral">&#39;\0&#39;</span>);</div>
<div class="line"><span class="lineno"> 49</span> ind_type i = m, j = m;</div>
<div class="line"><span class="lineno"> 50</span> </div>
<div class="line"><span class="lineno"> 51</span> <span class="comment">// starting from right-most bottom-most corner</span></div>
<div class="line"><span class="lineno"> 52</span> <span class="comment">// and storing them one by one in ans</span></div>
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">while</span> (i &gt; 0 &amp;&amp; j &gt; 0) {</div>
<div class="line"><span class="lineno"> 54</span> <span class="comment">// if current characters in a and b are same</span></div>
<div class="line"><span class="lineno"> 55</span> <span class="comment">// then it is a part of the ans</span></div>
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">if</span> (a[i - 1] == b[j - 1]) {</div>
<div class="line"><span class="lineno"> 57</span> ans[idx - 1] = a[i - 1];</div>
<div class="line"><span class="lineno"> 58</span> i--;</div>
<div class="line"><span class="lineno"> 59</span> j--;</div>
<div class="line"><span class="lineno"> 60</span> idx--;</div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="line"><span class="lineno"> 62</span> <span class="comment">// If they are not same, find the larger of the</span></div>
<div class="line"><span class="lineno"> 63</span> <span class="comment">// two and move in that direction</span></div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (res[i - 1][j] &gt; res[i][j - 1]) {</div>
<div class="line"><span class="lineno"> 65</span> i--;</div>
<div class="line"><span class="lineno"> 66</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 67</span> j--;</div>
<div class="line"><span class="lineno"> 68</span> }</div>
<div class="line"><span class="lineno"> 69</span> }</div>
<div class="line"><span class="lineno"> 70</span> </div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">return</span> ans;</div>
<div class="line"><span class="lineno"> 72</span>}</div>
<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>
<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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d77/longest__palindromic__subsequence_8cpp_a4f863610aebbc218f90a7adfde240cb4_cgraph.svg" width="170" height="36"><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="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -221,47 +154,59 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p>Main Function </p>
<div class="fragment"><div class="line"><span class="lineno"> 85</span> {</div>
<div class="line"><span class="lineno"> 86</span> <a class="code hl_function" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 87</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 88</span>}</div>
<div class="ttc" id="alongest__palindromic__subsequence_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition:</b> longest_palindromic_subsequence.cpp:75</div></div>
<p>Main Function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 97</span> {</div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_function" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 99</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 100</span>}</div>
<div class="ttc" id="alongest__palindromic__subsequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> longest_palindromic_subsequence.cpp:86</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="359" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="498" height="36"><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="ae1a3968e7947464bee7714f6d43b7002" name="ae1a3968e7947464bee7714f6d43b7002"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae1a3968e7947464bee7714f6d43b7002">&#9670;&#160;</a></span>test()</h2>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void test </td>
<td class="memname">static void test </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>Test function </p>
<div class="fragment"><div class="line"><span class="lineno"> 75</span> {</div>
<div class="line"><span class="lineno"> 76</span> assert(<a class="code hl_function" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4">lps</a>(<span class="stringliteral">&quot;radar&quot;</span>) == <span class="stringliteral">&quot;radar&quot;</span>);</div>
<div class="line"><span class="lineno"> 77</span> assert(<a class="code hl_function" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4">lps</a>(<span class="stringliteral">&quot;abbcbaa&quot;</span>) == <span class="stringliteral">&quot;abcba&quot;</span>);</div>
<div class="line"><span class="lineno"> 78</span> assert(<a class="code hl_function" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4">lps</a>(<span class="stringliteral">&quot;bbbab&quot;</span>) == <span class="stringliteral">&quot;bbbb&quot;</span>);</div>
<div class="line"><span class="lineno"> 79</span> assert(<a class="code hl_function" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4">lps</a>(<span class="stringliteral">&quot;&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 80</span>}</div>
<div class="ttc" id="alongest__palindromic__subsequence_8cpp_html_a4f863610aebbc218f90a7adfde240cb4"><div class="ttname"><a href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4">lps</a></div><div class="ttdeci">std::string lps(const std::string &amp;a)</div><div class="ttdef"><b>Definition:</b> longest_palindromic_subsequence.cpp:24</div></div>
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 86</span> {</div>
<div class="line"><span class="lineno"> 87</span> assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;radar&quot;</span>) == <span class="stringliteral">&quot;radar&quot;</span>);</div>
<div class="line"><span class="lineno"> 88</span> assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;abbcbaa&quot;</span>) == <span class="stringliteral">&quot;abcba&quot;</span>);</div>
<div class="line"><span class="lineno"> 89</span> assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;bbbab&quot;</span>) == <span class="stringliteral">&quot;bbbb&quot;</span>);</div>
<div class="line"><span class="lineno"> 90</span> assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 91</span>}</div>
<div class="ttc" id="anamespacedynamic__programming_html_afe9f45b6e30ee187509da2d1d0093412"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a></div><div class="ttdeci">std::string lps(const std::string &amp;a)</div><div class="ttdoc">Function that returns the longest palindromic subsequence of a string.</div><div class="ttdef"><b>Definition:</b> longest_palindromic_subsequence.cpp:31</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d77/longest__palindromic__subsequence_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="262" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="400" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>

View File

@@ -1,6 +1,6 @@
var longest__palindromic__subsequence_8cpp =
[
[ "lps", "d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4", null ],
[ "lps", "d0/d77/longest__palindromic__subsequence_8cpp.html#afe9f45b6e30ee187509da2d1d0093412", null ],
[ "main", "d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test", "d0/d77/longest__palindromic__subsequence_8cpp.html#ae1a3968e7947464bee7714f6d43b7002", null ]
[ "test", "d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

View File

@@ -1,4 +0,0 @@
<map id="lps" name="lps">
<area shape="rect" id="node1" title=" " alt="" coords="5,5,44,31"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="92,5,164,31"/>
</map>

View File

@@ -1 +0,0 @@
904cb982eea6a95745b27faebc89844e

View File

@@ -1,36 +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 8.0.5 (20230430.1635)
-->
<!-- Title: lps Pages: 1 -->
<svg width="127pt" height="27pt"
viewBox="0.00 0.00 127.05 27.25" 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 23.25)">
<title>lps</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="28.8,-19.25 0,-19.25 0,0 28.8,0 28.8,-19.25"/>
<text text-anchor="middle" x="14.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lps</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/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="119.05,-19.25 64.8,-19.25 64.8,0 119.05,0 119.05,-19.25"/>
<text text-anchor="middle" x="91.93" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M29.25,-9.62C36.14,-9.62 44.83,-9.62 53.49,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="53.32,-13.13 63.32,-9.62 53.32,-6.13 53.32,-13.13"/>
</g>
</g>
</svg>

Before

Width:  |  Height:  |  Size: 1.5 KiB

View File

@@ -0,0 +1,5 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
<area shape="rect" id="node2" href="$dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412" title="Function that returns the longest palindromic subsequence of a string." alt="" coords="97,5,274,31"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="322,5,394,31"/>
</map>

View File

@@ -0,0 +1 @@
70ef56bd2349eea0f0d20c5ae9648573

View File

@@ -4,14 +4,14 @@
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: test Pages: 1 -->
<svg width="196pt" height="27pt"
viewBox="0.00 0.00 195.55 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="300pt" height="27pt"
viewBox="0.00 0.00 299.75 27.25" 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 23.25)">
<title>test</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<g id="a_node1"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
@@ -20,32 +20,32 @@
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="97.3,-19.25 68.5,-19.25 68.5,0 97.3,0 97.3,-19.25"/>
<text text-anchor="middle" x="82.9" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lps</text>
<g id="a_node2"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412" target="_top" xlink:title="Function that returns the longest palindromic subsequence of a string.">
<polygon fill="white" stroke="#666666" points="201.5,-19.25 68.5,-19.25 68.5,0 201.5,0 201.5,-19.25"/>
<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::lps</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M32.9,-9.62C40.22,-9.62 49.1,-9.62 57.28,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.15,-13.13 67.15,-9.62 57.15,-6.13 57.15,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M33,-9.62C39.75,-9.62 48.18,-9.62 57.27,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.19,-13.13 67.19,-9.62 57.19,-6.13 57.19,-13.13"/>
</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/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="187.55,-19.25 133.3,-19.25 133.3,0 187.55,0 187.55,-19.25"/>
<text text-anchor="middle" x="160.43" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
<polygon fill="white" stroke="#666666" points="291.75,-19.25 237.5,-19.25 237.5,0 291.75,0 291.75,-19.25"/>
<text text-anchor="middle" x="264.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M97.75,-9.62C104.64,-9.62 113.33,-9.62 121.99,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="121.82,-13.13 131.82,-9.62 121.82,-6.13 121.82,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M201.68,-9.62C210.14,-9.62 218.54,-9.62 226.32,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="226.18,-13.13 236.18,-9.62 226.18,-6.13 226.18,-13.13"/>
</g>
</g>
</svg>

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

View File

@@ -1,5 +0,0 @@
<map id="test" name="test">
<area shape="rect" id="node1" title=" " alt="" coords="5,5,49,31"/>
<area shape="rect" id="node2" href="$d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4" title=" " alt="" coords="97,5,135,31"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="183,5,255,31"/>
</map>

View File

@@ -1 +0,0 @@
67a490483bd8df7dfedbc90400d94d06

View File

@@ -1,6 +1,6 @@
<map id="main" name="main">
<area shape="rect" id="node1" title=" " alt="" coords="5,5,55,31"/>
<area shape="rect" id="node2" href="$d0/d77/longest__palindromic__subsequence_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="103,5,146,31"/>
<area shape="rect" id="node3" href="$d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4" title=" " alt="" coords="194,5,232,31"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="280,5,353,31"/>
<area shape="rect" id="node1" title="Main Function." alt="" coords="5,5,55,31"/>
<area shape="rect" id="node2" href="$d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
<area shape="rect" id="node3" href="$dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412" title="Function that returns the longest palindromic subsequence of a string." alt="" coords="194,5,371,31"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="419,5,492,31"/>
</map>

View File

@@ -1 +1 @@
80366458777ca781ef177e83f4b3c694
f98ea532d4eb17bb2b7c941d9711887b

View File

@@ -4,14 +4,14 @@
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: main Pages: 1 -->
<svg width="269pt" height="27pt"
viewBox="0.00 0.00 268.55 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="373pt" height="27pt"
viewBox="0.00 0.00 372.75 27.25" 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 23.25)">
<title>main</title>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<g id="a_node1"><a xlink:title="Main Function.">
<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
@@ -20,7 +20,7 @@
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
<g id="a_node2"><a xlink:href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
@@ -35,32 +35,32 @@
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#a4f863610aebbc218f90a7adfde240cb4" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="170.3,-19.25 141.5,-19.25 141.5,0 170.3,0 170.3,-19.25"/>
<text text-anchor="middle" x="155.9" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lps</text>
<g id="a_node3"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412" target="_top" xlink:title="Function that returns the longest palindromic subsequence of a string.">
<polygon fill="white" stroke="#666666" points="274.5,-19.25 141.5,-19.25 141.5,0 274.5,0 274.5,-19.25"/>
<text text-anchor="middle" x="208" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::lps</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="#63b8ff" d="M105.9,-9.62C113.22,-9.62 122.1,-9.62 130.28,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.15,-13.13 140.15,-9.62 130.15,-6.13 130.15,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M106,-9.62C112.75,-9.62 121.18,-9.62 130.27,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.19,-13.13 140.19,-9.62 130.19,-6.13 130.19,-13.13"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="260.55,-19.25 206.3,-19.25 206.3,0 260.55,0 260.55,-19.25"/>
<text text-anchor="middle" x="233.43" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
<polygon fill="white" stroke="#666666" points="364.75,-19.25 310.5,-19.25 310.5,0 364.75,0 364.75,-19.25"/>
<text text-anchor="middle" x="337.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="#63b8ff" d="M170.75,-9.62C177.64,-9.62 186.33,-9.62 194.99,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="194.82,-13.13 204.82,-9.62 194.82,-6.13 194.82,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M274.68,-9.62C283.14,-9.62 291.54,-9.62 299.32,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="299.18,-13.13 309.18,-9.62 299.18,-6.13 299.18,-13.13"/>
</g>
</g>
</svg>

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 3.1 KiB