Documentation for f7a5aecce5

da/d52/minimum__edit__distance_8cpp.html

@@ -136,7 +136,7 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p >Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> using Dynamic Programing. </p>
 <p >Given two strings str1 &amp; str2 and we have to calculate the minimum number of operations (Insert, Remove, Replace) required to convert str1 to str2.</p>
-<h3><a class="anchor" id="autotoc_md64"></a>
+<h3><a class="anchor" id="autotoc_md65"></a>
 Algorithm</h3>
 <p >We will solve this problem using Naive recursion. But as we are approaching with a DP solution. So, we will take a DP array to store the solution of all sub-problems so that we don't have to perform recursion again and again. Now to solve the problem, We can traverse all characters from either right side of the strings or left side. Suppose we will do it from the right side. So, there are two possibilities for every pair of characters being traversed.</p><ol type="1">
 <li>If the last characters of two strings are the same, Ignore the characters and get the count for the remaining string. So, we get the solution for lengths m-1 and n-1 in a DP array.</li>

da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map

@@ -6,6 +6,6 @@
 <area shape="rect" id="node7" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ad585670a392c7e842c992d088093dff5" title=" " alt="" coords="104,123,260,164"/>
 <area shape="rect" id="node8" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a098be172c737f236763afdb8cada4835" title=" " alt="" coords="104,188,260,229"/>
 <area shape="rect" id="node9" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/stol.html#" title=" " alt="" coords="148,319,216,346"/>
-<area shape="rect" id="node3" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" title=" " alt="" coords="308,156,464,197"/>
+<area shape="rect" id="node3" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" title="Utility function that checks if the list is empty." alt="" coords="308,156,464,197"/>
 <area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/reset.html#" title=" " alt="" coords="312,261,460,287"/>
 </map>

da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5

@@ -1 +1 @@
-5562c38dc3edb2a9bc6dbb71b5f4d23c
+6b212deec9f04ec65076ade9ca5faded

da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -115,7 +115,7 @@
 <!-- Node3 -->
 <g id="node3" class="node">
 <title>Node3</title>
-<g id="a_node3"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" target="_top" xlink:title=" ">
+<g id="a_node3"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" target="_top" xlink:title="Utility function that checks if the list is empty.">
 <polygon fill="white" stroke="black" points="227,-112 227,-142 344,-142 344,-112 227,-112"/>
 <text text-anchor="start" x="235" y="-130" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
 <text text-anchor="middle" x="285.5" y="-119" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>