Documentation for 0fea073413

d4/d08/babylonian__method_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: numerical_methods/babylonian_method.cpp Pages: 1 -->
 <svg width="192pt" height="93pt"

d4/d0c/binary__search__tree_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: data_structures/binary_search_tree.cpp Pages: 1 -->
 <svg width="121pt" height="93pt"

d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: numerical_methods::simpson_method::k Pages: 1 -->
 <svg width="205pt" height="69pt"

d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <svg width="200pt" height="75pt"

d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: numerical_methods::simpson_method::g Pages: 1 -->
 <svg width="205pt" height="69pt"

d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="225pt" height="177pt"

d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: numerical_methods::simpson_method::f Pages: 1 -->
 <svg width="204pt" height="69pt"

d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: numerical_methods::simpson_method::l Pages: 1 -->
 <svg width="200pt" height="56pt"

d4/d1f/merge__insertion__sort_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: sorting/merge_insertion_sort.cpp Pages: 1 -->
 <svg width="389pt" height="93pt"

d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: tests Pages: 1 -->
 <svg width="204pt" height="64pt"

d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: gcd Pages: 1 -->
 <svg width="40pt" height="45pt"

d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: lcm Pages: 1 -->
 <svg width="108pt" height="45pt"

d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="278pt" height="64pt"

d4/d25/ncr__modulo__p_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: math/ncr_modulo_p.cpp Pages: 1 -->
 <svg width="192pt" height="82pt"

d4/d26/durand__kerner__roots_8cpp__incl.map

@@ -1,5 +1,5 @@
 <map id="numerical_methods/durand_kerner_roots.cpp" name="numerical_methods/durand_kerner_roots.cpp">
-<area shape="rect" id="node1" title="Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm" alt="" coords="353,5,532,45"/>
+<area shape="rect" id="node1" title="Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm" alt="" coords="313,5,492,45"/>
 <area shape="rect" id="node2" title=" " alt="" coords="5,93,80,119"/>
 <area shape="rect" id="node3" title=" " alt="" coords="105,93,170,119"/>
 <area shape="rect" id="node4" title=" " alt="" coords="195,93,253,119"/>
@@ -9,5 +9,4 @@
 <area shape="rect" id="node8" title=" " alt="" coords="536,93,603,119"/>
 <area shape="rect" id="node9" title=" " alt="" coords="627,93,699,119"/>
 <area shape="rect" id="node10" title=" " alt="" coords="723,93,791,119"/>
-<area shape="rect" id="node11" title=" " alt="" coords="816,93,875,119"/>
 </map>

d4/d26/durand__kerner__roots_8cpp__incl.md5

@@ -1 +1 @@
-154749df2037b4cf915f58203b4fdf25
+e2668c3bbd7fc4136bc563e2e975fb2e

d4/d26/durand__kerner__roots_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: numerical_methods/durand_kerner_roots.cpp Pages: 1 -->
 <!--zoomable 93 -->
