Documentation for dfe5bd7638

d4/d86/large__number_8h_source.html

@@ -473,6 +473,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
 <div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:120</div></div>
 <div class="ttc" id="aclass_complex_html_a36739619a07b5478bcd8a28ad2f8b7da"><div class="ttname"><a href="../../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da">Complex::operator-</a></div><div class="ttdeci">Complex operator-(const Complex &amp;other)</div><div class="ttdoc">Operator overload of '-' on Complex class. Operator overload to be able to subtract two complex numbe...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:106</div></div>
 <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="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 &amp;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&lt; std::vector&lt; int &gt;&gt; *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>
@@ -581,11 +582,13 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
 <div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/at.html">std::vector::at</a></div><div class="ttdeci">T at(T... args)</div></div>
 <div class="ttc" id="aclasslarge__number_html_ae35a55607cf52c0b0d485f2129bd39ac"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac">large_number::digit_char</a></div><div class="ttdeci">char digit_char(size_t i) const</div><div class="ttdef"><b>Definition:</b> large_number.h:248</div></div>
 <div class="ttc" id="aclasslarge__number_html_ace19126cf343a09efc0010735f6e3a8d"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ace19126cf343a09efc0010735f6e3a8d">large_number::operator[]</a></div><div class="ttdeci">unsigned char &amp; operator[](size_t n)</div><div class="ttdef"><b>Definition:</b> large_number.h:137</div></div>
+<div class="ttc" id="anamespacegraph_html_a2e6017a54d445819ede9adcf33240e1a"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a2e6017a54d445819ede9adcf33240e1a">graph::depth_first_search</a></div><div class="ttdeci">void depth_first_search(const std::vector&lt; std::vector&lt; size_t &gt;&gt; &amp;adj, size_t start)</div><div class="ttdoc">initiates depth first search algorithm.</div><div class="ttdef"><b>Definition:</b> depth_first_search.cpp:99</div></div>
 <div class="ttc" id="aclasshash__chain_html_ae9ddce410015ed8dda6380130d82d6c2"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">hash_chain::_mod</a></div><div class="ttdeci">int _mod</div><div class="ttdoc">modulus of the class</div><div class="ttdef"><b>Definition:</b> chaining.cpp:27</div></div>
 <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
 <div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div>
 <div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div><div class="ttdoc">STL class.</div></div>
 <div class="ttc" id="astruct_segment_intersection_html_a3beb2ac1b35d67354f1dbaf9a971e655"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">SegmentIntersection::direction</a></div><div class="ttdeci">int direction(Point first_point, Point second_point, Point third_point)</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:63</div></div>
+<div class="ttc" id="adepth__first__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> depth_first_search.cpp:109</div></div>
 <div class="ttc" id="aclassmachine__learning_1_1adaline_html_a28160d17e492597a2f112e0d38551cda"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">machine_learning::adaline::eta</a></div><div class="ttdeci">const double eta</div><div class="ttdoc">learning rate of the algorithm</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:207</div></div>
 <div class="ttc" id="amin_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">std::min_element</a></div><div class="ttdeci">T min_element(T... args)</div></div>
 <div class="ttc" id="aeulers__totient__function_8cpp_html_a35e4874a3e1d67eb708dc57944c8aea0"><div class="ttname"><a href="../../da/d23/eulers__totient__function_8cpp.html#a35e4874a3e1d67eb708dc57944c8aea0">phiFunction</a></div><div class="ttdeci">uint64_t phiFunction(uint64_t n)</div><div class="ttdef"><b>Definition:</b> eulers_totient_function.cpp:32</div></div>
@@ -593,7 +596,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
 <div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a70dea3a7ae9738067e6b84abc192e429"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a70dea3a7ae9738067e6b84abc192e429">graph::is_graph_bipartite::Graph::adj</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; adj</div><div class="ttdoc">size of the graph</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:53</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="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/top.html">std::stack::top</a></div><div class="ttdeci">T top(T... args)</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="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>
 <div class="ttc" id="aclass_trie_html_a6af57e9f25d0d0a2d59eea5a4a802908"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908">Trie::Trie</a></div><div class="ttdeci">Trie()</div><div class="ttdoc">constructor to initialise the root of the trie.</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:103</div></div>
 <div class="ttc" id="astructmst_html"><div class="ttname"><a href="../../d1/d77/structmst.html">mst</a></div><div class="ttdef"><b>Definition:</b> prims_minimum_spanning_tree.cpp:9</div></div>
@@ -777,7 +780,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
 <div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_ad2032148b2443f5b6a0d01e4519d6898"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#ad2032148b2443f5b6a0d01e4519d6898">graph::LowestCommonAncestor::up</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; up</div><div class="ttdoc">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:206</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="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="aclass_graph_html_ae30edce9b4e7c6347e67edc343f366d8"><div class="ttname"><a href="../../da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList const &amp;adjList)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:68</div></div>
 <div class="ttc" id="aclasslarge__number_html_ac4fafa6289295419d48d444f0ae4b706"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac4fafa6289295419d48d444f0ae4b706">large_number::operator++</a></div><div class="ttdeci">large_number &amp; operator++(int)</div><div class="ttdef"><b>Definition:</b> large_number.h:183</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>
@@ -798,7 +800,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
 <div class="ttc" id="aclassstack_html_a5cc5efbbd4ea14b3e378580f1388423b"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5cc5efbbd4ea14b3e378580f1388423b">stack::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> stack.h:112</div></div>
 <div class="ttc" id="aadaline__learning_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:357</div></div>
 <div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition:</b> list_array.cpp:8</div></div>
-<div class="ttc" id="amemset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/memset.html">std::memset</a></div><div class="ttdeci">T memset(T... args)</div></div>
 <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&lt; std::valarray&lt; double &gt;&gt; *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:196</div></div>
 <div class="ttc" id="acheck__amicable__pair_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:68</div></div>