backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-31 01:02:46 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for c8ce6f404c

Browse Source
This commit is contained in:
github-actions
2020-11-20 19:01:05 +00:00
parent 28a36dbd0c
commit a3bea7d7bd
234 changed files with 6454 additions and 5029 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
d8/d95/vector__ops_8hpp_source.html
View File

@@ -621,6 +621,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
<div class="ttc" id="anamespacegraph_html_a454891267187a5ec6c6e3f3ad5203ff1"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a454891267187a5ec6c6e3f3ad5203ff1">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; std::pair&lt; int, int &gt;&gt;&gt; *adj, int u, int v, int w)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition:</b> dijkstra.cpp:48</div></div>
<div class="ttc" id="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div>
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_aa3848a7213562b47084585499d3642a5"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#aa3848a7213562b47084585499d3642a5">graph::bidirectional_dijkstra::Bidijkstra</a></div><div class="ttdeci">int Bidijkstra(std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt;&gt;&gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt;&gt;&gt; *adj2, uint64_t s, uint64_t t)</div><div class="ttdoc">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:86</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a73ee7ed3546ab9e8792a92336d0d14ab"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a73ee7ed3546ab9e8792a92336d0d14ab">machine_learning::uniform_random_initialization</a></div><div class="ttdeci">void uniform_random_initialization(std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:166</div></div>
<div class="ttc" id="asetprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setprecision.html">std::setprecision</a></div><div class="ttdeci">T setprecision(T... args)</div></div>
<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
@@ -724,6 +725,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="agroup__machine__learning_html_ga72699c805c19a6cc47a937a6f3378afa"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga72699c805c19a6cc47a937a6f3378afa">save_nd_data</a></div><div class="ttdeci">int save_nd_data(const char *fname, const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;X)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:58</div></div>
<div class="ttc" id="ahash__search_8cpp_html_a8ca8dcb494104d273679e219e53d0555"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a></div><div class="ttdeci">struct list node</div></div>
<div class="ttc" id="aclasshash__chain_html"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html">hash_chain</a></div><div class="ttdoc">Chain class with a given modulus.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:16</div></div>
<div class="ttc" id="anamespacebidirectional__dijkstra_html"><div class="ttname"><a href="../../d4/d13/namespacebidirectional__dijkstra.html">bidirectional_dijkstra</a></div><div class="ttdoc">Functions for Bidirectional Dijkstra Shortest Path algorithm.</div></div>
<div class="ttc" id="anamespacemincoins__topdown_html"><div class="ttname"><a href="../../d5/db8/namespacemincoins__topdown.html">mincoins_topdown</a></div><div class="ttdoc">Functions for minimum coin exchange problem.</div></div>
<div class="ttc" id="akohonen__som__trace_8cpp_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:452</div></div>
<div class="ttc" id="ahill__cipher_8cpp_html_a04391124480d2a49f2dec900237b0712"><div class="ttname"><a href="../../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712">test2</a></div><div class="ttdeci">void test2(const std::string &amp;text)</div><div class="ttdoc">Self test 2 - using 8x8 randomly generated key.</div><div class="ttdef"><b>Definition:</b> hill_cipher.cpp:505</div></div>
@@ -803,6 +805,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="aclass_cycle_check_html_a2f4485c08b45e7a21a2e86f9c3f01d8b"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">CycleCheck::isCyclicDFSHelper</a></div><div class="ttdeci">static bool isCyclicDFSHelper(AdjList const &amp;adjList, std::vector&lt; nodeStates &gt; *state, unsigned int node)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:170</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_aacdeecac857623e9fbfe92590f3c504d"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">graph::RootedTree::RootedTree</a></div><div class="ttdeci">RootedTree(const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;undirected_edges, int root_)</div><div class="ttdoc">Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is ...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:93</div></div>
<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="abidirectional__dijkstra_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the provided algorithm above.</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:199</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:127</div></div>
@@ -828,6 +831,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="aneural__network_8cpp_html_a23aa9d32bcbcd65cfc85f0a41e2afadc"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc">machine_learning::neural_network::activations::sigmoid</a></div><div class="ttdeci">double sigmoid(const double &amp;x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:60</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:47</div></div>
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_ab322409d0015c023d91c67b5b2679257"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ab322409d0015c023d91c67b5b2679257">graph::bidirectional_dijkstra::Shortest_Path_Distance</a></div><div class="ttdeci">uint64_t Shortest_Path_Distance(const std::vector&lt; uint64_t &gt; &amp;workset_, const std::vector&lt; std::vector&lt; uint64_t &gt;&gt; &amp;distance_)</div><div class="ttdoc">This function returns the shortest distance from the source to the target if there is path between ve...</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:61</div></div>
<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">std::priority_queue::top</a></div><div class="ttdeci">T top(T... args)</div></div>
<div class="ttc" id="aneural__network_8cpp_html_af8f264600754602b6a9ea19cc690e50e"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e">machine_learning::neural_network::activations::relu</a></div><div class="ttdeci">double relu(const double &amp;x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:74</div></div>
<div class="ttc" id="aclass_edge_html_a415a5d002fe11c58711e48aabe975980"><div class="ttname"><a href="../../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">Edge::Edge</a></div><div class="ttdeci">Edge(unsigned int source, unsigned int destination)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:40</div></div>
@@ -842,6 +846,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<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="abidirectional__dijkstra_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:248</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>
<div class="ttc" id="achaining_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> chaining.cpp:133</div></div>
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:103</div></div>
@@ -965,7 +970,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="anamespacedouble__hashing_html_a79a9c914a6c68275b3640303d7faad8a"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">double_hashing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:185</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:71</div></div>
<div class="ttc" id="alowest__common__ancestor_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:255</div></div>
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph algorithms.</div></div>
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
<div class="ttc" id="aclasshash__chain_html_a80c8b902a15b4fd062ed727ecf8f3595"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595">hash_chain::hash_chain</a></div><div class="ttdeci">hash_chain(int mod)</div><div class="ttdoc">Construct a new chain object.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:35</div></div>
<div class="ttc" id="acount_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a></div><div class="ttdeci">T count(T... args)</div></div>
<div class="ttc" id="avector__ops_8hpp_html"><div class="ttname"><a href="../../d8/d95/vector__ops_8hpp.html">vector_ops.hpp</a></div><div class="ttdoc">Various functions for vectors associated with NeuralNetwork (aka Multilayer Perceptron).</div></div>
@@ -997,6 +1002,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="aword__break_8cpp_html_a272b0f5cdb4e41fd6dee4538b808c06a"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">dynamic_programming::word_break::check</a></div><div class="ttdeci">bool check(const std::string &amp;s, const std::unordered_set&lt; std::string &gt; &amp;strSet, int pos, std::vector&lt; int &gt; *dp)</div><div class="ttdoc">Function that checks if the string passed in param can be segmented from position 'pos',...</div><div class="ttdef"><b>Definition:</b> word_break.cpp:80</div></div>
<div class="ttc" id="a0__1__knapsack_8cpp_html_a15edf30f336885e5b851f6b7199c6cd1"><div class="ttname"><a href="../../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a></div><div class="ttdeci">int maxKnapsackValue(const int capacity, const std::array&lt; int, n &gt; &amp;weight, const std::array&lt; int, n &gt; &amp;value)</div><div class="ttdoc">Picking up all those items whose combined weight is below given capacity and calculating value of tho...</div><div class="ttdef"><b>Definition:</b> 0_1_knapsack.cpp:51</div></div>
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a330a2b0a904f01802ada1f8f3b28e76c"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a></div><div class="ttdeci">constexpr int64_t INF</div><div class="ttdoc">for store the graph, the distances, and the path</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:23</div></div>
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
<div class="ttc" id="anamespacequadratic__probing_html_a2093d91dd3d377cf0a5c939e45dcefc7"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">quadratic_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:46</div></div>
<div class="ttc" id="amalloc_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/c/malloc.html">std::malloc</a></div><div class="ttdeci">T malloc(T... args)</div></div>