@@ -46,7 +46,7 @@ if (edges && edges.length) {
         </defs>
 
 <script type="text/javascript">
-var viewWidth = 660;
+var viewWidth = 598;
 var viewHeight = 93;
 var sectionId = 'dynsection-0';
 </script>
@@ -58,9 +58,9 @@ var sectionId = 'dynsection-0';
 <g id="node1" class="node">
 <title>Node1</title>
 <g id="a_node1"><a xlink:title="Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm">
-<polygon fill="#999999" stroke="#666666" points="395,-85 261,-85 261,-55 395,-55 395,-85"/>
-<text text-anchor="start" x="269" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/durand</text>
-<text text-anchor="middle" x="328" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_kerner_roots.cpp</text>
+<polygon fill="#999999" stroke="#666666" points="365,-85 231,-85 231,-55 365,-55 365,-85"/>
+<text text-anchor="start" x="239" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/durand</text>
+<text text-anchor="middle" x="298" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_kerner_roots.cpp</text>
 </a>
 </g>
 </g>
@@ -76,8 +76,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node2 -->
 <g id="edge1" class="edge">
 <title>Node1&#45;&gt;Node2</title>
-<path fill="none" stroke="#63b8ff" d="M260.84,-56.96C210.01,-47.68 138.21,-34.21 66.39,-19.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.76,-15.73 56.26,-17.11 65.33,-22.58 66.76,-15.73"/>
+<path fill="none" stroke="#63b8ff" d="M231.41,-54.98C187.14,-45.59 127.47,-32.82 66.13,-19.23"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="66.79,-15.79 56.27,-17.04 65.28,-22.62 66.79,-15.79"/>
 </g>
 <!-- Node3 -->
 <g id="node3" class="node">
@@ -91,8 +91,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node3 -->
 <g id="edge2" class="edge">
 <title>Node1&#45;&gt;Node3</title>
-<path fill="none" stroke="#63b8ff" d="M273.15,-54.99C229.73,-43.9 170.43,-28.75 133.44,-19.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.19,-15.88 123.63,-16.79 132.46,-22.66 134.19,-15.88"/>
+<path fill="none" stroke="#63b8ff" d="M250.33,-54.99C214.33,-44.4 165.77,-30.13 133.47,-20.63"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="134.17,-17.19 123.59,-17.73 132.2,-23.91 134.17,-17.19"/>
 </g>
 <!-- Node4 -->
 <g id="node4" class="node">
@@ -106,8 +106,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node4 -->
 <g id="edge3" class="edge">
 <title>Node1&#45;&gt;Node4</title>
-<path fill="none" stroke="#63b8ff" d="M288.72,-54.99C260.32,-44.86 222.43,-31.34 195.9,-21.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.92,-18.53 186.32,-18.46 194.57,-25.12 196.92,-18.53"/>
+<path fill="none" stroke="#63b8ff" d="M265.9,-54.99C243.75,-45.31 214.52,-32.56 193.05,-23.18"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="194.35,-19.93 183.79,-19.14 191.55,-26.35 194.35,-19.93"/>
 </g>
 <!-- Node5 -->
 <g id="node5" class="node">
@@ -121,8 +121,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node5 -->
 <g id="edge4" class="edge">
 <title>Node1&#45;&gt;Node5</title>
-<path fill="none" stroke="#63b8ff" d="M304.52,-54.84C289.2,-45.6 269.29,-33.59 254.05,-24.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.62,-21.26 245.25,-19.09 252.01,-27.26 255.62,-21.26"/>
+<path fill="none" stroke="#63b8ff" d="M281.78,-54.84C271.76,-46.09 258.89,-34.85 248.62,-25.88"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="250.87,-23.21 241.04,-19.27 246.27,-28.48 250.87,-23.21"/>
 </g>
 <!-- Node6 -->
 <g id="node6" class="node">
@@ -136,8 +136,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node6 -->
 <g id="edge5" class="edge">
 <title>Node1&#45;&gt;Node6</title>
-<path fill="none" stroke="#63b8ff" d="M320.74,-54.84C316.65,-46.87 311.51,-36.84 307.14,-28.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.17,-26.57 302.5,-19.27 303.94,-29.76 310.17,-26.57"/>
+<path fill="none" stroke="#63b8ff" d="M298,-54.84C298,-47.21 298,-37.7 298,-29.45"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="301.5,-29.27 298,-19.27 294.5,-29.27 301.5,-29.27"/>
 </g>
 <!-- Node7 -->
 <g id="node7" class="node">
@@ -151,8 +151,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node7 -->
 <g id="edge6" class="edge">
 <title>Node1&#45;&gt;Node7</title>
-<path fill="none" stroke="#63b8ff" d="M335.5,-54.84C339.73,-46.87 345.04,-36.84 349.55,-28.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.77,-29.74 354.35,-19.27 346.58,-26.46 352.77,-29.74"/>
+<path fill="none" stroke="#63b8ff" d="M312.77,-54.84C321.71,-46.26 333.14,-35.3 342.4,-26.42"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="345.06,-28.71 349.86,-19.27 340.22,-23.66 345.06,-28.71"/>
 </g>
 <!-- Node8 -->
 <g id="node8" class="node">
@@ -166,8 +166,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node8 -->
 <g id="edge7" class="edge">
 <title>Node1&#45;&gt;Node8</title>
-<path fill="none" stroke="#63b8ff" d="M351,-54.84C366,-45.6 385.5,-33.59 400.43,-24.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.36,-27.32 409.04,-19.09 398.69,-21.36 402.36,-27.32"/>
+<path fill="none" stroke="#63b8ff" d="M327.94,-54.99C348.42,-45.4 375.38,-32.79 395.35,-23.44"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="396.97,-26.55 404.54,-19.14 394,-20.21 396.97,-26.55"/>
 </g>
 <!-- Node9 -->
 <g id="node9" class="node">
@@ -181,8 +181,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node9 -->
 <g id="edge8" class="edge">
 <title>Node1&#45;&gt;Node9</title>
-<path fill="none" stroke="#63b8ff" d="M367.52,-54.99C395.42,-45.1 432.41,-31.98 459,-22.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="460.38,-25.78 468.63,-19.14 458.04,-19.18 460.38,-25.78"/>
+<path fill="none" stroke="#63b8ff" d="M344.71,-54.99C378.87,-44.74 424.57,-31.03 456.17,-21.55"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="457.33,-24.86 465.9,-18.63 455.31,-18.15 457.33,-24.86"/>
 </g>
 <!-- Node10 -->
 <g id="node10" class="node">
@@ -196,23 +196,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node10 -->
 <g id="edge9" class="edge">
 <title>Node1&#45;&gt;Node10</title>
-<path fill="none" stroke="#63b8ff" d="M384.53,-54.99C429.15,-43.93 490.05,-28.83 528.19,-19.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="529.44,-22.67 538.31,-16.87 527.76,-15.88 529.44,-22.67"/>
-</g>
-<!-- Node11 -->
-<g id="node11" class="node">
-<title>Node11</title>
-<g id="a_node11"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="652,-19 608,-19 608,0 652,0 652,-19"/>
-<text text-anchor="middle" x="630" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">omp.h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<path fill="none" stroke="#63b8ff" d="M395.15,-58.25C447.82,-49.44 523.17,-36.01 597.68,-19.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="598.74,-22.5 607.71,-16.86 597.18,-15.67 598.74,-22.5"/>
+<path fill="none" stroke="#63b8ff" d="M365.07,-54.95C408.88,-45.66 467.59,-33.01 528.59,-19.05"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="529.44,-22.44 538.4,-16.79 527.87,-15.62 529.44,-22.44"/>
 </g>
 </g>
 </svg>

d4/d26/durand__kerner__roots_8cpp__incl_org.svg

@@ -1,20 +1,20 @@
 <?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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: numerical_methods/durand_kerner_roots.cpp Pages: 1 -->
-<svg width="660pt" height="93pt"
- viewBox="0.00 0.00 660.00 93.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="598pt" height="93pt"
+ viewBox="0.00 0.00 597.50 93.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 89)">
 <title>numerical_methods/durand_kerner_roots.cpp</title>
 <!-- Node1 -->
 <g id="node1" class="node">
 <title>Node1</title>
 <g id="a_node1"><a xlink:title="Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm">
-<polygon fill="#999999" stroke="#666666" points="395,-85 261,-85 261,-55 395,-55 395,-85"/>
-<text text-anchor="start" x="269" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/durand</text>
-<text text-anchor="middle" x="328" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_kerner_roots.cpp</text>
+<polygon fill="#999999" stroke="#666666" points="365,-85 231,-85 231,-55 365,-55 365,-85"/>
+<text text-anchor="start" x="239" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/durand</text>
+<text text-anchor="middle" x="298" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_kerner_roots.cpp</text>
 </a>
 </g>
 </g>
@@ -30,8 +30,8 @@
 <!-- Node1&#45;&gt;Node2 -->
 <g id="edge1" class="edge">
 <title>Node1&#45;&gt;Node2</title>
-<path fill="none" stroke="#63b8ff" d="M260.84,-56.96C210.01,-47.68 138.21,-34.21 66.39,-19.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.76,-15.73 56.26,-17.11 65.33,-22.58 66.76,-15.73"/>
+<path fill="none" stroke="#63b8ff" d="M231.41,-54.98C187.14,-45.59 127.47,-32.82 66.13,-19.23"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="66.79,-15.79 56.27,-17.04 65.28,-22.62 66.79,-15.79"/>
 </g>
 <!-- Node3 -->
 <g id="node3" class="node">
@@ -45,8 +45,8 @@
 <!-- Node1&#45;&gt;Node3 -->
 <g id="edge2" class="edge">
 <title>Node1&#45;&gt;Node3</title>
-<path fill="none" stroke="#63b8ff" d="M273.15,-54.99C229.73,-43.9 170.43,-28.75 133.44,-19.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.19,-15.88 123.63,-16.79 132.46,-22.66 134.19,-15.88"/>
+<path fill="none" stroke="#63b8ff" d="M250.33,-54.99C214.33,-44.4 165.77,-30.13 133.47,-20.63"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="134.17,-17.19 123.59,-17.73 132.2,-23.91 134.17,-17.19"/>
 </g>
 <!-- Node4 -->
 <g id="node4" class="node">
@@ -60,8 +60,8 @@
 <!-- Node1&#45;&gt;Node4 -->
 <g id="edge3" class="edge">
 <title>Node1&#45;&gt;Node4</title>
-<path fill="none" stroke="#63b8ff" d="M288.72,-54.99C260.32,-44.86 222.43,-31.34 195.9,-21.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.92,-18.53 186.32,-18.46 194.57,-25.12 196.92,-18.53"/>
+<path fill="none" stroke="#63b8ff" d="M265.9,-54.99C243.75,-45.31 214.52,-32.56 193.05,-23.18"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="194.35,-19.93 183.79,-19.14 191.55,-26.35 194.35,-19.93"/>
 </g>
 <!-- Node5 -->
 <g id="node5" class="node">
@@ -75,8 +75,8 @@
 <!-- Node1&#45;&gt;Node5 -->
 <g id="edge4" class="edge">
 <title>Node1&#45;&gt;Node5</title>
-<path fill="none" stroke="#63b8ff" d="M304.52,-54.84C289.2,-45.6 269.29,-33.59 254.05,-24.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.62,-21.26 245.25,-19.09 252.01,-27.26 255.62,-21.26"/>
+<path fill="none" stroke="#63b8ff" d="M281.78,-54.84C271.76,-46.09 258.89,-34.85 248.62,-25.88"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="250.87,-23.21 241.04,-19.27 246.27,-28.48 250.87,-23.21"/>
 </g>
 <!-- Node6 -->
 <g id="node6" class="node">
@@ -90,8 +90,8 @@
 <!-- Node1&#45;&gt;Node6 -->
 <g id="edge5" class="edge">
 <title>Node1&#45;&gt;Node6</title>
-<path fill="none" stroke="#63b8ff" d="M320.74,-54.84C316.65,-46.87 311.51,-36.84 307.14,-28.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.17,-26.57 302.5,-19.27 303.94,-29.76 310.17,-26.57"/>
+<path fill="none" stroke="#63b8ff" d="M298,-54.84C298,-47.21 298,-37.7 298,-29.45"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="301.5,-29.27 298,-19.27 294.5,-29.27 301.5,-29.27"/>
 </g>
 <!-- Node7 -->
 <g id="node7" class="node">
@@ -105,8 +105,8 @@
 <!-- Node1&#45;&gt;Node7 -->
 <g id="edge6" class="edge">
 <title>Node1&#45;&gt;Node7</title>
-<path fill="none" stroke="#63b8ff" d="M335.5,-54.84C339.73,-46.87 345.04,-36.84 349.55,-28.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.77,-29.74 354.35,-19.27 346.58,-26.46 352.77,-29.74"/>
+<path fill="none" stroke="#63b8ff" d="M312.77,-54.84C321.71,-46.26 333.14,-35.3 342.4,-26.42"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="345.06,-28.71 349.86,-19.27 340.22,-23.66 345.06,-28.71"/>
 </g>
 <!-- Node8 -->
 <g id="node8" class="node">
@@ -120,8 +120,8 @@
 <!-- Node1&#45;&gt;Node8 -->
 <g id="edge7" class="edge">
 <title>Node1&#45;&gt;Node8</title>
-<path fill="none" stroke="#63b8ff" d="M351,-54.84C366,-45.6 385.5,-33.59 400.43,-24.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.36,-27.32 409.04,-19.09 398.69,-21.36 402.36,-27.32"/>
+<path fill="none" stroke="#63b8ff" d="M327.94,-54.99C348.42,-45.4 375.38,-32.79 395.35,-23.44"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="396.97,-26.55 404.54,-19.14 394,-20.21 396.97,-26.55"/>
 </g>
 <!-- Node9 -->
 <g id="node9" class="node">
@@ -135,8 +135,8 @@
 <!-- Node1&#45;&gt;Node9 -->
 <g id="edge8" class="edge">
 <title>Node1&#45;&gt;Node9</title>
-<path fill="none" stroke="#63b8ff" d="M367.52,-54.99C395.42,-45.1 432.41,-31.98 459,-22.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="460.38,-25.78 468.63,-19.14 458.04,-19.18 460.38,-25.78"/>
+<path fill="none" stroke="#63b8ff" d="M344.71,-54.99C378.87,-44.74 424.57,-31.03 456.17,-21.55"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="457.33,-24.86 465.9,-18.63 455.31,-18.15 457.33,-24.86"/>
 </g>
 <!-- Node10 -->
 <g id="node10" class="node">
@@ -150,23 +150,8 @@
 <!-- Node1&#45;&gt;Node10 -->
 <g id="edge9" class="edge">
 <title>Node1&#45;&gt;Node10</title>
-<path fill="none" stroke="#63b8ff" d="M384.53,-54.99C429.15,-43.93 490.05,-28.83 528.19,-19.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="529.44,-22.67 538.31,-16.87 527.76,-15.88 529.44,-22.67"/>
-</g>
-<!-- Node11 -->
-<g id="node11" class="node">
-<title>Node11</title>
-<g id="a_node11"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="652,-19 608,-19 608,0 652,0 652,-19"/>
-<text text-anchor="middle" x="630" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">omp.h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<path fill="none" stroke="#63b8ff" d="M395.15,-58.25C447.82,-49.44 523.17,-36.01 597.68,-19.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="598.74,-22.5 607.71,-16.86 597.18,-15.67 598.74,-22.5"/>
+<path fill="none" stroke="#63b8ff" d="M365.07,-54.95C408.88,-45.66 467.59,-33.01 528.59,-19.05"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="529.44,-22.44 538.4,-16.79 527.87,-15.62 529.44,-22.44"/>
 </g>
 </g>
 </svg>

d4/d28/pigeonhole__sort_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: sorting/pigeonhole_sort.cpp Pages: 1 -->
 <svg width="260pt" height="93pt"

d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: Trie::TrieNode Pages: 1 -->
 <svg width="115pt" height="104pt"

d4/d2f/fcfs__scheduling_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: cpu_scheduling_algorithms/fcfs_scheduling.cpp Pages: 1 -->
 <!--zoomable 93 -->

d4/d2f/fcfs__scheduling_8cpp__incl_org.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: cpu_scheduling_algorithms/fcfs_scheduling.cpp Pages: 1 -->
 <svg width="614pt" height="93pt"

d4/d31/range__queries_2sparse__table_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: range_queries/sparse_table.cpp Pages: 1 -->
 <svg width="266pt" height="93pt"

d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="136pt" height="64pt"

d4/d32/inorder__successor__of__bst_8cpp.html

@@ -170,21 +170,21 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p >An implementation for finding the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA" target="_blank">Inorder successor of a binary search tree</a> Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal. </p>
-<h3><a class="anchor" id="autotoc_md86"></a>
+<h3><a class="anchor" id="autotoc_md87"></a>
 Case 1: The given node has the right node/subtree</h3>
 <pre class="fragment"> * In this case, the left-most deepest node in the right subtree will
 </pre><p> come just after the given node as we go to left deep in inorder.</p><ul>
 <li>Go deep to left most node in right subtree. OR, we can also say in case if BST, find the minimum of the subtree for a given node.</li>
 </ul>
-<h3><a class="anchor" id="autotoc_md87"></a>
+<h3><a class="anchor" id="autotoc_md88"></a>
 Case 2: The given node does not have a right node/subtree</h3>
-<h4><a class="anchor" id="autotoc_md88"></a>
+<h4><a class="anchor" id="autotoc_md89"></a>
 Method 1: Use parent pointer (store the address of parent nodes)</h4>
 <ul>
 <li>If a node does not have the right subtree, and we already visited the node itself, then the next node will be its parent node according to inorder traversal, and if we are going to parent from left, then the parent would be unvisited.</li>
 <li>In other words, go to the nearest ancestor for which given node would be in left subtree.</li>
 </ul>
-<h4><a class="anchor" id="autotoc_md89"></a>
+<h4><a class="anchor" id="autotoc_md90"></a>
 Method 2: Search from the root node</h4>
 <ul>
 <li>In case if there is no link from a child node to the parent node, we need to walk down the tree starting from the root node to the given node, by doing so, we are visiting every ancestor of the given node.</li>

d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: operations_on_datastructures::inorder_traversal_of_bst::makeBST Pages: 1 -->
 <svg width="153pt" height="67pt"

d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <!--zoomable 208 -->

d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="623pt" height="208pt"

d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor Pages: 1 -->
 <svg width="458pt" height="144pt"

d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: operations_on_datastructures::inorder_traversal_of_bst::Insert Pages: 1 -->
 <svg width="334pt" height="67pt"

d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: operations_on_datastructures::inorder_traversal_of_bst::printInorder Pages: 1 -->
 <svg width="277pt" height="67pt"

d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: operations_on_datastructures::inorder_traversal_of_bst::findMinNode Pages: 1 -->
 <svg width="153pt" height="67pt"

d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: operations_on_datastructures::inorder_traversal_of_bst::deallocate Pages: 1 -->
 <svg width="153pt" height="67pt"

d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: operations_on_datastructures::inorder_traversal_of_bst::makeNode Pages: 1 -->
 <svg width="153pt" height="67pt"

d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: operations_on_datastructures::inorder_traversal_of_bst::getNode Pages: 1 -->
 <svg width="277pt" height="67pt"

d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <!--zoomable 167 -->

d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <svg width="549pt" height="167pt"

d4/d38/power__of__two_8cpp.html

@@ -139,7 +139,7 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p >Implementation to check whether a number is a power of 2 or not. </p>
 <p >This algorithm uses bit manipulation to check if a number is a power of 2 or not.</p>
-<h3><a class="anchor" id="autotoc_md83"></a>
+<h3><a class="anchor" id="autotoc_md84"></a>
 Algorithm</h3>
 <p >Let the input number be n, then the bitwise and between n and n-1 will let us know whether the number is power of 2 or not</p>
 <p >For Example, If N= 32 then N-1 is 31, if we perform bitwise and of these two numbers then the result will be zero, which indicates that it is the power of 2 If N=23 then N-1 is 22, if we perform bitwise and of these two numbers then the result will not be zero , which indicates that it is not the power of 2 </p><dl class="section note"><dt>Note</dt><dd>This implementation is better than naive recursive or iterative approach.</dd></dl>

d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <svg width="182pt" height="27pt"

d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: user_input_test Pages: 1 -->
 <svg width="232pt" height="64pt"

d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="256pt" height="27pt"

d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: backtracking::n_queens::solveNQ Pages: 1 -->
 <svg width="128pt" height="56pt"

d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: gcd Pages: 1 -->
 <svg width="40pt" height="45pt"

d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="136pt" height="82pt"

d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: bit_manipulation::hamming_distance::hamming_distance Pages: 1 -->
 <svg width="274pt" height="38pt"

d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: bit_manipulation::hamming_distance::bitCount Pages: 1 -->
 <svg width="141pt" height="56pt"

d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: bit_manipulation::hamming_distance::hamming_distance Pages: 1 -->
 <svg width="323pt" height="56pt"

d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="136pt" height="64pt"

d4/d59/large__factorial_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: math/large_factorial.cpp Pages: 1 -->
 <svg width="484pt" height="137pt"

d4/d5d/math_2armstrong__number_8cpp_a9cebd92bc70890c3cfa261d68a5016e7_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: is_armstrong Pages: 1 -->
 <svg width="208pt" height="64pt"

d4/d5d/math_2armstrong__number_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <svg width="277pt" height="64pt"

d4/d5d/math_2armstrong__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="351pt" height="64pt"

d4/d60/kohonen__som__trace_8cpp__incl.map

@@ -1,5 +1,5 @@
 <map id="machine_learning/kohonen_som_trace.cpp" name="machine_learning/kohonen_som_trace.cpp">
-<area shape="rect" id="node1" title="Kohonen self organizing map (data tracing)" alt="" coords="328,5,504,45"/>
+<area shape="rect" id="node1" title="Kohonen self organizing map (data tracing)" alt="" coords="285,5,461,45"/>
 <area shape="rect" id="node2" title=" " alt="" coords="5,93,80,119"/>
 <area shape="rect" id="node3" title=" " alt="" coords="104,93,155,119"/>
 <area shape="rect" id="node4" title=" " alt="" coords="179,93,237,119"/>
@@ -9,5 +9,4 @@
 <area shape="rect" id="node8" title=" " alt="" coords="516,93,588,119"/>
 <area shape="rect" id="node9" title=" " alt="" coords="613,93,681,119"/>
 <area shape="rect" id="node10" title=" " alt="" coords="705,93,764,119"/>
-<area shape="rect" id="node11" title=" " alt="" coords="788,93,847,119"/>
 </map>

d4/d60/kohonen__som__trace_8cpp__incl.md5

@@ -1 +1 @@
-e1467a2462edb0bf2c85e344ccea560d
+41823a0340525909950da21a4b887877

d4/d60/kohonen__som__trace_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: machine_learning/kohonen_som_trace.cpp Pages: 1 -->
 <!--zoomable 93 -->
@@ -46,7 +46,7 @@ if (edges && edges.length) {
         </defs>
 
 <script type="text/javascript">
-var viewWidth = 639;
+var viewWidth = 577;
 var viewHeight = 93;
 var sectionId = 'dynsection-0';
 </script>
@@ -58,9 +58,9 @@ var sectionId = 'dynsection-0';
 <g id="node1" class="node">
 <title>Node1</title>
 <g id="a_node1"><a xlink:title="Kohonen self organizing map (data tracing)">
-<polygon fill="#999999" stroke="#666666" points="374,-85 242,-85 242,-55 374,-55 374,-85"/>
-<text text-anchor="start" x="250" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning/kohonen</text>
-<text text-anchor="middle" x="308" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_som_trace.cpp</text>
+<polygon fill="#999999" stroke="#666666" points="342,-85 210,-85 210,-55 342,-55 342,-85"/>
+<text text-anchor="start" x="218" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning/kohonen</text>
+<text text-anchor="middle" x="276" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_som_trace.cpp</text>
 </a>
 </g>
 </g>
@@ -76,8 +76,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node2 -->
 <g id="edge1" class="edge">
 <title>Node1&#45;&gt;Node2</title>
-<path fill="none" stroke="#63b8ff" d="M241.91,-55.83C195.38,-46.45 131.38,-33.36 66.3,-19.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.78,-15.77 56.27,-17.06 65.29,-22.61 66.78,-15.77"/>
+<path fill="none" stroke="#63b8ff" d="M216.6,-54.99C169.93,-43.98 106.33,-28.98 66.22,-19.52"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="66.84,-16.07 56.3,-17.18 65.23,-22.88 66.84,-16.07"/>
 </g>
 <!-- Node3 -->
 <g id="node3" class="node">
@@ -91,8 +91,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node3 -->
 <g id="edge2" class="edge">
 <title>Node1&#45;&gt;Node3</title>
-<path fill="none" stroke="#63b8ff" d="M253.45,-54.93C218.35,-45.76 171.52,-33.3 121.88,-19.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.83,-15.82 112.25,-16.44 120.91,-22.55 122.83,-15.82"/>
+<path fill="none" stroke="#63b8ff" d="M232.17,-54.99C198.12,-44.1 151.84,-29.31 122.2,-19.83"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="123.04,-16.43 112.45,-16.72 120.91,-23.1 123.04,-16.43"/>
 </g>
 <!-- Node4 -->
 <g id="node4" class="node">
@@ -106,8 +106,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node4 -->
 <g id="edge3" class="edge">
 <title>Node1&#45;&gt;Node4</title>
-<path fill="none" stroke="#63b8ff" d="M270.63,-54.99C244.06,-45.02 208.74,-31.78 183.57,-22.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.72,-19.03 174.13,-18.8 182.26,-25.59 184.72,-19.03"/>
+<path fill="none" stroke="#63b8ff" d="M246.3,-54.99C225.98,-45.4 199.24,-32.79 179.42,-23.44"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="180.85,-20.24 170.31,-19.14 177.86,-26.57 180.85,-20.24"/>
 </g>
 <!-- Node5 -->
 <g id="node5" class="node">
@@ -121,8 +121,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node5 -->
 <g id="edge4" class="edge">
 <title>Node1&#45;&gt;Node5</title>
-<path fill="none" stroke="#63b8ff" d="M285.49,-54.84C270.94,-45.68 252.07,-33.82 237.51,-24.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.99,-21.46 228.66,-19.09 235.26,-27.38 238.99,-21.46"/>
+<path fill="none" stroke="#63b8ff" d="M261.23,-54.84C252.29,-46.26 240.86,-35.3 231.6,-26.42"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="233.78,-23.66 224.14,-19.27 228.94,-28.71 233.78,-23.66"/>
 </g>
 <!-- Node6 -->
 <g id="node6" class="node">
@@ -136,8 +136,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node6 -->
 <g id="edge5" class="edge">
 <title>Node1&#45;&gt;Node6</title>
-<path fill="none" stroke="#63b8ff" d="M300.25,-54.84C295.85,-46.78 290.29,-36.62 285.6,-28.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.66,-26.36 280.8,-19.27 282.52,-29.72 288.66,-26.36"/>
+<path fill="none" stroke="#63b8ff" d="M276,-54.84C276,-47.21 276,-37.7 276,-29.45"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="279.5,-29.27 276,-19.27 272.5,-29.27 279.5,-29.27"/>
 </g>
 <!-- Node7 -->
 <g id="node7" class="node">
@@ -151,8 +151,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node7 -->
 <g id="edge6" class="edge">
 <title>Node1&#45;&gt;Node7</title>
-<path fill="none" stroke="#63b8ff" d="M315.75,-54.84C320.15,-46.78 325.71,-36.62 330.4,-28.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.48,-29.72 335.2,-19.27 327.34,-26.36 333.48,-29.72"/>
+<path fill="none" stroke="#63b8ff" d="M291.49,-54.84C300.97,-46.17 313.11,-35.08 322.88,-26.15"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="325.39,-28.6 330.41,-19.27 320.67,-23.43 325.39,-28.6"/>
 </g>
 <!-- Node8 -->
 <g id="node8" class="node">
@@ -166,8 +166,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node8 -->
 <g id="edge7" class="edge">
 <title>Node1&#45;&gt;Node8</title>
-<path fill="none" stroke="#63b8ff" d="M332.43,-54.99C348.69,-45.66 369.95,-33.47 386.1,-24.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388,-27.15 394.94,-19.14 384.52,-21.08 388,-27.15"/>
+<path fill="none" stroke="#63b8ff" d="M308.1,-54.99C330.25,-45.31 359.48,-32.56 380.95,-23.18"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="382.45,-26.35 390.21,-19.14 379.65,-19.93 382.45,-26.35"/>
 </g>
 <!-- Node9 -->
 <g id="node9" class="node">
@@ -181,8 +181,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node9 -->
 <g id="edge8" class="edge">
 <title>Node1&#45;&gt;Node9</title>
-<path fill="none" stroke="#63b8ff" d="M349.44,-54.99C378.91,-45.02 418.06,-31.78 445.97,-22.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="447.35,-25.57 455.7,-19.05 445.11,-18.94 447.35,-25.57"/>
+<path fill="none" stroke="#63b8ff" d="M325.1,-54.99C362.24,-44.39 412.37,-30.09 445.64,-20.59"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="446.73,-23.92 455.39,-17.81 444.81,-17.19 446.73,-23.92"/>
 </g>
 <!-- Node10 -->
 <g id="node10" class="node">
@@ -196,23 +196,8 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node10 -->
 <g id="edge9" class="edge">
 <title>Node1&#45;&gt;Node10</title>
-<path fill="none" stroke="#63b8ff" d="M368.65,-54.96C407.85,-45.75 460.21,-33.24 514.81,-19.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="515.86,-22.59 524.67,-16.71 514.11,-15.81 515.86,-22.59"/>
-</g>
-<!-- Node11 -->
-<g id="node11" class="node">
-<title>Node11</title>
-<g id="a_node11"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="631,-19 587,-19 587,0 631,0 631,-19"/>
-<text text-anchor="middle" x="609" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">omp.h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<path fill="none" stroke="#63b8ff" d="M374.07,-58.37C426.57,-49.55 502.06,-36.07 576.66,-19.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="577.74,-22.5 586.71,-16.86 576.18,-15.67 577.74,-22.5"/>
+<path fill="none" stroke="#63b8ff" d="M342.21,-56.36C388.18,-47.31 451.06,-34.42 514.86,-19.16"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="515.79,-22.54 524.69,-16.8 514.15,-15.73 515.79,-22.54"/>
 </g>
 </g>
 </svg>

d4/d60/kohonen__som__trace_8cpp__incl_org.svg

@@ -1,20 +1,20 @@
 <?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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: machine_learning/kohonen_som_trace.cpp Pages: 1 -->
-<svg width="639pt" height="93pt"
- viewBox="0.00 0.00 639.00 93.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="577pt" height="93pt"
+ viewBox="0.00 0.00 577.00 93.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 89)">
 <title>machine_learning/kohonen_som_trace.cpp</title>
 <!-- Node1 -->
 <g id="node1" class="node">
 <title>Node1</title>
 <g id="a_node1"><a xlink:title="Kohonen self organizing map (data tracing)">
-<polygon fill="#999999" stroke="#666666" points="374,-85 242,-85 242,-55 374,-55 374,-85"/>
-<text text-anchor="start" x="250" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning/kohonen</text>
-<text text-anchor="middle" x="308" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_som_trace.cpp</text>
+<polygon fill="#999999" stroke="#666666" points="342,-85 210,-85 210,-55 342,-55 342,-85"/>
+<text text-anchor="start" x="218" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning/kohonen</text>
+<text text-anchor="middle" x="276" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_som_trace.cpp</text>
 </a>
 </g>
 </g>
@@ -30,8 +30,8 @@
 <!-- Node1&#45;&gt;Node2 -->
 <g id="edge1" class="edge">
 <title>Node1&#45;&gt;Node2</title>
-<path fill="none" stroke="#63b8ff" d="M241.91,-55.83C195.38,-46.45 131.38,-33.36 66.3,-19.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.78,-15.77 56.27,-17.06 65.29,-22.61 66.78,-15.77"/>
+<path fill="none" stroke="#63b8ff" d="M216.6,-54.99C169.93,-43.98 106.33,-28.98 66.22,-19.52"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="66.84,-16.07 56.3,-17.18 65.23,-22.88 66.84,-16.07"/>
 </g>
 <!-- Node3 -->
 <g id="node3" class="node">
@@ -45,8 +45,8 @@
 <!-- Node1&#45;&gt;Node3 -->
 <g id="edge2" class="edge">
 <title>Node1&#45;&gt;Node3</title>
-<path fill="none" stroke="#63b8ff" d="M253.45,-54.93C218.35,-45.76 171.52,-33.3 121.88,-19.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.83,-15.82 112.25,-16.44 120.91,-22.55 122.83,-15.82"/>
+<path fill="none" stroke="#63b8ff" d="M232.17,-54.99C198.12,-44.1 151.84,-29.31 122.2,-19.83"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="123.04,-16.43 112.45,-16.72 120.91,-23.1 123.04,-16.43"/>
 </g>
 <!-- Node4 -->
 <g id="node4" class="node">
@@ -60,8 +60,8 @@
 <!-- Node1&#45;&gt;Node4 -->
 <g id="edge3" class="edge">
 <title>Node1&#45;&gt;Node4</title>
-<path fill="none" stroke="#63b8ff" d="M270.63,-54.99C244.06,-45.02 208.74,-31.78 183.57,-22.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.72,-19.03 174.13,-18.8 182.26,-25.59 184.72,-19.03"/>
+<path fill="none" stroke="#63b8ff" d="M246.3,-54.99C225.98,-45.4 199.24,-32.79 179.42,-23.44"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="180.85,-20.24 170.31,-19.14 177.86,-26.57 180.85,-20.24"/>
 </g>
 <!-- Node5 -->
 <g id="node5" class="node">
@@ -75,8 +75,8 @@
 <!-- Node1&#45;&gt;Node5 -->
 <g id="edge4" class="edge">
 <title>Node1&#45;&gt;Node5</title>
-<path fill="none" stroke="#63b8ff" d="M285.49,-54.84C270.94,-45.68 252.07,-33.82 237.51,-24.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.99,-21.46 228.66,-19.09 235.26,-27.38 238.99,-21.46"/>
+<path fill="none" stroke="#63b8ff" d="M261.23,-54.84C252.29,-46.26 240.86,-35.3 231.6,-26.42"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="233.78,-23.66 224.14,-19.27 228.94,-28.71 233.78,-23.66"/>
 </g>
 <!-- Node6 -->
 <g id="node6" class="node">
@@ -90,8 +90,8 @@
 <!-- Node1&#45;&gt;Node6 -->
 <g id="edge5" class="edge">
 <title>Node1&#45;&gt;Node6</title>
-<path fill="none" stroke="#63b8ff" d="M300.25,-54.84C295.85,-46.78 290.29,-36.62 285.6,-28.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.66,-26.36 280.8,-19.27 282.52,-29.72 288.66,-26.36"/>
+<path fill="none" stroke="#63b8ff" d="M276,-54.84C276,-47.21 276,-37.7 276,-29.45"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="279.5,-29.27 276,-19.27 272.5,-29.27 279.5,-29.27"/>
 </g>
 <!-- Node7 -->
 <g id="node7" class="node">
@@ -105,8 +105,8 @@
 <!-- Node1&#45;&gt;Node7 -->
 <g id="edge6" class="edge">
 <title>Node1&#45;&gt;Node7</title>
-<path fill="none" stroke="#63b8ff" d="M315.75,-54.84C320.15,-46.78 325.71,-36.62 330.4,-28.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.48,-29.72 335.2,-19.27 327.34,-26.36 333.48,-29.72"/>
+<path fill="none" stroke="#63b8ff" d="M291.49,-54.84C300.97,-46.17 313.11,-35.08 322.88,-26.15"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="325.39,-28.6 330.41,-19.27 320.67,-23.43 325.39,-28.6"/>
 </g>
 <!-- Node8 -->
 <g id="node8" class="node">
@@ -120,8 +120,8 @@
 <!-- Node1&#45;&gt;Node8 -->
 <g id="edge7" class="edge">
 <title>Node1&#45;&gt;Node8</title>
-<path fill="none" stroke="#63b8ff" d="M332.43,-54.99C348.69,-45.66 369.95,-33.47 386.1,-24.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388,-27.15 394.94,-19.14 384.52,-21.08 388,-27.15"/>
+<path fill="none" stroke="#63b8ff" d="M308.1,-54.99C330.25,-45.31 359.48,-32.56 380.95,-23.18"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="382.45,-26.35 390.21,-19.14 379.65,-19.93 382.45,-26.35"/>
 </g>
 <!-- Node9 -->
 <g id="node9" class="node">
@@ -135,8 +135,8 @@
 <!-- Node1&#45;&gt;Node9 -->
 <g id="edge8" class="edge">
 <title>Node1&#45;&gt;Node9</title>
-<path fill="none" stroke="#63b8ff" d="M349.44,-54.99C378.91,-45.02 418.06,-31.78 445.97,-22.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="447.35,-25.57 455.7,-19.05 445.11,-18.94 447.35,-25.57"/>
+<path fill="none" stroke="#63b8ff" d="M325.1,-54.99C362.24,-44.39 412.37,-30.09 445.64,-20.59"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="446.73,-23.92 455.39,-17.81 444.81,-17.19 446.73,-23.92"/>
 </g>
 <!-- Node10 -->
 <g id="node10" class="node">
@@ -150,23 +150,8 @@
 <!-- Node1&#45;&gt;Node10 -->
 <g id="edge9" class="edge">
 <title>Node1&#45;&gt;Node10</title>
-<path fill="none" stroke="#63b8ff" d="M368.65,-54.96C407.85,-45.75 460.21,-33.24 514.81,-19.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="515.86,-22.59 524.67,-16.71 514.11,-15.81 515.86,-22.59"/>
-</g>
-<!-- Node11 -->
-<g id="node11" class="node">
-<title>Node11</title>
-<g id="a_node11"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="631,-19 587,-19 587,0 631,0 631,-19"/>
-<text text-anchor="middle" x="609" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">omp.h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<path fill="none" stroke="#63b8ff" d="M374.07,-58.37C426.57,-49.55 502.06,-36.07 576.66,-19.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="577.74,-22.5 586.71,-16.86 576.18,-15.67 577.74,-22.5"/>
+<path fill="none" stroke="#63b8ff" d="M342.21,-56.36C388.18,-47.31 451.06,-34.42 514.86,-19.16"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="515.79,-22.54 524.69,-16.8 514.15,-15.73 515.79,-22.54"/>
 </g>
 </g>
 </svg>

d4/d68/qr__decompose_8h.html

@@ -113,11 +113,10 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h.html','../../'
 <code>#include &lt;limits&gt;</code><br />
 <code>#include &lt;numeric&gt;</code><br />
 <code>#include &lt;valarray&gt;</code><br />
-<code>#include &lt;omp.h&gt;</code><br />
 </div><div class="textblock"><div class="dynheader">
 Include dependency graph for qr_decompose.h:</div>
 <div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/d04/qr__decompose_8h__incl.svg" width="100%" height="393"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d04/qr__decompose_8h__incl.svg" width="604" height="124"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
 </div>
 </div>
 </div><div class="textblock"><div class="dynheader">

d4/d72/qr__eigen__values_8cpp__incl.map

@@ -1,14 +1,13 @@
 <map id="numerical_methods/qr_eigen_values.cpp" name="numerical_methods/qr_eigen_values.cpp">
-<area shape="rect" id="node1" title="Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method." alt="" coords="135,5,285,45"/>
+<area shape="rect" id="node1" title="Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method." alt="" coords="109,5,260,45"/>
 <area shape="rect" id="node2" title=" " alt="" coords="5,93,71,119"/>
-<area shape="rect" id="node3" title=" " alt="" coords="26,167,85,192"/>
-<area shape="rect" id="node4" title=" " alt="" coords="109,167,169,192"/>
-<area shape="rect" id="node5" title=" " alt="" coords="449,93,504,119"/>
-<area shape="rect" id="node6" title=" " alt="" coords="194,167,266,192"/>
-<area shape="rect" id="node7" title=" " alt="" coords="290,167,349,192"/>
-<area shape="rect" id="node8" href="$d4/d68/qr__decompose_8h.html" title="Library functions to compute QR decomposition of a given matrix." alt="" coords="299,93,425,119"/>
-<area shape="rect" id="node9" title=" " alt="" coords="373,167,439,192"/>
-<area shape="rect" id="node10" title=" " alt="" coords="463,167,517,192"/>
-<area shape="rect" id="node11" title=" " alt="" coords="541,167,609,192"/>
-<area shape="rect" id="node12" title=" " alt="" coords="633,167,701,192"/>
+<area shape="rect" id="node3" title=" " alt="" coords="33,167,91,192"/>
+<area shape="rect" id="node4" title=" " alt="" coords="116,167,176,192"/>
+<area shape="rect" id="node5" title=" " alt="" coords="399,93,453,119"/>
+<area shape="rect" id="node6" title=" " alt="" coords="201,167,273,192"/>
+<area shape="rect" id="node7" href="$d4/d68/qr__decompose_8h.html" title="Library functions to compute QR decomposition of a given matrix." alt="" coords="248,93,375,119"/>
+<area shape="rect" id="node8" title=" " alt="" coords="559,167,626,192"/>
+<area shape="rect" id="node9" title=" " alt="" coords="297,167,350,192"/>
+<area shape="rect" id="node10" title=" " alt="" coords="375,167,443,192"/>
+<area shape="rect" id="node11" title=" " alt="" coords="467,167,535,192"/>
 </map>

d4/d72/qr__eigen__values_8cpp__incl.md5

@@ -1 +1 @@
-32835cc7889e58e02df1b861b7c81c9d
+14d04469537ec56320bc8e1c8a3280a6

d4/d72/qr__eigen__values_8cpp__incl.svg

@@ -1,66 +1,20 @@
 <?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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: numerical_methods/qr_eigen_values.cpp Pages: 1 -->
-<!--zoomable 148 -->
-<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 = 530;
-var viewHeight = 148;
-var sectionId = 'dynsection-0';
-</script>
-<script xlink:href="../../svgpan.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
+<svg width="474pt" height="148pt"
+ viewBox="0.00 0.00 473.50 148.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 144)">
 <title>numerical_methods/qr_eigen_values.cpp</title>
 <!-- Node1 -->
 <g id="node1" class="node">
 <title>Node1</title>
 <g id="a_node1"><a xlink:title="Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method.">
-<polygon fill="#999999" stroke="#666666" points="210,-140 97,-140 97,-110 210,-110 210,-140"/>
-<text text-anchor="start" x="105" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/qr</text>
-<text text-anchor="middle" x="153.5" y="-117" font-family="Helvetica,sans-Serif" font-size="10.00">_eigen_values.cpp</text>
+<polygon fill="#999999" stroke="#666666" points="191,-140 78,-140 78,-110 191,-110 191,-140"/>
+<text text-anchor="start" x="86" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/qr</text>
+<text text-anchor="middle" x="134.5" y="-117" font-family="Helvetica,sans-Serif" font-size="10.00">_eigen_values.cpp</text>
 </a>
 </g>
 </g>
@@ -76,224 +30,161 @@ var sectionId = 'dynsection-0';
 <!-- Node1&#45;&gt;Node2 -->
 <g id="edge1" class="edge">
 <title>Node1&#45;&gt;Node2</title>
-<path fill="none" stroke="#63b8ff" d="M122.6,-109.99C101.37,-100.36 73.39,-87.67 52.75,-78.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="54.1,-75.08 43.55,-74.14 51.21,-81.46 54.1,-75.08"/>
+<path fill="none" stroke="#63b8ff" d="M108.15,-109.99C90.45,-100.58 67.27,-88.24 49.79,-78.95"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="51.22,-75.74 40.74,-74.14 47.93,-81.92 51.22,-75.74"/>
 </g>
 <!-- Node3 -->
 <g id="node3" class="node">
 <title>Node3</title>
 <g id="a_node3"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="59.5,-19 15.5,-19 15.5,0 59.5,0 59.5,-19"/>
-<text text-anchor="middle" x="37.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</text>
+<polygon fill="#e0e0e0" stroke="#999999" points="64.5,-19 20.5,-19 20.5,0 64.5,0 64.5,-19"/>
+<text text-anchor="middle" x="42.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</text>
 </a>
 </g>
 </g>
 <!-- Node1&#45;&gt;Node3 -->
 <g id="edge2" class="edge">
 <title>Node1&#45;&gt;Node3</title>
-<path fill="none" stroke="#63b8ff" d="M138.81,-109.63C116.99,-88.28 76.19,-48.36 53.59,-26.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.02,-23.72 46.42,-19.23 51.12,-28.72 56.02,-23.72"/>
+<path fill="none" stroke="#63b8ff" d="M122.85,-109.63C105.77,-88.56 74.03,-49.4 55.98,-27.13"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="58.59,-24.79 49.58,-19.23 53.15,-29.2 58.59,-24.79"/>
 </g>
 <!-- Node4 -->
 <g id="node4" class="node">
 <title>Node4</title>
 <g id="a_node4"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="123,-19 78,-19 78,0 123,0 123,-19"/>
-<text text-anchor="middle" x="100.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
+<polygon fill="#e0e0e0" stroke="#999999" points="128,-19 83,-19 83,0 128,0 128,-19"/>
+<text text-anchor="middle" x="105.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
 </a>
 </g>
 </g>
 <!-- Node1&#45;&gt;Node4 -->
 <g id="edge3" class="edge">
 <title>Node1&#45;&gt;Node4</title>
-<path fill="none" stroke="#63b8ff" d="M146.79,-109.63C137.13,-88.93 119.31,-50.78 108.82,-28.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.98,-26.81 104.58,-19.23 105.64,-29.77 111.98,-26.81"/>
+<path fill="none" stroke="#63b8ff" d="M130.83,-109.63C125.59,-89.12 115.97,-51.47 110.21,-28.93"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="113.6,-28.05 107.73,-19.23 106.81,-29.78 113.6,-28.05"/>
 </g>
 <!-- Node5 -->
 <g id="node5" class="node">
 <title>Node5</title>
 <g id="a_node5"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="374,-74 333,-74 333,-55 374,-55 374,-74"/>
-<text text-anchor="middle" x="353.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
+<polygon fill="#e0e0e0" stroke="#999999" points="336,-74 295,-74 295,-55 336,-55 336,-74"/>
+<text text-anchor="middle" x="315.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
 </a>
 </g>
 </g>
 <!-- Node1&#45;&gt;Node5 -->
 <g id="edge4" class="edge">
 <title>Node1&#45;&gt;Node5</title>
-<path fill="none" stroke="#63b8ff" d="M201.41,-110C233.49,-100.63 276.91,-87.93 323.28,-74.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.29,-77.71 332.91,-71.54 322.32,-70.99 324.29,-77.71"/>
+<path fill="none" stroke="#63b8ff" d="M177.85,-109.99C210.97,-99.28 255.78,-84.8 285.14,-75.31"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="286.4,-78.58 294.84,-72.18 284.25,-71.92 286.4,-78.58"/>
 </g>
 <!-- Node6 -->
 <g id="node6" class="node">
 <title>Node6</title>
 <g id="a_node6"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="195.5,-19 141.5,-19 141.5,0 195.5,0 195.5,-19"/>
-<text text-anchor="middle" x="168.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
+<polygon fill="#e0e0e0" stroke="#999999" points="200.5,-19 146.5,-19 146.5,0 200.5,0 200.5,-19"/>
+<text text-anchor="middle" x="173.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
 </a>
 </g>
 </g>
 <!-- Node1&#45;&gt;Node6 -->
 <g id="edge5" class="edge">
 <title>Node1&#45;&gt;Node6</title>
-<path fill="none" stroke="#63b8ff" d="M155.4,-109.63C158.1,-89.21 163.04,-51.81 166.02,-29.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.51,-29.6 167.35,-19.23 162.57,-28.68 169.51,-29.6"/>
+<path fill="none" stroke="#63b8ff" d="M139.44,-109.63C146.49,-89.12 159.42,-51.47 167.17,-28.93"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="170.56,-29.82 170.5,-19.23 163.94,-27.55 170.56,-29.82"/>
 </g>
 <!-- Node7 -->
 <g id="node7" class="node">
 <title>Node7</title>
-<g id="a_node7"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="257.5,-19 213.5,-19 213.5,0 257.5,0 257.5,-19"/>
-<text text-anchor="middle" x="235.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">omp.h</text>
+<g id="a_node7"><a xlink:href="../../d4/d68/qr__decompose_8h.html" target="_top" xlink:title="Library functions to compute QR decomposition of a given matrix.">
+<polygon fill="white" stroke="#666666" points="277,-74 182,-74 182,-55 277,-55 277,-74"/>
+<text text-anchor="middle" x="229.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">./qr_decompose.h</text>
 </a>
 </g>
 </g>
 <!-- Node1&#45;&gt;Node7 -->
 <g id="edge6" class="edge">
 <title>Node1&#45;&gt;Node7</title>
-<path fill="none" stroke="#63b8ff" d="M163.89,-109.63C179.04,-88.65 207.15,-49.75 223.27,-27.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.17,-29.38 229.19,-19.23 220.5,-25.29 226.17,-29.38"/>
+<path fill="none" stroke="#63b8ff" d="M157.5,-109.84C172.5,-100.6 192,-88.59 206.93,-79.4"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="208.86,-82.32 215.54,-74.09 205.19,-76.36 208.86,-82.32"/>
+</g>
+<!-- Node7&#45;&gt;Node3 -->
+<g id="edge7" class="edge">
+<title>Node7&#45;&gt;Node3</title>
+<path fill="none" stroke="#63b8ff" d="M199.46,-54.98C165.16,-45.26 109.29,-29.43 74.28,-19.51"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="75.14,-16.11 64.57,-16.75 73.23,-22.85 75.14,-16.11"/>
+</g>
+<!-- Node7&#45;&gt;Node4 -->
+<g id="edge8" class="edge">
+<title>Node7&#45;&gt;Node4</title>
+<path fill="none" stroke="#63b8ff" d="M209.58,-54.98C189.45,-46.38 158.12,-32.99 135.09,-23.15"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="136.36,-19.88 125.79,-19.17 133.6,-26.32 136.36,-19.88"/>
+</g>
+<!-- Node7&#45;&gt;Node6 -->
+<g id="edge10" class="edge">
+<title>Node7&#45;&gt;Node6</title>
+<path fill="none" stroke="#63b8ff" d="M220.5,-54.98C212.31,-47.23 199.99,-35.58 190.03,-26.14"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="192.33,-23.5 182.66,-19.17 187.52,-28.59 192.33,-23.5"/>
 </g>
 <!-- Node8 -->
 <g id="node8" class="node">
 <title>Node8</title>
-<g id="a_node8"><a xlink:href="../../d4/d68/qr__decompose_8h.html" target="_top" xlink:title="Library functions to compute QR decomposition of a given matrix.">
-<polygon fill="white" stroke="#666666" points="315,-74 220,-74 220,-55 315,-55 315,-74"/>
-<text text-anchor="middle" x="267.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">./qr_decompose.h</text>
+<g id="a_node8"><a xlink:title=" ">
+<polygon fill="#e0e0e0" stroke="#999999" points="465.5,-19 415.5,-19 415.5,0 465.5,0 465.5,-19"/>
+<text text-anchor="middle" x="440.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iomanip</text>
 </a>
 </g>
 </g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<path fill="none" stroke="#63b8ff" d="M180.81,-109.99C199.15,-100.58 223.18,-88.24 241.29,-78.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.37,-81.82 250.66,-74.14 240.17,-75.59 243.37,-81.82"/>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge8" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<path fill="none" stroke="#63b8ff" d="M226.59,-54.95C188.39,-46.83 129.57,-33.99 69.8,-19.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.37,-15.77 59.82,-16.76 68.68,-22.56 70.37,-15.77"/>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
+<!-- Node7&#45;&gt;Node8 -->
 <g id="edge9" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<path fill="none" stroke="#63b8ff" d="M240.67,-54.98C211.3,-45.66 164.22,-30.72 132.84,-20.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.83,-17.41 123.24,-17.72 131.71,-24.08 133.83,-17.41"/>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge11" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<path fill="none" stroke="#63b8ff" d="M251.59,-54.98C235.95,-46.61 211.84,-33.7 193.62,-23.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.16,-20.8 184.7,-19.17 191.86,-26.98 195.16,-20.8"/>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge15" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<path fill="none" stroke="#63b8ff" d="M262.22,-54.75C257.79,-47.42 251.34,-36.73 245.88,-27.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.85,-25.84 240.69,-19.09 242.86,-29.46 248.85,-25.84"/>
+<title>Node7&#45;&gt;Node8</title>
+<path fill="none" stroke="#63b8ff" d="M263.4,-54.98C302.41,-45.19 366.14,-29.18 405.58,-19.27"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="406.44,-22.66 415.29,-16.83 404.74,-15.87 406.44,-22.66"/>
 </g>
 <!-- Node9 -->
 <g id="node9" class="node">
 <title>Node9</title>
 <g id="a_node9"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="325.5,-19 275.5,-19 275.5,0 325.5,0 325.5,-19"/>
-<text text-anchor="middle" x="300.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iomanip</text>
+<polygon fill="#e0e0e0" stroke="#999999" points="258.5,-19 218.5,-19 218.5,0 258.5,0 258.5,-19"/>
+<text text-anchor="middle" x="238.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">limits</text>
 </a>
 </g>
 </g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge10" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<path fill="none" stroke="#63b8ff" d="M272.95,-54.75C277.51,-47.42 284.17,-36.73 289.79,-27.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.84,-29.43 295.15,-19.09 286.9,-25.73 292.84,-29.43"/>
+<!-- Node7&#45;&gt;Node9 -->
+<g id="edge11" class="edge">
+<title>Node7&#45;&gt;Node9</title>
+<path fill="none" stroke="#63b8ff" d="M230.99,-54.75C232.17,-47.8 233.86,-37.85 235.34,-29.13"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="238.82,-29.53 237.04,-19.09 231.92,-28.36 238.82,-29.53"/>
 </g>
 <!-- Node10 -->
 <g id="node10" class="node">
 <title>Node10</title>
 <g id="a_node10"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="383.5,-19 343.5,-19 343.5,0 383.5,0 383.5,-19"/>
-<text text-anchor="middle" x="363.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">limits</text>
+<polygon fill="#e0e0e0" stroke="#999999" points="328,-19 277,-19 277,0 328,0 328,-19"/>
+<text text-anchor="middle" x="302.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">numeric</text>
 </a>
 </g>
 </g>
-<!-- Node8&#45;&gt;Node10 -->
+<!-- Node7&#45;&gt;Node10 -->
 <g id="edge12" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<path fill="none" stroke="#63b8ff" d="M282.92,-54.98C297.95,-46.69 321.04,-33.94 338.66,-24.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.73,-27.07 347.8,-19.17 337.35,-20.94 340.73,-27.07"/>
+<title>Node7&#45;&gt;Node10</title>
+<path fill="none" stroke="#63b8ff" d="M241.23,-54.98C252.23,-47 268.92,-34.88 282.1,-25.31"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="284.52,-27.88 290.56,-19.17 280.41,-22.21 284.52,-27.88"/>
 </g>
 <!-- Node11 -->
 <g id="node11" class="node">
 <title>Node11</title>
 <g id="a_node11"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="453,-19 402,-19 402,0 453,0 453,-19"/>
-<text text-anchor="middle" x="427.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">numeric</text>
+<polygon fill="#e0e0e0" stroke="#999999" points="397,-19 346,-19 346,0 397,0 397,-19"/>
+<text text-anchor="middle" x="371.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">valarray</text>
 </a>
 </g>
 </g>
-<!-- Node8&#45;&gt;Node11 -->
+<!-- Node7&#45;&gt;Node11 -->
 <g id="edge13" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<path fill="none" stroke="#63b8ff" d="M293.21,-54.98C320.03,-46.1 362.28,-32.1 392.22,-22.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.46,-25.46 401.86,-18.99 391.26,-18.82 393.46,-25.46"/>
-</g>
-<!-- Node12 -->
-<g id="node12" class="node">
-<title>Node12</title>
-<g id="a_node12"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="522,-19 471,-19 471,0 522,0 522,-19"/>
-<text text-anchor="middle" x="496.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">valarray</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node12 -->
-<g id="edge14" class="edge">
-<title>Node8&#45;&gt;Node12</title>
-<path fill="none" stroke="#63b8ff" d="M306.03,-54.95C343.33,-46.62 401.73,-33.44 460.99,-19.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.98,-22.69 470.89,-16.96 460.35,-15.88 461.98,-22.69"/>
+<title>Node7&#45;&gt;Node11</title>
+<path fill="none" stroke="#63b8ff" d="M252.31,-54.98C275.67,-46.27 312.2,-32.63 338.67,-22.75"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="340.13,-25.95 348.27,-19.17 337.68,-19.39 340.13,-25.95"/>
 </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="qr__eigen__values_8cpp__incl_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>

d4/d72/qr__eigen__values_8cpp__incl_org.svg

@@ -1,211 +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 6.0.1 (20220911.1526)
- -->
-<!-- Title: numerical_methods/qr_eigen_values.cpp Pages: 1 -->
-<svg width="530pt" height="148pt"
- viewBox="0.00 0.00 530.00 148.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 144)">
-<title>numerical_methods/qr_eigen_values.cpp</title>
-<!-- Node1 -->
-<g id="node1" class="node">
-<title>Node1</title>
-<g id="a_node1"><a xlink:title="Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method.">
-<polygon fill="#999999" stroke="#666666" points="210,-140 97,-140 97,-110 210,-110 210,-140"/>
-<text text-anchor="start" x="105" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/qr</text>
-<text text-anchor="middle" x="153.5" y="-117" font-family="Helvetica,sans-Serif" font-size="10.00">_eigen_values.cpp</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="node2" class="node">
-<title>Node2</title>
-<g id="a_node2"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="49,-74 0,-74 0,-55 49,-55 49,-74"/>
-<text text-anchor="middle" x="24.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<path fill="none" stroke="#63b8ff" d="M122.6,-109.99C101.37,-100.36 73.39,-87.67 52.75,-78.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="54.1,-75.08 43.55,-74.14 51.21,-81.46 54.1,-75.08"/>
-</g>
-<!-- Node3 -->
-<g id="node3" class="node">
-<title>Node3</title>
-<g id="a_node3"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="59.5,-19 15.5,-19 15.5,0 59.5,0 59.5,-19"/>
-<text text-anchor="middle" x="37.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<path fill="none" stroke="#63b8ff" d="M138.81,-109.63C116.99,-88.28 76.19,-48.36 53.59,-26.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.02,-23.72 46.42,-19.23 51.12,-28.72 56.02,-23.72"/>
-</g>
-<!-- Node4 -->
-<g id="node4" class="node">
-<title>Node4</title>
-<g id="a_node4"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="123,-19 78,-19 78,0 123,0 123,-19"/>
-<text text-anchor="middle" x="100.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<path fill="none" stroke="#63b8ff" d="M146.79,-109.63C137.13,-88.93 119.31,-50.78 108.82,-28.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.98,-26.81 104.58,-19.23 105.64,-29.77 111.98,-26.81"/>
-</g>
-<!-- Node5 -->
-<g id="node5" class="node">
-<title>Node5</title>
-<g id="a_node5"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="374,-74 333,-74 333,-55 374,-55 374,-74"/>
-<text text-anchor="middle" x="353.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<path fill="none" stroke="#63b8ff" d="M201.41,-110C233.49,-100.63 276.91,-87.93 323.28,-74.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.29,-77.71 332.91,-71.54 322.32,-70.99 324.29,-77.71"/>
-</g>
-<!-- Node6 -->
-<g id="node6" class="node">
-<title>Node6</title>
-<g id="a_node6"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="195.5,-19 141.5,-19 141.5,0 195.5,0 195.5,-19"/>
-<text text-anchor="middle" x="168.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<path fill="none" stroke="#63b8ff" d="M155.4,-109.63C158.1,-89.21 163.04,-51.81 166.02,-29.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.51,-29.6 167.35,-19.23 162.57,-28.68 169.51,-29.6"/>
-</g>
-<!-- Node7 -->
-<g id="node7" class="node">
-<title>Node7</title>
-<g id="a_node7"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="257.5,-19 213.5,-19 213.5,0 257.5,0 257.5,-19"/>
-<text text-anchor="middle" x="235.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">omp.h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<path fill="none" stroke="#63b8ff" d="M163.89,-109.63C179.04,-88.65 207.15,-49.75 223.27,-27.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.17,-29.38 229.19,-19.23 220.5,-25.29 226.17,-29.38"/>
-</g>
-<!-- Node8 -->
-<g id="node8" class="node">
-<title>Node8</title>
-<g id="a_node8"><a xlink:href="../../d4/d68/qr__decompose_8h.html" target="_top" xlink:title="Library functions to compute QR decomposition of a given matrix.">
-<polygon fill="white" stroke="#666666" points="315,-74 220,-74 220,-55 315,-55 315,-74"/>
-<text text-anchor="middle" x="267.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">./qr_decompose.h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<path fill="none" stroke="#63b8ff" d="M180.81,-109.99C199.15,-100.58 223.18,-88.24 241.29,-78.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.37,-81.82 250.66,-74.14 240.17,-75.59 243.37,-81.82"/>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge8" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<path fill="none" stroke="#63b8ff" d="M226.59,-54.95C188.39,-46.83 129.57,-33.99 69.8,-19.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.37,-15.77 59.82,-16.76 68.68,-22.56 70.37,-15.77"/>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge9" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<path fill="none" stroke="#63b8ff" d="M240.67,-54.98C211.3,-45.66 164.22,-30.72 132.84,-20.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.83,-17.41 123.24,-17.72 131.71,-24.08 133.83,-17.41"/>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge11" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<path fill="none" stroke="#63b8ff" d="M251.59,-54.98C235.95,-46.61 211.84,-33.7 193.62,-23.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.16,-20.8 184.7,-19.17 191.86,-26.98 195.16,-20.8"/>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge15" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<path fill="none" stroke="#63b8ff" d="M262.22,-54.75C257.79,-47.42 251.34,-36.73 245.88,-27.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.85,-25.84 240.69,-19.09 242.86,-29.46 248.85,-25.84"/>
-</g>
-<!-- Node9 -->
-<g id="node9" class="node">
-<title>Node9</title>
-<g id="a_node9"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="325.5,-19 275.5,-19 275.5,0 325.5,0 325.5,-19"/>
-<text text-anchor="middle" x="300.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iomanip</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge10" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<path fill="none" stroke="#63b8ff" d="M272.95,-54.75C277.51,-47.42 284.17,-36.73 289.79,-27.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.84,-29.43 295.15,-19.09 286.9,-25.73 292.84,-29.43"/>
-</g>
-<!-- Node10 -->
-<g id="node10" class="node">
-<title>Node10</title>
-<g id="a_node10"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="383.5,-19 343.5,-19 343.5,0 383.5,0 383.5,-19"/>
-<text text-anchor="middle" x="363.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">limits</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge12" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<path fill="none" stroke="#63b8ff" d="M282.92,-54.98C297.95,-46.69 321.04,-33.94 338.66,-24.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.73,-27.07 347.8,-19.17 337.35,-20.94 340.73,-27.07"/>
-</g>
-<!-- Node11 -->
-<g id="node11" class="node">
-<title>Node11</title>
-<g id="a_node11"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="453,-19 402,-19 402,0 453,0 453,-19"/>
-<text text-anchor="middle" x="427.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">numeric</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge13" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<path fill="none" stroke="#63b8ff" d="M293.21,-54.98C320.03,-46.1 362.28,-32.1 392.22,-22.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.46,-25.46 401.86,-18.99 391.26,-18.82 393.46,-25.46"/>
-</g>
-<!-- Node12 -->
-<g id="node12" class="node">
-<title>Node12</title>
-<g id="a_node12"><a xlink:title=" ">
-<polygon fill="#e0e0e0" stroke="#999999" points="522,-19 471,-19 471,0 522,0 522,-19"/>
-<text text-anchor="middle" x="496.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">valarray</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node12 -->
-<g id="edge14" class="edge">
-<title>Node8&#45;&gt;Node12</title>
-<path fill="none" stroke="#63b8ff" d="M306.03,-54.95C343.33,-46.62 401.73,-33.44 460.99,-19.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.98,-22.69 470.89,-16.96 460.35,-15.88 461.98,-22.69"/>
-</g>
-</g>
-</svg>

d4/d75/skip__list_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: data_structures/skip_list.cpp Pages: 1 -->
 <svg width="374pt" height="93pt"

d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="274pt" height="332pt"

d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test_f Pages: 1 -->
 <svg width="144pt" height="101pt"

d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: show_data Pages: 1 -->
 <svg width="262pt" height="27pt"

d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test_int Pages: 1 -->
 <svg width="152pt" height="101pt"

d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: show_data Pages: 1 -->
 <svg width="162pt" height="27pt"

d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test2 Pages: 1 -->
 <svg width="159pt" height="27pt"

d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test1 Pages: 1 -->
 <svg width="159pt" height="27pt"

d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <svg width="228pt" height="64pt"

d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="323pt" height="82pt"

d4/d8d/jarvis__algorithm_8cpp.html

@@ -143,7 +143,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/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm. </p>
 <p >Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it.</p>
-<h3><a class="anchor" id="autotoc_md72"></a>
+<h3><a class="anchor" id="autotoc_md73"></a>
 Algorithm</h3>
 <p >The idea of Jarvis’s Algorithm is simple, we start from the leftmost point (or point with minimum x coordinate value) and we keep wrapping points in counterclockwise direction.</p>
 <p >The idea is to use orientation() here. Next point is selected as the point that beats all other points at counterclockwise orientation, i.e., next point is q if for any other point r, we have “orientation(p, q, r) = counterclockwise”.</p>

d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <svg width="395pt" height="98pt"

d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="469pt" height="98pt"

d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: data_structures::SkipList::insertElement Pages: 1 -->
 <svg width="385pt" height="131pt"

d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: data_structures::SkipList::displayList Pages: 1 -->
 <svg width="223pt" height="38pt"

d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: data_structures::SkipList::deleteElement Pages: 1 -->
 <svg width="223pt" height="82pt"

d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: data_structures::SkipList::randomLevel Pages: 1 -->
 <svg width="224pt" height="38pt"

d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: data_structures::SkipList::searchElement Pages: 1 -->
 <svg width="223pt" height="38pt"

d4/d96/range__queries_2sparse__table_8cpp_a40810d8c0fe3f8cf432ab128b1ae0300_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: range_queries::sparse_table::computeLogs Pages: 1 -->
 <svg width="244pt" height="56pt"

d4/d96/range__queries_2sparse__table_8cpp_a803a2451e87021d14ae06f148383e6bc_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: range_queries::sparse_table::buildTable Pages: 1 -->
 <svg width="244pt" height="69pt"

d4/d96/range__queries_2sparse__table_8cpp_a932816c3de9e5ad122b180de60978e8f_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: range_queries::sparse_table::getMinimum Pages: 1 -->
 <svg width="209pt" height="56pt"

d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: data_structures::Bitset Pages: 1 -->
 <svg width="218pt" height="159pt"

d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="123pt" height="27pt"

d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <svg width="202pt" height="64pt"

d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="276pt" height="64pt"

d4/d9f/selection__sort__recursive_8cpp.html

@@ -146,7 +146,7 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p >Implementation of the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion. </p>
 <p >The selection sort algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list, and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty, and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on the sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.</p>
-<h3><a class="anchor" id="autotoc_md110"></a>
+<h3><a class="anchor" id="autotoc_md111"></a>
 Implementation</h3>
 <p >FindMinIndex This function finds the minimum element of the array(list) recursively by simply comparing the minimum element of array reduced size by 1 and compares it to the last element of the array to find the minimum of the whole array.</p>
 <p >SelectionSortRecursive Just like selection sort, it divides the list into two parts (i.e.: sorted and unsorted) and finds the minimum of the unsorted array. By calling the <code>FindMinIndex</code> function, it swaps the minimum element with the first element of the list, and then solves recursively for the remaining unsorted list. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Tushar-K24" target="_blank">Tushar Khanduri</a> </dd></dl>

d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: sorting::selection_sort_recursive::findMinIndex Pages: 1 -->
 <svg width="276pt" height="56pt"

d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <svg width="153pt" height="138pt"

d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: sorting::selection_sort_recursive::selectionSortRecursive Pages: 1 -->
 <svg width="259pt" height="74pt"

d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="227pt" height="138pt"

d4/da0/area_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: math/area.cpp Pages: 1 -->
 <svg width="256pt" height="82pt"

d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="136pt" height="64pt"

d4/da4/number__of__positive__divisors_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: math/number_of_positive_divisors.cpp Pages: 1 -->
 <svg width="134pt" height="93pt"

d4/db4/bayes__theorem_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: probability/bayes_theorem.cpp Pages: 1 -->
 <svg width="157pt" height="82pt"

d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: SegmentIntersection::on_segment Pages: 1 -->
 <svg width="206pt" height="64pt"

d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: test Pages: 1 -->
 <svg width="143pt" height="101pt"

d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: main Pages: 1 -->
 <svg width="217pt" height="101pt"

d4/dc7/extended__euclid__algorithm_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: math/extended_euclid_algorithm.cpp Pages: 1 -->
 <svg width="136pt" height="93pt"

d4/dc8/tree__234_8cpp__incl.svg

@@ -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 6.0.1 (20220911.1526)
+<!-- Generated by graphviz version 6.0.2 (20221011.1828)
  -->
 <!-- Title: data_structures/tree_234.cpp Pages: 1 -->
 <svg width="445pt" height="93pt"