mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-24 13:53:35 +08:00
Documentation for 5aa074c88b
This commit is contained in:
github-actions
@@ -468,6 +468,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_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_complex_html_a466cd7b664cc6a864937ceb3dead1323"><div class="ttname"><a href="../../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323">Complex::Complex</a></div><div class="ttdeci">Complex(const Complex &other)</div><div class="ttdoc">Copy Constructor.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:58</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>
|
||||
<div class="ttc" id="aclass_complex_html_a3cfc522c782726f49ee20af17b77f867"><div class="ttname"><a href="../../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867">Complex::Complex</a></div><div class="ttdeci">Complex(double x=0.f, double y=0.f, bool is_polar=false)</div><div class="ttdoc">Complex Constructor which initialises our complex number.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:43</div></div>
|
||||
<div class="ttc" id="abasic_stringstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a></div><div class="ttdoc">STL class.</div></div>
|
||||
@@ -482,7 +483,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:84</div></div>
|
||||
<div class="ttc" id="acomplex__numbers_8cpp_html_a5d4d5b8250b50703de888514c8e7a7a0"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a></div><div class="ttdeci">double get_rand()</div><div class="ttdoc">Function to get random numbers to generate our complex numbers for test.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:201</div></div>
|
||||
<div class="ttc" id="abinary__exponent_8cpp_html_a31dbf5f7ceb9c9eec831ef9f7782291f"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f">binExpo_alt</a></div><div class="ttdeci">int binExpo_alt(int a, int b)</div><div class="ttdef"><b>Definition:</b> binary_exponent.cpp:42</div></div>
|
||||
<div class="ttc" id="aclassgraph_html_a6398e513b9574e029fbee07c6ac6e028"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a6398e513b9574e029fbee07c6ac6e028">graph::explore</a></div><div class="ttdeci">void explore(int, vector< bool > &)</div><div class="ttdoc">Utility function for depth first seach algorithm this function explores the vertex which is passed in...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:101</div></div>
|
||||
<div class="ttc" id="asearch_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/search.html">std::search</a></div><div class="ttdeci">T search(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacequadratic__probing_html_adccc63a7e57cc6dba75bd62f40feb88b"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b">quadratic_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:106</div></div>
|
||||
<div class="ttc" id="ais__graph__bipartite_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:160</div></div>
|
||||
@@ -543,7 +543,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
|
||||
<div class="ttc" id="adouble__factorial_8cpp_html_abbbcebf3a2d0c67f4c3cfb5511a97981"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981">test</a></div><div class="ttdeci">void test(uint64_t n, uint64_t expected)</div><div class="ttdef"><b>Definition:</b> double_factorial.cpp:42</div></div>
|
||||
<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:14</div></div>
|
||||
<div class="ttc" id="aclassgraph_html_a135921a59082b669678b029b301b8a1c"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a135921a59082b669678b029b301b8a1c">graph::depth_first_search</a></div><div class="ttdeci">void depth_first_search()</div><div class="ttdoc">Function that perfoms depth first search algorithm on graph.</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:83</div></div>
|
||||
<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
|
||||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:457</div></div>
|
||||
<div class="ttc" id="aclass_complex_html_a312e4b19146128408fb06e0150b0faf6"><div class="ttname"><a href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">Complex::real</a></div><div class="ttdeci">double real() const</div><div class="ttdoc">Member function to get real value of our complex number. Member function (getter) to access the class...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:64</div></div>
|
||||
@@ -566,7 +565,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="astruct_min_heap_node_html"><div class="ttname"><a href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a></div><div class="ttdef"><b>Definition:</b> huffman.cpp:7</div></div>
|
||||
<div class="ttc" id="aline__segment__intersection_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:92</div></div>
|
||||
<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a75f72858f08a2fc8b94402de98db12d8"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">quadratic_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:39</div></div>
|
||||
<div class="ttc" id="aconnected__components_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:111</div></div>
|
||||
<div class="ttc" id="aconnected__components_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:127</div></div>
|
||||
<div class="ttc" id="aclass_complex_html_ac38437c10eb798f176c384a695171b90"><div class="ttname"><a href="../../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90">Complex::operator/</a></div><div class="ttdeci">Complex operator/(const Complex &other)</div><div class="ttdoc">Operator overload of '/' on Complex class. Operator overload to be able to divide two complex numbers...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:142</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_a622d84883180ff42f04955909adea5a9"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a622d84883180ff42f04955909adea5a9">large_number::operator++</a></div><div class="ttdeci">large_number & operator++()</div><div class="ttdef"><b>Definition:</b> large_number.h:175</div></div>
|
||||
<div class="ttc" id="aadaline__learning_8cpp_html_a52053d88ea1bcbbed9aca67ab4eeb499"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499">test1</a></div><div class="ttdeci">void test1(double eta=0.01)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:224</div></div>
|
||||
@@ -616,6 +615,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:87</div></div>
|
||||
<div class="ttc" id="aopen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html">std::ifstream::open</a></div><div class="ttdeci">T open(T... args)</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a8d61f9ed872eef26bca39388cbda6a91"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91">machine_learning::adaline::fit</a></div><div class="ttdeci">void fit(std::array< std::vector< double >, N > const &X, std::array< int, N > const &Y)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:145</div></div>
|
||||
<div class="ttc" id="anamespacegraph_html_a372ff051a7bc6c91d34a7b58edf8dfce"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector< std::vector< int >> *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:46</div></div>
|
||||
<div class="ttc" id="akohonen__som__topology_8cpp_html_ab3081e021270ba21a9fd88646f6a6e26"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#ab3081e021270ba21a9fd88646f6a6e26">test_3d_classes1</a></div><div class="ttdeci">void test_3d_classes1(std::vector< std::valarray< double >> *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:411</div></div>
|
||||
<div class="ttc" id="afibonacci__fast_8cpp_html_a5712edca101204eca8accdb1e096707f"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a></div><div class="ttdeci">uint64_t fib(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:30</div></div>
|
||||
<div class="ttc" id="anamespacequadratic__probing_html_ada6f1f44f7e83b0094fbcbe170788486"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486">quadratic_probing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:160</div></div>
|
||||
@@ -652,12 +652,12 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
|
||||
<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
|
||||
<div class="ttc" id="aclass_edge_html"><div class="ttname"><a href="../../d7/d77/class_edge.html">Edge</a></div><div class="ttdef"><b>Definition:</b> bellman_ford.cpp:7</div></div>
|
||||
<div class="ttc" id="aclassgraph_html_af9b34bbae0f618e2128c501b69339bb0"><div class="ttname"><a href="../../dd/d9b/classgraph.html#af9b34bbae0f618e2128c501b69339bb0">graph::getConnectedComponents</a></div><div class="ttdeci">int getConnectedComponents()</div><div class="ttdoc">Function the calculates the connected compoents in the graph by performing the depth first search on ...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:63</div></div>
|
||||
<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="acheck__amicable__pair_8cpp_html_ac656a51b4c3bd7d63b7dcc75dc3e5576"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a></div><div class="ttdeci">int sum_of_divisor(int num)</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:21</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="abreadth__first__search_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:121</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="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>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:24</div></div>
|
||||
<div class="ttc" id="anamespacelinear__probing_html_a16d34fd3511626a83ab00665d7bc34d1"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">linear_probing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:161</div></div>
|
||||
<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
|
||||
@@ -677,7 +677,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="acomplex__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:268</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>
|
||||
<div class="ttc" id="aclassgraph_html_a45045da3d080cb81472ce6d5cc02b911"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a45045da3d080cb81472ce6d5cc02b911">graph::adj</a></div><div class="ttdeci">vector< vector< int > > adj</div><div class="ttdoc">adj stores adjacency list representation of graph</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:40</div></div>
|
||||
<div class="ttc" id="aclasslarge__number_html_a7ba872b9a3ce1f3da6c06c5409663cca"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">large_number::operator==</a></div><div class="ttdeci">friend bool operator==(large_number const &a, large_number const &b)</div><div class="ttdef"><b>Definition:</b> large_number.h:155</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:145</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a1d821a24e1503d468c95d4acedca58b3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a1d821a24e1503d468c95d4acedca58b3">machine_learning::adaline::operator<<</a></div><div class="ttdeci">friend std::ostream & operator<<(std::ostream &out, const adaline &ada)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:76</div></div>
|
||||
@@ -712,6 +711,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aclass_trie_html_a411e77126930a0942dd7b65e96b15206"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">Trie::search</a></div><div class="ttdeci">bool search(const std::string &word)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:132</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:52</div></div>
|
||||
<div class="ttc" id="afixed_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::fixed</a></div><div class="ttdeci">T fixed(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacegraph_html_a8e9885e0dd49fcf8262a9868124deac9"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9">graph::explore</a></div><div class="ttdeci">void explore(const std::vector< std::vector< int >> *adj, int u, std::vector< bool > *visited)</div><div class="ttdoc">Utility function for depth first seach algorithm this function explores the vertex which is passed in...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:59</div></div>
|
||||
<div class="ttc" id="astruct_item_html"><div class="ttname"><a href="../../db/d66/struct_item.html">Item</a></div><div class="ttdef"><b>Definition:</b> knapsack.cpp:4</div></div>
|
||||
<div class="ttc" id="alinear__probing__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:224</div></div>
|
||||
<div class="ttc" id="astrtoul_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strtoul.html">std::strtoull</a></div><div class="ttdeci">T strtoull(T... args)</div></div>
|
||||
@@ -721,7 +721,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_acba15ca55b3e7dcb91f3c65d72ba052d"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a></div><div class="ttdeci">void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:70</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_html_a6da44f9820d3b7bae2f0f74bc149c27e"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a6da44f9820d3b7bae2f0f74bc149c27e">graph::graph</a></div><div class="ttdeci">graph(int n)</div><div class="ttdoc">Constructor that intiliazes the graph on creation and set the connected components to 0.</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:53</div></div>
|
||||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:56</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>
|
||||
@@ -778,10 +777,8 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/data.html">std::vector::data</a></div><div class="ttdeci">T data(T... args)</div></div>
|
||||
<div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div>
|
||||
<div class="ttc" id="aset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="aclassgraph_html_a35c12fba596d8bb48b1877b128c4ba6d"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a35c12fba596d8bb48b1877b128c4ba6d">graph::addEdge</a></div><div class="ttdeci">void addEdge(int, int)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:75</div></div>
|
||||
<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="aclassgraph_html_a822dcbe7978a9fa026f2b37f1a52f5e9"><div class="ttname"><a href="../../dd/d9b/classgraph.html#a822dcbe7978a9fa026f2b37f1a52f5e9">graph::connected_components</a></div><div class="ttdeci">int connected_components</div><div class="ttdoc">keep track of connected components</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:43</div></div>
|
||||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_afeb67e204ec7de02ad152c11df4d1e01"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:48</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:81</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