mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-12 03:28:29 +08:00
Documentation for b09b3da69a
This commit is contained in:
github-actions
@@ -724,7 +724,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ae6928f3ebd491541e9570e746b877c1e"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree::populate_parents</a></div><div class="ttdeci">void populate_parents()</div><div class="ttdoc">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:117</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">Machine learning algorithms.</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a5f42063207181529413d812ade52f58e"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5f42063207181529413d812ade52f58e">machine_learning::operator-</a></div><div class="ttdeci">std::vector< std::valarray< T > > operator-(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:433</div></div>
|
||||
<div class="ttc" id="akadane2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> kadane2.cpp:59</div></div>
|
||||
<div class="ttc" id="akadane2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> kadane2.cpp:60</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_ac7d9b358f1ef2ba2a1d475a5452ec41f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac7d9b358f1ef2ba2a1d475a5452ec41f">machine_learning::transpose</a></div><div class="ttdeci">std::vector< std::valarray< T > > transpose(const std::vector< std::valarray< T >> &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:382</div></div>
|
||||
<div class="ttc" id="astrerror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strerror.html">std::strerror</a></div><div class="ttdeci">T strerror(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacequadratic__probing_html_a5ceee4128d92ca4412040b7104d1299d"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">quadratic_probing::find</a></div><div class="ttdeci">Entry find(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:131</div></div>
|
||||
@@ -751,7 +751,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
|
||||
<div class="ttc" id="aparanthesis__matching_8cpp_html_af4c937d823c412d99fbe60c99dbf0a4f"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a></div><div class="ttdeci">int stack_idx</div><div class="ttdoc">pointer to track stack index</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:23</div></div>
|
||||
<div class="ttc" id="abreadth__first__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:134</div></div>
|
||||
<div class="ttc" id="akadane2_8cpp_html_af3029007a422a914a85c0b0122f1c7b4"><div class="ttname"><a href="../../db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4">dynamic_programming::kadane::maxSubArray</a></div><div class="ttdeci">int maxSubArray(const std::array< int, N > &n)</div><div class="ttdoc">maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s...</div><div class="ttdef"><b>Definition:</b> kadane2.cpp:41</div></div>
|
||||
<div class="ttc" id="akadane2_8cpp_html_af3029007a422a914a85c0b0122f1c7b4"><div class="ttname"><a href="../../db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4">dynamic_programming::kadane::maxSubArray</a></div><div class="ttdeci">int maxSubArray(const std::array< int, N > &n)</div><div class="ttdoc">maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s...</div><div class="ttdef"><b>Definition:</b> kadane2.cpp:42</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a36494e26ff36d6e15c1022bb9a1ee848"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848">machine_learning::neural_network::NeuralNetwork::evaluate_from_csv</a></div><div class="ttdeci">void evaluate_from_csv(const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:638</div></div>
|
||||
<div class="ttc" id="abreadth__first__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:174</div></div>
|
||||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:233</div></div>
|
||||
@@ -857,6 +857,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="aclassdata__structures_1_1trie_html_a4bfac4be6ed1a34c7159eddb42469191"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie::NUM_CHARS</a></div><div class="ttdeci">static constexpr uint8_t NUM_CHARS</div><div class="ttdoc">Number of alphabets.</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:27</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_ab0efcfa04fff8616aff0062522d1483f"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f">graph::is_graph_bipartite::Graph::adj</a></div><div class="ttdeci">std::vector< std::vector< int > > adj</div><div class="ttdoc">adj stores the graph as an adjacency list</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:56</div></div>
|
||||
<div class="ttc" id="ajarvis__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:176</div></div>
|
||||
<div class="ttc" id="acut__rod_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> cut_rod.cpp:100</div></div>
|
||||
<div class="ttc" id="aclassdata__structures_1_1trie_html_aab373beb3f618b90922528c68797d988"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">data_structures::trie::char_to_int</a></div><div class="ttdeci">uint8_t char_to_int(const char &ch) const</div><div class="ttdoc">Convert a character to integer for indexing.</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:38</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a5172a6791b9bd24f4232bab8d6b81fff"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">machine_learning::neural_network::NeuralNetwork::fit_from_csv</a></div><div class="ttdeci">void fit_from_csv(const std::string &file_name, const bool &last_label, const int &epochs, const double &learning_rate, const bool &normalize, const int &slip_lines=1, const size_t &batch_size=32, const bool &shuffle=true)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:587</div></div>
|
||||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector< bool > &is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</div></div>
|
||||
@@ -968,6 +969,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/end.html">std::set::end</a></div><div class="ttdeci">T end(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacequadratic__probing_html_ab431981b54c0bae1b2956f716aee1dcf"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadratic_probing::quadraticProbe</a></div><div class="ttdeci">int quadraticProbe(int key, bool searching)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:56</div></div>
|
||||
<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:20</div></div>
|
||||
<div class="ttc" id="anamespacecut__rod_html"><div class="ttname"><a href="../../d8/d36/namespacecut__rod.html">cut_rod</a></div><div class="ttdoc">Implementation of cutting a rod problem.</div></div>
|
||||
<div class="ttc" id="astructdouble__hashing_1_1_entry_html_ae114967c89dbba3b754dc4976bba3248"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">double_hashing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:38</div></div>
|
||||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a54df5f9a8f37170bd97c91127664655c"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">geometry::jarvis::Convexhull::orientation</a></div><div class="ttdeci">static int orientation(const Point &p, const Point &q, const Point &r)</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:133</div></div>
|
||||
<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
|
||||
@@ -1022,9 +1024,11 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="ahash_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash</a></div></div>
|
||||
<div class="ttc" id="akohonen__som__trace_8cpp_html_ab47fb569e63648bd76e7edfdacc02dbd"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#ab47fb569e63648bd76e7edfdacc02dbd">test_circle</a></div><div class="ttdeci">void test_circle(std::vector< std::valarray< double >> *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:196</div></div>
|
||||
<div class="ttc" id="aquadratic__probing__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:246</div></div>
|
||||
<div class="ttc" id="acut__rod_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition:</b> cut_rod.cpp:71</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector< std::valarray< T >> &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div>
|
||||
<div class="ttc" id="astack_8h_html"><div class="ttname"><a href="../../d7/de0/stack_8h.html">stack.h</a></div><div class="ttdoc">This class specifies the basic operation on a stack as a linked list.</div></div>
|
||||
<div class="ttc" id="agraph__coloring_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:96</div></div>
|
||||
<div class="ttc" id="acut__rod_8cpp_html_ae550b90e6057a7f976c9d643f706c4f5"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#ae550b90e6057a7f976c9d643f706c4f5">dynamic_programming::cut_rod::maxProfitByCuttingRod</a></div><div class="ttdeci">int maxProfitByCuttingRod(const std::array< int, T > &price, const int n)</div><div class="ttdoc">Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.</div><div class="ttdef"><b>Definition:</b> cut_rod.cpp:44</div></div>
|
||||
<div class="ttc" id="abasic_ifstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ifstream.html">std::ifstream</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
|
||||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a889f9de199fa793497c864d8e493af05"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a889f9de199fa793497c864d8e493af05">get_transpose</a></div><div class="ttdeci">std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T >> const &A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:300</div></div>
|
||||
|
||||
Reference in New Issue
Block a user