backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 22:32:24 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for c915f9f3c2

Browse Source
This commit is contained in:
github-actions
2020-10-02 12:25:09 +00:00
parent a5b08234aa
commit b86840cafb
198 changed files with 5893 additions and 5302 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
d8/d95/vector__ops_8hpp_source.html
View File

@@ -664,6 +664,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a8973f687738ddd76f93b5562feae4027"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027">machine_learning::neural_network::NeuralNetwork::~NeuralNetwork</a></div><div class="ttdeci">~NeuralNetwork()=default</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector&lt; int &gt; level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:106</div></div>
<div class="ttc" id="ajumpgame_8cpp_html_af205390325e8c999bd68b93fa5252755"><div class="ttname"><a href="../../df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755">canJump</a></div><div class="ttdeci">bool canJump(const std::vector&lt; int &gt; &amp;nums)</div><div class="ttdoc">This function implements the above algorithm.</div><div class="ttdef"><b>Definition:</b> jumpgame.cpp:26</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a5d06e4598569526294f10104875f6824"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:227</div></div>
<div class="ttc" id="aclasshash__chain_html_a55aa5c6753cb8853152d469c375d946a"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a">hash_chain::find</a></div><div class="ttdeci">bool find(int x, int h) const</div><div class="ttdoc">Find if a value and corresponding hash exist.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:101</div></div>
<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
@@ -821,6 +822,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="anamespacemachine__learning_html_a725d4ccceda4f32c96348ba1d593cd3c"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a725d4ccceda4f32c96348ba1d593cd3c">machine_learning::insert_element</a></div><div class="ttdeci">std::valarray&lt; T &gt; insert_element(const std::valarray&lt; T &gt; &amp;A, const T &amp;ele)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:85</div></div>
<div class="ttc" id="amath_2armstrong__number_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d4/d5d/math_2armstrong__number_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition:</b> armstrong_number.cpp:59</div></div>
<div class="ttc" id="anamespacequadratic__probing_html_a00ebcc6d39653eccc26f8432efbfc8d9"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9">quadratic_probing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:182</div></div>
<div class="ttc" id="ajumpgame_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> jumpgame.cpp:65</div></div>
<div class="ttc" id="aclose_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">std::ofstream::close</a></div><div class="ttdeci">T close(T... args)</div></div>
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_acd397b51fcf8f690b03e406ada8c9d13"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#acd397b51fcf8f690b03e406ada8c9d13">machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; __detailed_single_prediction(const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;X)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:289</div></div>
<div class="ttc" id="aneural__network_8cpp_html_a45d3e30406712ada3d9713ece3c1b153"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153">machine_learning::neural_network::util_functions::square</a></div><div class="ttdeci">double square(const double &amp;x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:106</div></div>
@@ -877,6 +879,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="atrie__modern_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:160</div></div>
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a176b955c90ae57d7dbc3c63f27c84c75"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork(const NeuralNetwork &amp;model)=default</div></div>
<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="ajumpgame_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../df/d64/jumpgame_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> jumpgame.cpp:41</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="anamespacemachine__learning_html_a05b9445c6ab65053b9bf9897a96af82d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a05b9445c6ab65053b9bf9897a96af82d">machine_learning::minmax_scaler</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; minmax_scaler(const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt;&gt;&gt; &amp;A, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:269</div></div>

6
d8/df6/jumpgame_8cpp__incl.map Normal file
View File

@@ -0,0 +1,6 @@
<map id="greedy_algorithms/jumpgame.cpp" name="greedy_algorithms/jumpgame.cpp">
<area shape="rect" id="node1" title="Implementation of an algorithm to solve the jumping game problem." alt="" coords="15,5,233,32"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,80,64,107"/>
<area shape="rect" id="node3" title=" " alt="" coords="88,80,160,107"/>
<area shape="rect" id="node4" title=" " alt="" coords="185,80,250,107"/>
</map>

1
d8/df6/jumpgame_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
4a111bd61b9c7d8827958e3837d84c9a

67
d8/df6/jumpgame_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,67 @@
<?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 2.44.1 (20200629.0846)
-->
<!-- Title: greedy_algorithms/jumpgame.cpp Pages: 1 -->
<svg width="192pt" height="84pt"
viewBox="0.00 0.00 191.50 84.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 80)">
<title>greedy_algorithms/jumpgame.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 187.5,-80 187.5,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Implementation of an algorithm to solve the jumping game problem.">
<polygon fill="#bfbfbf" stroke="black" points="7.5,-56.5 7.5,-75.5 170.5,-75.5 170.5,-56.5 7.5,-56.5"/>
<text text-anchor="middle" x="89" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/jumpgame.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 44,-19.5 44,-0.5 0,-0.5"/>
<text text-anchor="middle" x="22" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M78.24,-56.32C68.23,-48.26 53.11,-36.08 41.07,-26.37"/>
<polygon fill="midnightblue" stroke="midnightblue" points="42.94,-23.38 32.96,-19.83 38.55,-28.83 42.94,-23.38"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="62,-0.5 62,-19.5 116,-19.5 116,-0.5 62,-0.5"/>
<text text-anchor="middle" x="89" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M89,-56.08C89,-49.01 89,-38.86 89,-29.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="92.5,-29.75 89,-19.75 85.5,-29.75 92.5,-29.75"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="134.5,-0.5 134.5,-19.5 183.5,-19.5 183.5,-0.5 134.5,-0.5"/>
<text text-anchor="middle" x="159" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M100.25,-56.32C110.8,-48.18 126.8,-35.84 139.44,-26.09"/>
<polygon fill="midnightblue" stroke="midnightblue" points="141.77,-28.71 147.55,-19.83 137.49,-23.17 141.77,-28.71"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.9 KiB