mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-29 04:53:55 +08:00
Documentation for 06b6714b0e
This commit is contained in:
github-actions
@@ -651,11 +651,13 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a62a418f243cd52b49f59015dddff188e"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a62a418f243cd52b49f59015dddff188e">machine_learning::equal_shuffle</a></div><div class="ttdeci">void equal_shuffle(std::vector< std::vector< std::valarray< T >>> &A, std::vector< std::vector< std::valarray< T >>> &B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:136</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a80825a4fd4c41860b689d253dd2c8e93"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">graph::LowestCommonAncestor::LowestCommonAncestor</a></div><div class="ttdeci">LowestCommonAncestor(const RootedTree &tree_)</div><div class="ttdoc">Stores the tree and precomputs "up lifts".</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:151</div></div>
|
||||
<div class="ttc" id="ainner_product_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html">std::inner_product</a></div><div class="ttdeci">T inner_product(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3d9101e3b4598159005fd028b9b0ff74"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph::m</a></div><div class="ttdeci">int m</div><div class="ttdoc">m is the number of vertices on left side of Bipartite Graph</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:68</div></div>
|
||||
<div class="ttc" id="astructlinear__probing_1_1_entry_html_a2139f643a3caf074da1db8a9fa16fa77"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">linear_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:36</div></div>
|
||||
<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
|
||||
<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a2055c2f3a076b3d4146aade5eb35666d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a2055c2f3a076b3d4146aade5eb35666d">machine_learning::operator/</a></div><div class="ttdeci">std::vector< std::valarray< T > > operator/(const std::vector< std::valarray< T >> &A, const T &val)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:365</div></div>
|
||||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a67249e31221231cf3aaf3cfd870372d0"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a67249e31221231cf3aaf3cfd870372d0">operator+</a></div><div class="ttdeci">std::vector< T > operator+(std::vector< T > const &A, std::vector< T > const &B)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:204</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6f5a9fdbb83ef731d739ba6707e21c3c"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">n is the number of vertices on right side of Bipartite Graph</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:69</div></div>
|
||||
<div class="ttc" id="anamespacelinear__probing_html_a75d779938df7ebc68581d922b60a2541"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:98</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_ad9d119e7520fa5c2d2428433f578c0bc"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad9d119e7520fa5c2d2428433f578c0bc">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray< T > pop_front(const std::valarray< T > &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:102</div></div>
|
||||
<div class="ttc" id="anamespacedouble__hashing_html"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a></div><div class="ttdoc">An implementation of hash table using double hashing algorithm.</div></div>
|
||||
@@ -693,6 +695,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="aspirograph_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> spirograph.cpp:268</div></div>
|
||||
<div class="ttc" id="aclass_graph_html_adcbd1b60cab30b97c54d700eee8e456d"><div class="ttname"><a href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList adjList)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:68</div></div>
|
||||
<div class="ttc" id="arandom_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a></div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3b49011c09cf90a116ab53bef61cd95a"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">graph::HKGraph::addEdge</a></div><div class="ttdeci">void addEdge(int u, int v)</div><div class="ttdoc">function to add edge from u to v</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:242</div></div>
|
||||
<div class="ttc" id="aemplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">std::queue::emplace</a></div><div class="ttdeci">T emplace(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacegraph_html_a9fc2ded2807582edf398e6d7c7114914"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9fc2ded2807582edf398e6d7c7114914">graph::getConnectedComponents</a></div><div class="ttdeci">int getConnectedComponents(const std::vector< std::vector< int >> *adj)</div><div class="ttdoc">Function that perfoms depth first search algorithm on graph and calculated the number of connected co...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:77</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a42589cc39d6bbff6c997152f1b96e356"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor::populate_up</a></div><div class="ttdeci">void populate_up()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:212</div></div>
|
||||
@@ -885,6 +888,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a9df1118010a233d13ab3dd699bcb513e"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e">quadratic_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:38</div></div>
|
||||
<div class="ttc" id="aclassstack_html_a21c0bb6ce7dcfe445cc12031977ea344"><div class="ttname"><a href="../../d1/dc2/classstack.html#a21c0bb6ce7dcfe445cc12031977ea344">stack::top</a></div><div class="ttdeci">Type top()</div><div class="ttdef"><b>Definition:</b> stack.h:93</div></div>
|
||||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:55</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a7491add14d9fc04f679114ca6d6f0f93"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph::bfs</a></div><div class="ttdeci">bool bfs()</div><div class="ttdoc">This function checks for the possibility of augmented path availability.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:133</div></div>
|
||||
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0ceb473236b5dc53a85e281ef528dd96"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0ceb473236b5dc53a85e281ef528dd96">hamilton_cycle</a></div><div class="ttdeci">bool hamilton_cycle(const std::vector< std::vector< bool >> &routes)</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:30</div></div>
|
||||
<div class="ttc" id="aclassdata__structures_1_1trie_html_aeac27cfd397d2dd3f2f519efffafeeab"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a></div><div class="ttdeci">bool deleteString(const std::string &str, int index)</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:134</div></div>
|
||||
<div class="ttc" id="aconnected__components_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:93</div></div>
|
||||
@@ -908,6 +912,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a98ab8f75d981088369b89b8be2182483"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a98ab8f75d981088369b89b8be2182483">get_inverse</a></div><div class="ttdeci">std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:226</div></div>
|
||||
<div class="ttc" id="aclassdata__structures_1_1trie_html_a961eb5d576d2420f2036009154397c63"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63">data_structures::trie::search</a></div><div class="ttdeci">bool search(const std::shared_ptr< trie > &root, const std::string &str, int index)</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:56</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a8d983ebb3225a9901b713a0f05b44aba"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8d983ebb3225a9901b713a0f05b44aba">machine_learning::neural_network::NeuralNetwork::get_XY_from_csv</a></div><div class="ttdeci">std::pair< std::vector< std::vector< std::valarray< double > > >, std::vector< std::vector< std::valarray< double > > > > get_XY_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:382</div></div>
|
||||
<div class="ttc" id="ahopcroft__karp_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:306</div></div>
|
||||
<div class="ttc" id="anamespacedouble__hashing_html_a29f543e2626bad58907661e1e45028a6"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">double_hashing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:133</div></div>
|
||||
<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div>
|
||||
<div class="ttc" id="aclasshash__chain_html_a48236d44349c3ebce4774b706f4f8a0f"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f">hash_chain::next</a></div><div class="ttdeci">std::shared_ptr< struct Node > next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition:</b> chaining.cpp:23</div></div>
|
||||
@@ -922,13 +927,16 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="agreater_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater</a></div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_abe6b58ec16abe0f6f8ac195e04aa8abd"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#abe6b58ec16abe0f6f8ac195e04aa8abd">machine_learning::get_shape</a></div><div class="ttdeci">std::pair< size_t, size_t > get_shape(const std::vector< std::valarray< T >> &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:247</div></div>
|
||||
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a35893def7a1c5cd60907b4893117796f"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">graph::HKGraph::adj</a></div><div class="ttdeci">std::vector< std::list< int > > adj</div><div class="ttdoc">adj[u] stores adjacents of left side and 0 is used for dummy vertex</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:73</div></div>
|
||||
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/insert.html">std::vector::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_af02b0c83911070ac6d95fc9905e58aa9"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9">graph::HKGraph::HKGraph</a></div><div class="ttdeci">HKGraph()</div><div class="ttdoc">Default Constructor for initialization.</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_afa4a080c9526909ea87a6c0f6cfd6a2f"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#afa4a080c9526909ea87a6c0f6cfd6a2f">machine_learning::neural_network::NeuralNetwork::operator=</a></div><div class="ttdeci">NeuralNetwork & operator=(NeuralNetwork &&)=default</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a4f14e473bb0722c6490b9dc8da5982aa"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa">machine_learning::neural_network::NeuralNetwork::save_model</a></div><div class="ttdeci">void save_model(const std::string &_file_name)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:652</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a7220dbb7fa896d83bfb7a50e4fce1786"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786">machine_learning::MIN_DISTANCE</a></div><div class="ttdeci">constexpr double MIN_DISTANCE</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:129</div></div>
|
||||
<div class="ttc" id="anamespacelinear__probing_html_a75854f5aa216e61219154c62167ce8f0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:201</div></div>
|
||||
<div class="ttc" id="atower__of__hanoi_8cpp_html_a746d9a3984bba88fd6dd91978f6931ed"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed">show</a></div><div class="ttdeci">void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:19</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_ae2f6992450faa2c3da93edea0818869a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#ae2f6992450faa2c3da93edea0818869a">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:74</div></div>
|
||||
<div class="ttc" id="ahopcroft__karp_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:255</div></div>
|
||||
<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition:</b> huffman.cpp:28</div></div>
|
||||
<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdef"><b>Definition:</b> stack.h:26</div></div>
|
||||
<div class="ttc" id="aneural__network_8cpp_html_a76eb66212d577f948a457b6e29d87c46"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46">machine_learning::neural_network::activations::dsigmoid</a></div><div class="ttdeci">double dsigmoid(const double &x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:67</div></div>
|
||||
@@ -956,6 +964,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="astructgeometry_1_1jarvis_1_1_point_html"><div class="ttname"><a href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::Point</a></div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:47</div></div>
|
||||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:414</div></div>
|
||||
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6a0228bbba3818447fcf6b56128b552a"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">graph::HKGraph::dist</a></div><div class="ttdeci">std::vector< int > dist</div><div class="ttdoc">dist represents the distance between vertex 'u' and vertex 'v'</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:77</div></div>
|
||||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4261f3c3c3dfdb86f3004eb8aaffea8d"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a></div><div class="ttdeci">void ols_test()</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:369</div></div>
|
||||
<div class="ttc" id="aclassstack_html_a066e4505155b009913c47b2648b1067a"><div class="ttname"><a href="../../d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack()</div><div class="ttdef"><b>Definition:</b> stack.h:80</div></div>
|
||||
<div class="ttc" id="anamespacelayers_html"><div class="ttname"><a href="../../d5/d2c/namespacelayers.html">layers</a></div><div class="ttdoc">This namespace contains layers used in MLP.</div></div>
|
||||
@@ -975,7 +984,9 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<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>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html">graph::HKGraph</a></div><div class="ttdoc">Represents Bipartite graph for Hopcroft Karp implementation.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:67</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_aa23d60262f917f35836ef4b1c1d9f7d3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3">machine_learning::adaline::accuracy</a></div><div class="ttdeci">const double accuracy</div><div class="ttdoc">model fit convergence accuracy</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:208</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a976ee239402cc2726a280e781c706d77"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">graph::HKGraph::pair_v</a></div><div class="ttdeci">std::vector< int > pair_v</div><div class="ttdoc">value of vertex 'v' ranges from 1 to n</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:76</div></div>
|
||||
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
|
||||
<div class="ttc" id="agraph_2dijkstra_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> dijkstra.cpp:152</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a9225f0ded976096b45ffe13c75d33c05"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a9225f0ded976096b45ffe13c75d33c05">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:406</div></div>
|
||||
@@ -986,6 +997,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:12</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a6ef38e5947aef609f908bfbfeaf11d75"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6ef38e5947aef609f908bfbfeaf11d75">machine_learning::hadamard_product</a></div><div class="ttdeci">std::vector< std::valarray< T > > hadamard_product(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:494</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">graph::is_graph_bipartite::Graph</a></div><div class="ttdoc">Class for representing graph as an adjacency list.</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:51</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a9dbda80d02bdc26c3e8ff7330c9be75d"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">graph::HKGraph::hopcroftKarpAlgorithm</a></div><div class="ttdeci">int hopcroftKarpAlgorithm()</div><div class="ttdoc">This function counts the number of augmenting paths between left and right sides of the Bipartite gra...</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:95</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_adc731720947b4bc2ab047c141e7d0299"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#adc731720947b4bc2ab047c141e7d0299">machine_learning::kohonen_som</a></div><div class="ttdeci">void kohonen_som(const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:269</div></div>
|
||||
<div class="ttc" id="aparanthesis__matching_8cpp_html_aae41c72130114bf31204cde6873b6095"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095">push</a></div><div class="ttdeci">void push(char ch)</div><div class="ttdoc">push byte to stack variable</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:26</div></div>
|
||||
<div class="ttc" id="aclass_trie_html_a95216ffc56cb9f8cede982cecb872af4"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a95216ffc56cb9f8cede982cecb872af4">Trie::removeWordHelper</a></div><div class="ttdeci">std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:64</div></div>
|
||||
@@ -1000,6 +1012,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a60151e19512b48cc0b14ea121df00488"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">graph::LowestCommonAncestor::lowest_common_ancestor</a></div><div class="ttdeci">int lowest_common_ancestor(int u, int v) const</div><div class="ttdoc">Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:164</div></div>
|
||||
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
|
||||
<div class="ttc" id="aclasshash__chain_html_a706964ad13587fc9a8b3fe8381d410ed"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">hash_chain::display</a></div><div class="ttdeci">void display()</div><div class="ttdoc">Display the chain.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:63</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a86ebff8a70cbfedd05281993d5d1987b"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph::pair_u</a></div><div class="ttdeci">std::vector< int > pair_u</div><div class="ttdoc">value of vertex 'u' ranges from 1 to m</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:75</div></div>
|
||||
<div class="ttc" id="ashortest__common__supersequence_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> shortest_common_supersequence.cpp:164</div></div>
|
||||
<div class="ttc" id="anamespacesorting_html_a50b66a1c652291b9a346ec7342967178"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a50b66a1c652291b9a346ec7342967178">sorting::quickSort</a></div><div class="ttdeci">void quickSort(int arr[], int low, int high)</div><div class="ttdef"><b>Definition:</b> quick_sort.cpp:63</div></div>
|
||||
<div class="ttc" id="aadaline__learning_8cpp_html_a379f7488a305f2571f2932b319931f82"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82">test2</a></div><div class="ttdeci">void test2(double eta=0.01)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:262</div></div>
|
||||
@@ -1015,6 +1028,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
|
||||
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a30acf52af3184bc22274234ef5a73536"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a30acf52af3184bc22274234ef5a73536">operator/</a></div><div class="ttdeci">std::vector< float > operator/(std::vector< T > const &A, float const scalar)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:174</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_acc6a28f40512dbda75ab1a3969248898"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#acc6a28f40512dbda75ab1a3969248898">machine_learning::kohonen_som_tracer</a></div><div class="ttdeci">void kohonen_som_tracer(const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:149</div></div>
|
||||
<div class="ttc" id="anamespaceutil__functions_html"><div class="ttname"><a href="../../d3/d17/namespaceutil__functions.html">util_functions</a></div><div class="ttdoc">Various utility functions used in Neural network.</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_ae794950cb3407b6b47d3dc986cf714c0"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">graph::HKGraph::dfs</a></div><div class="ttdeci">bool dfs(int u)</div><div class="ttdoc">This functions checks whether an augmenting path is available exists beginning with free vertex u.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:191</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_ad8c10df34357b2cd865c81e0c4f0bd8c"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c">graph::is_graph_bipartite::Graph::addEdge</a></div><div class="ttdeci">void addEdge(int u, int v)</div><div class="ttdoc">Function that add an edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:83</div></div>
|
||||
<div class="ttc" id="aeof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html">std::ifstream::eof</a></div><div class="ttdeci">T eof(T... args)</div></div>
|
||||
<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
|
||||
|
||||
Reference in New Issue
Block a user