Documentation for 5b238724b8

d5/d88/md__d_i_r_e_c_t_o_r_y.html

@@ -195,6 +195,7 @@ Data Structures</h1>
 Divide And Conquer</h1>
 <ul>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp" target="_blank">Karatsuba Algorithm For Fast Multiplication</a></li>
+<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/divide_and_conquer/strassen_matrix_multiplication.cpp" target="_blank">Strassen Matrix Multiplication</a></li>
 </ul>
 <h1><a class="anchor" id="autotoc_md50"></a>
 Dynamic Programming</h1>
@@ -225,6 +226,7 @@ Dynamic Programming</h1>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/partition_problem.cpp" target="_blank">Partition Problem</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/searching_of_element_in_dynamic_array.cpp" target="_blank">Searching Of Element In Dynamic Array</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/shortest_common_supersequence.cpp" target="_blank">Shortest Common Supersequence</a></li>
+<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/subset_sum.cpp" target="_blank">Subset Sum</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/tree_height.cpp" target="_blank">Tree Height</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/word_break.cpp" target="_blank">Word Break</a></li>
 </ul>
@@ -269,6 +271,7 @@ Graphics</h1>
 <h1><a class="anchor" id="autotoc_md54"></a>
 Greedy Algorithms</h1>
 <ul>
+<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/boruvkas_minimum_spanning_tree.cpp" target="_blank">Boruvkas Minimum Spanning Tree</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/dijkstra.cpp" target="_blank">Dijkstra</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/huffman.cpp" target="_blank">Huffman</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/jumpgame.cpp" target="_blank">Jumpgame</a></li>
@@ -300,6 +303,7 @@ Machine Learning</h1>
 <h1><a class="anchor" id="autotoc_md57"></a>
 Math</h1>
 <ul>
+<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/aliquot_sum.cpp" target="_blank">Aliquot Sum</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/approximate_pi.cpp" target="_blank">Approximate Pi</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/area.cpp" target="_blank">Area</a></li>
 <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/armstrong_number.cpp" target="_blank">Armstrong Number</a></li>

d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.map

@@ -0,0 +1,4 @@
+<map id="divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;" name="divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;">
+<area shape="rect" id="node1" title="Matrix class." alt="" coords="5,108,176,163"/>
+<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="11,5,170,45"/>
+</map>

d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.md5

@@ -0,0 +1 @@
+a22625568818402994c79e2294107cf7

d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.svg

@@ -0,0 +1,40 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
+ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
+<!-- Generated by graphviz version 7.0.6 (20230106.0513)
+ -->
+<!-- Title: divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt; Pages: 1 -->
+<svg width="136pt" height="126pt"
+ viewBox="0.00 0.00 136.00 126.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 122)">
+<title>divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</title>
+<!-- Node1 -->
+<g id="node1" class="node">
+<title>Node1</title>
+<g id="a_node1"><a xlink:title="Matrix class.">
+<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
+<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
+<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
+<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix&lt; T, typename &gt;</text>
+</a>
+</g>
+</g>
+<!-- Node2 -->
+<g id="node2" class="node">
+<title>Node2</title>
+<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="123.5,-118 4.5,-118 4.5,-88 123.5,-88 123.5,-118"/>
+<text text-anchor="start" x="12.5" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
+<text text-anchor="middle" x="64" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt; &gt;</text>
+</a>
+</g>
+</g>
+<!-- Node2&#45;&gt;Node1 -->
+<g id="edge1" class="edge">
+<title>Node2&#45;&gt;Node1</title>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M64,-76.2C64,-64.86 64,-51.75 64,-41.21"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="60.5,-76.09 64,-86.09 67.5,-76.09 60.5,-76.09"/>
+<text text-anchor="middle" x="76.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00"> _mat</text>
+</g>
+</g>
+</svg>