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

Documentation for 901f231d59

Browse Source
This commit is contained in:
realstealthninja
2024-10-04 13:20:41 +00:00
parent e41ab558c4
commit 13fd79a77e
49 changed files with 1522 additions and 318 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
d2/d90/namespacegreedy__algorithms.html
View File

@@ -119,6 +119,9 @@ Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html">dijkstra</a></td></tr>
<tr class="memdesc:d2/d2f/namespacegreedy__algorithms_1_1dijkstra"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html">stable_matching</a></td></tr>
<tr class="memdesc:dd/d9a/namespacegreedy__algorithms_1_1stable__matching"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the Gale-Shapley Algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
@@ -133,8 +136,11 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
<p>for uint32_t</p>
<p>for assert</p>
<p>for assert for INT_MAX for IO operations</p>
<p>Greedy Algorithms</p>
<p>for std::u32int_t for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a></p>
<p>Greedy Algorithms</p>
<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
<p>Greedy Algorithms</p>
<p>for array for IO operations for numeric limits</p>

3
d2/d90/namespacegreedy__algorithms.js
View File

@@ -1,6 +1,9 @@
var namespacegreedy__algorithms =
[
[ "dijkstra", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra" ],
[ "stable_matching", "dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html", [
[ "gale_shapley", "dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c", null ]
] ],
[ "can_jump", "d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502", null ],
[ "findMinimumEdge", "d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098", null ]
];

250
db/d80/gale__shapley_8cpp.html Normal file
View File

@@ -0,0 +1,250 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: greedy_algorithms/gale_shapley.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('db/d80/gale__shapley_8cpp.html','../../'); initResizable(true); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">gale_shapley.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Gale Shapley Algorithm</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
<code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for gale_shapley.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/dab/gale__shapley_8cpp__incl.svg" width="350" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html">greedy_algorithms::stable_matching</a></td></tr>
<tr class="memdesc:dd/d9a/namespacegreedy__algorithms_1_1stable__matching"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the Gale-Shapley Algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a6d7e84df47dcf19e88f95f8f9040306c" id="r_a6d7e84df47dcf19e88f95f8f9040306c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;secondary_preferences, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;primary_preferences)</td></tr>
<tr class="memdesc:a6d7e84df47dcf19e88f95f8f9040306c"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function that finds the stable matching between two sets of elements using the Gale-Shapley Algorithm. <br /></td></tr>
<tr class="separator:a6d7e84df47dcf19e88f95f8f9040306c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Gale Shapley Algorithm</a> </p>
<p>This implementation utilizes the Gale-Shapley algorithm to find stable matches.</p>
<p><b>Gale Shapley Algorithm</b> aims to find a stable matching between two equally sized sets of elements given an ordinal preference for each element. The algorithm was introduced by David Gale and Lloyd Shapley in 1962.</p>
<p>Reference: <a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Wikipedia</a> <a href="https://en.wikipedia.org/wiki/Stable_matching_problem" target="_blank">Wikipedia</a></p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/BKarthik7" target="_blank">B Karthik</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 126</span> {</div>
<div class="line"><span class="lineno"> 127</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// Run self-test implementations</span></div>
<div class="line"><span class="lineno"> 128</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 129</span>}</div>
<div class="ttc" id="agale__shapley_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> gale_shapley.cpp:100</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="471" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">&#9670;&#160;</a></span>tests()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void tests </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 100</span> {</div>
<div class="line"><span class="lineno"> 101</span> <span class="comment">// Test Case 1</span></div>
<div class="line"><span class="lineno"> 102</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::uint32_t&gt;</a>&gt; primary_preferences = {{0, 1, 2, 3}, {2, 1, 3, 0}, {1, 2, 0, 3}, {3, 0, 1, 2}};</div>
<div class="line"><span class="lineno"> 103</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::uint32_t&gt;</a>&gt; secondary_preferences = {{1, 0, 2, 3}, {3, 0, 1, 2}, {0, 2, 1, 3}, {1, 2, 0, 3}};</div>
<div class="line"><span class="lineno"> 104</span> assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(secondary_preferences, primary_preferences) == <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a>({0, 2, 1, 3}));</div>
<div class="line"><span class="lineno"> 105</span> </div>
<div class="line"><span class="lineno"> 106</span> <span class="comment">// Test Case 2</span></div>
<div class="line"><span class="lineno"> 107</span> primary_preferences = {{0, 2, 1, 3}, {2, 3, 0, 1}, {3, 1, 2, 0}, {2, 1, 0, 3}};</div>
<div class="line"><span class="lineno"> 108</span> secondary_preferences = {{1, 0, 2, 3}, {3, 0, 1, 2}, {0, 2, 1, 3}, {1, 2, 0, 3}};</div>
<div class="line"><span class="lineno"> 109</span> assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(secondary_preferences, primary_preferences) == <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a>({0, 3, 1, 2}));</div>
<div class="line"><span class="lineno"> 110</span> </div>
<div class="line"><span class="lineno"> 111</span> <span class="comment">// Test Case 3</span></div>
<div class="line"><span class="lineno"> 112</span> primary_preferences = {{0, 1, 2}, {2, 1, 0}, {1, 2, 0}};</div>
<div class="line"><span class="lineno"> 113</span> secondary_preferences = {{1, 0, 2}, {2, 0, 1}, {0, 2, 1}};</div>
<div class="line"><span class="lineno"> 114</span> assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(secondary_preferences, primary_preferences) == <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a>({0, 2, 1}));</div>
<div class="line"><span class="lineno"> 115</span> </div>
<div class="line"><span class="lineno"> 116</span> <span class="comment">// Test Case 4</span></div>
<div class="line"><span class="lineno"> 117</span> primary_preferences = {};</div>
<div class="line"><span class="lineno"> 118</span> secondary_preferences = {};</div>
<div class="line"><span class="lineno"> 119</span> assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(secondary_preferences, primary_preferences) == <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a>({}));</div>
<div class="line"><span class="lineno"> 120</span>}</div>
<div class="ttc" id="anamespacegreedy__algorithms_1_1stable__matching_html_a6d7e84df47dcf19e88f95f8f9040306c"><div class="ttname"><a href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a></div><div class="ttdeci">std::vector&lt; std::uint32_t &gt; gale_shapley(const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;secondary_preferences, const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;primary_preferences)</div><div class="ttdoc">The main function that finds the stable matching between two sets of elements using the Gale-Shapley ...</div><div class="ttdef"><b>Definition</b> gale_shapley.cpp:42</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="374" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../db/d80/gale__shapley_8cpp.html">gale_shapley.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
</ul>
</div>
</body>
</html>

6
db/d80/gale__shapley_8cpp.js Normal file
View File

@@ -0,0 +1,6 @@
var gale__shapley_8cpp =
[
[ "gale_shapley", "db/d80/gale__shapley_8cpp.html#a6d7e84df47dcf19e88f95f8f9040306c", null ],
[ "main", "db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "tests", "db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
];

7
db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="tests" name="tests">
<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,20,56,46"/>
<area shape="rect" id="Node000002" href="$dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ..." alt="" coords="104,5,252,61"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,30,88,30,88,36,56,36"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/find.html#" title=" " alt="" coords="300,20,368,46"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="252,30,284,30,284,36,252,36"/>
</map>

1
db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
10eb6585cdd9e9d606f67df39451ea7a

85
db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg Normal file
View File

@@ -0,0 +1,85 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: tests Pages: 1 -->
<svg width="280pt" height="50pt"
viewBox="0.00 0.00 280.25 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
<title>tests</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="37.75,-30.5 0,-30.5 0,-11.25 37.75,-11.25 37.75,-30.5"/>
<text text-anchor="middle" x="18.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" target="_top" xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
<polygon fill="white" stroke="#666666" points="185,-41.75 73.75,-41.75 73.75,0 185,0 185,-41.75"/>
<text text-anchor="start" x="81.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
<text text-anchor="middle" x="129.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.79,-20.88C44.73,-20.88 53.14,-20.88 62.01,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.89,-24.38 71.89,-20.88 61.89,-17.38 61.89,-24.38"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="272.25,-30.5 221,-30.5 221,-11.25 272.25,-11.25 272.25,-30.5"/>
<text text-anchor="middle" x="246.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M185.3,-20.88C193.44,-20.88 201.66,-20.88 209.29,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.2,-24.38 219.2,-20.88 209.2,-17.38 209.2,-24.38"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.6 KiB

59
db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg Normal file
View File

@@ -0,0 +1,59 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: tests Pages: 1 -->
<svg width="280pt" height="50pt"
viewBox="0.00 0.00 280.25 49.75" 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 45.75)">
<title>tests</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="37.75,-30.5 0,-30.5 0,-11.25 37.75,-11.25 37.75,-30.5"/>
<text text-anchor="middle" x="18.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" target="_top" xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
<polygon fill="white" stroke="#666666" points="185,-41.75 73.75,-41.75 73.75,0 185,0 185,-41.75"/>
<text text-anchor="start" x="81.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
<text text-anchor="middle" x="129.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.79,-20.88C44.73,-20.88 53.14,-20.88 62.01,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.89,-24.38 71.89,-20.88 61.89,-17.38 61.89,-24.38"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="272.25,-30.5 221,-30.5 221,-11.25 272.25,-11.25 272.25,-30.5"/>
<text text-anchor="middle" x="246.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M185.3,-20.88C193.44,-20.88 201.66,-20.88 209.29,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.2,-24.38 219.2,-20.88 209.2,-17.38 209.2,-24.38"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.8 KiB

9
db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,20,55,46"/>
<area shape="rect" id="Node000002" href="$db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,20,153,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,30,88,30,88,36,55,36"/>
<area shape="rect" id="Node000003" href="$dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ..." alt="" coords="201,5,349,61"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,30,185,30,185,36,153,36"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/find.html#" title=" " alt="" coords="397,20,466,46"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="350,30,382,30,382,36,350,36"/>
</map>

1
db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
57ab2bbadab7072265c0260236c9486c

103
db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,103 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: main Pages: 1 -->
<svg width="353pt" height="50pt"
viewBox="0.00 0.00 353.25 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-30.5 0,-30.5 0,-11.25 37,-11.25 37,-30.5"/>
<text text-anchor="middle" x="18.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="110.75,-30.5 73,-30.5 73,-11.25 110.75,-11.25 110.75,-30.5"/>
<text text-anchor="middle" x="91.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-20.88C44.55,-20.88 53.37,-20.88 61.69,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-24.38 71.43,-20.88 61.43,-17.38 61.43,-24.38"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" target="_top" xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
<polygon fill="white" stroke="#666666" points="258,-41.75 146.75,-41.75 146.75,0 258,0 258,-41.75"/>
<text text-anchor="start" x="154.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
<text text-anchor="middle" x="202.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M110.79,-20.88C117.73,-20.88 126.14,-20.88 135.01,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.89,-24.38 144.89,-20.88 134.89,-17.38 134.89,-24.38"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="345.25,-30.5 294,-30.5 294,-11.25 345.25,-11.25 345.25,-30.5"/>
<text text-anchor="middle" x="319.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M258.3,-20.88C266.44,-20.88 274.66,-20.88 282.29,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="282.2,-24.38 292.2,-20.88 282.2,-17.38 282.2,-24.38"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.4 KiB

77
db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg Normal file
View File

@@ -0,0 +1,77 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: main Pages: 1 -->
<svg width="353pt" height="50pt"
viewBox="0.00 0.00 353.25 49.75" 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 45.75)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-30.5 0,-30.5 0,-11.25 37,-11.25 37,-30.5"/>
<text text-anchor="middle" x="18.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="110.75,-30.5 73,-30.5 73,-11.25 110.75,-11.25 110.75,-30.5"/>
<text text-anchor="middle" x="91.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-20.88C44.55,-20.88 53.37,-20.88 61.69,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-24.38 71.43,-20.88 61.43,-17.38 61.43,-24.38"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" target="_top" xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
<polygon fill="white" stroke="#666666" points="258,-41.75 146.75,-41.75 146.75,0 258,0 258,-41.75"/>
<text text-anchor="start" x="154.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
<text text-anchor="middle" x="202.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M110.79,-20.88C117.73,-20.88 126.14,-20.88 135.01,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.89,-24.38 144.89,-20.88 134.89,-17.38 134.89,-24.38"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="345.25,-30.5 294,-30.5 294,-11.25 345.25,-11.25 345.25,-30.5"/>
<text text-anchor="middle" x="319.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M258.3,-20.88C266.44,-20.88 274.66,-20.88 282.29,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="282.2,-24.38 292.2,-20.88 282.2,-17.38 282.2,-24.38"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.7 KiB

229
dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html Normal file
View File

@@ -0,0 +1,229 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: greedy_algorithms::stable_matching Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html','../../'); initResizable(true); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">greedy_algorithms::stable_matching Namespace Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Functions for the Gale-Shapley Algorithm.
<a href="#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a6d7e84df47dcf19e88f95f8f9040306c" id="r_a6d7e84df47dcf19e88f95f8f9040306c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d7e84df47dcf19e88f95f8f9040306c">gale_shapley</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;secondary_preferences, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;primary_preferences)</td></tr>
<tr class="memdesc:a6d7e84df47dcf19e88f95f8f9040306c"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function that finds the stable matching between two sets of elements using the Gale-Shapley Algorithm. <br /></td></tr>
<tr class="separator:a6d7e84df47dcf19e88f95f8f9040306c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for the Gale-Shapley Algorithm. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a6d7e84df47dcf19e88f95f8f9040306c" name="a6d7e84df47dcf19e88f95f8f9040306c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6d7e84df47dcf19e88f95f8f9040306c">&#9670;&#160;</a></span>gale_shapley()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; greedy_algorithms::stable_matching::gale_shapley </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>secondary_preferences</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>primary_preferences</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>The main function that finds the stable matching between two sets of elements using the Gale-Shapley Algorithm. </p>
<dl class="section note"><dt>Note</dt><dd>This doesn't work on negative preferences. the preferences should be continuous integers starting from 0 to number of preferences - 1. </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">primary_preferences</td><td>the preferences of the primary set should be a 2D vector </td></tr>
<tr><td class="paramname">secondary_preferences</td><td>the preferences of the secondary set should be a 2D vector </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>matches the stable matching between the two sets </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 42</span> {</div>
<div class="line"><span class="lineno"> 43</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> num_elements = secondary_preferences.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><span class="lineno"> 44</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a> matches(num_elements, -1);</div>
<div class="line"><span class="lineno"> 45</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> is_free_primary(num_elements, <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 46</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a> proposal_index(num_elements, 0); <span class="comment">// Tracks the next secondary to propose for each primary</span></div>
<div class="line"><span class="lineno"> 47</span> </div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
<div class="line"><span class="lineno"> 49</span> <span class="keywordtype">int</span> free_primary_index = -1;</div>
<div class="line"><span class="lineno"> 50</span> </div>
<div class="line"><span class="lineno"> 51</span> <span class="comment">// Find the next free primary</span></div>
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> i = 0; i &lt; num_elements; i++) {</div>
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">if</span> (is_free_primary[i]) {</div>
<div class="line"><span class="lineno"> 54</span> free_primary_index = i;</div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 56</span> }</div>
<div class="line"><span class="lineno"> 57</span> }</div>
<div class="line"><span class="lineno"> 58</span> </div>
<div class="line"><span class="lineno"> 59</span> <span class="comment">// If no free primary is found, break the loop</span></div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">if</span> (free_primary_index == -1) <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 61</span> </div>
<div class="line"><span class="lineno"> 62</span> <span class="comment">// Get the next secondary to propose</span></div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> secondary_to_propose = primary_preferences[free_primary_index][proposal_index[free_primary_index]];</div>
<div class="line"><span class="lineno"> 64</span> proposal_index[free_primary_index]++;</div>
<div class="line"><span class="lineno"> 65</span> </div>
<div class="line"><span class="lineno"> 66</span> <span class="comment">// Get the current match of the secondary</span></div>
<div class="line"><span class="lineno"> 67</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> current_match = matches[secondary_to_propose];</div>
<div class="line"><span class="lineno"> 68</span> </div>
<div class="line"><span class="lineno"> 69</span> <span class="comment">// If the secondary is free, match them</span></div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordflow">if</span> (current_match == -1) {</div>
<div class="line"><span class="lineno"> 71</span> matches[secondary_to_propose] = free_primary_index;</div>
<div class="line"><span class="lineno"> 72</span> is_free_primary[free_primary_index] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 73</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 74</span> <span class="comment">// Determine if the current match should be replaced</span></div>
<div class="line"><span class="lineno"> 75</span> <span class="keyword">auto</span> new_proposer_rank = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a>(secondary_preferences[secondary_to_propose].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a>(),</div>
<div class="line"><span class="lineno"> 76</span> secondary_preferences[secondary_to_propose].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>(),</div>
<div class="line"><span class="lineno"> 77</span> free_primary_index);</div>
<div class="line"><span class="lineno"> 78</span> <span class="keyword">auto</span> current_match_rank = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a>(secondary_preferences[secondary_to_propose].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a>(),</div>
<div class="line"><span class="lineno"> 79</span> secondary_preferences[secondary_to_propose].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>(),</div>
<div class="line"><span class="lineno"> 80</span> current_match);</div>
<div class="line"><span class="lineno"> 81</span> </div>
<div class="line"><span class="lineno"> 82</span> <span class="comment">// If the new proposer is preferred over the current match</span></div>
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">if</span> (new_proposer_rank &lt; current_match_rank) {</div>
<div class="line"><span class="lineno"> 84</span> matches[secondary_to_propose] = free_primary_index;</div>
<div class="line"><span class="lineno"> 85</span> is_free_primary[free_primary_index] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 86</span> is_free_primary[current_match] = <span class="keyword">true</span>; <span class="comment">// Current match is now free</span></div>
<div class="line"><span class="lineno"> 87</span> }</div>
<div class="line"><span class="lineno"> 88</span> }</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="line"><span class="lineno"> 90</span> </div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">return</span> matches;</div>
<div class="line"><span class="lineno"> 92</span>}</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a></div><div class="ttdeci">T find(T... args)</div></div>
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a></div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.svg" width="276" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html">stable_matching</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
</ul>
</div>
</body>
</html>

5
dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="greedy_algorithms::stable_matching::gale_shapley" name="greedy_algorithms::stable_matching::gale_shapley">
<area shape="rect" id="Node000001" title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ..." alt="" coords="5,5,154,61"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/find.html#" title=" " alt="" coords="202,20,270,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="154,30,186,30,186,36,154,36"/>
</map>

1
dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
d3562925c9ac7b7d6fd2b415f97bed7a

67
dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.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 12.1.1 (20240910.0053)
-->
<!-- Title: greedy_algorithms::stable_matching::gale_shapley Pages: 1 -->
<svg width="207pt" height="50pt"
viewBox="0.00 0.00 206.50 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
<title>greedy_algorithms::stable_matching::gale_shapley</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
<polygon fill="#999999" stroke="#666666" points="111.25,-41.75 0,-41.75 0,0 111.25,0 111.25,-41.75"/>
<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="198.5,-30.5 147.25,-30.5 147.25,-11.25 198.5,-11.25 198.5,-30.5"/>
<text text-anchor="middle" x="172.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.55,-20.88C119.69,-20.88 127.91,-20.88 135.54,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.45,-24.38 145.45,-20.88 135.45,-17.38 135.45,-24.38"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.8 KiB

41
dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph_org.svg Normal file
View File

@@ -0,0 +1,41 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: greedy_algorithms::stable_matching::gale_shapley Pages: 1 -->
<svg width="207pt" height="50pt"
viewBox="0.00 0.00 206.50 49.75" 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 45.75)">
<title>greedy_algorithms::stable_matching::gale_shapley</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
<polygon fill="#999999" stroke="#666666" points="111.25,-41.75 0,-41.75 0,0 111.25,0 111.25,-41.75"/>
<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="198.5,-30.5 147.25,-30.5 147.25,-11.25 198.5,-11.25 198.5,-30.5"/>
<text text-anchor="middle" x="172.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.55,-20.88C119.69,-20.88 127.91,-20.88 135.54,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.45,-24.38 145.45,-20.88 135.45,-17.38 135.45,-24.38"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.1 KiB

11
dd/dab/gale__shapley_8cpp__incl.map Normal file
View File

@@ -0,0 +1,11 @@
<map id="greedy_algorithms/gale_shapley.cpp" name="greedy_algorithms/gale_shapley.cpp">
<area shape="rect" id="Node000001" title="Gale Shapley Algorithm" alt="" coords="95,5,251,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,77,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,49,76,88,73,83,139,44"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="100,94,158,120"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="164,48,145,82,141,79,160,45"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="181,94,256,120"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="187,45,206,79,201,82,182,48"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="280,94,344,120"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="209,44,279,84,276,88,206,49"/>
</map>

1
dd/dab/gale__shapley_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
4b4ec511a50c6aac961709ae72aea6f2

120
dd/dab/gale__shapley_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,120 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: greedy_algorithms/gale_shapley.cpp Pages: 1 -->
<svg width="262pt" height="94pt"
viewBox="0.00 0.00 261.88 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.75)">
<title>greedy_algorithms/gale_shapley.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Gale Shapley Algorithm">
<polygon fill="#999999" stroke="#666666" points="184,-85.75 67.5,-85.75 67.5,-55.25 184,-55.25 184,-85.75"/>
<text text-anchor="start" x="75.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/gale</text>
<text text-anchor="middle" x="125.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M101.02,-54.8C85.95,-45.83 66.74,-34.41 51.63,-25.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="53.62,-22.53 43.23,-20.43 50.04,-28.55 53.62,-22.53"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="114.25,-19.25 71.25,-19.25 71.25,0 114.25,0 114.25,-19.25"/>
<text text-anchor="middle" x="92.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M117.59,-54.95C113.29,-47.28 107.97,-37.77 103.35,-29.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="106.52,-28.03 98.58,-21.02 100.41,-31.46 106.52,-28.03"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="187.62,-19.25 131.88,-19.25 131.88,0 187.62,0 187.62,-19.25"/>
<text text-anchor="middle" x="159.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M134.15,-54.95C138.58,-47.28 144.07,-37.77 148.83,-29.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.78,-31.42 153.75,-21.01 145.72,-27.92 151.78,-31.42"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="253.88,-19.25 205.62,-19.25 205.62,0 253.88,0 253.88,-19.25"/>
<text text-anchor="middle" x="229.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M151.73,-54.8C167.72,-45.74 188.13,-34.19 204.07,-25.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="205.51,-28.37 212.48,-20.4 202.06,-22.28 205.51,-28.37"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.7 KiB

94
dd/dab/gale__shapley_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,94 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: greedy_algorithms/gale_shapley.cpp Pages: 1 -->
<svg width="262pt" height="94pt"
viewBox="0.00 0.00 261.88 93.75" 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 89.75)">
<title>greedy_algorithms/gale_shapley.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Gale Shapley Algorithm">
<polygon fill="#999999" stroke="#666666" points="184,-85.75 67.5,-85.75 67.5,-55.25 184,-55.25 184,-85.75"/>
<text text-anchor="start" x="75.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/gale</text>
<text text-anchor="middle" x="125.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M101.02,-54.8C85.95,-45.83 66.74,-34.41 51.63,-25.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="53.62,-22.53 43.23,-20.43 50.04,-28.55 53.62,-22.53"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="114.25,-19.25 71.25,-19.25 71.25,0 114.25,0 114.25,-19.25"/>
<text text-anchor="middle" x="92.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M117.59,-54.95C113.29,-47.28 107.97,-37.77 103.35,-29.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="106.52,-28.03 98.58,-21.02 100.41,-31.46 106.52,-28.03"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="187.62,-19.25 131.88,-19.25 131.88,0 187.62,0 187.62,-19.25"/>
<text text-anchor="middle" x="159.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M134.15,-54.95C138.58,-47.28 144.07,-37.77 148.83,-29.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.78,-31.42 153.75,-21.01 145.72,-27.92 151.78,-31.42"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="253.88,-19.25 205.62,-19.25 205.62,0 253.88,0 253.88,-19.25"/>
<text text-anchor="middle" x="229.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M151.73,-54.8C167.72,-45.74 188.13,-34.19 204.07,-25.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="205.51,-28.37 212.48,-20.4 202.06,-22.28 205.51,-28.37"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.9 KiB

3
dir_0eaa691bd54ab0922ca7f50599de6d22.html
View File

@@ -116,6 +116,9 @@ Files</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html">dijkstra.cpp</a></td></tr>
<tr class="memdesc:df/dcb/greedy__algorithms_2dijkstra_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d80/gale__shapley_8cpp.html">gale_shapley.cpp</a></td></tr>
<tr class="memdesc:db/d80/gale__shapley_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Gale Shapley Algorithm</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dba/jump__game_8cpp.html">jump_game.cpp</a></td></tr>
<tr class="memdesc:d6/dba/jump__game_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

1
dir_0eaa691bd54ab0922ca7f50599de6d22.js
View File

@@ -2,6 +2,7 @@ var dir_0eaa691bd54ab0922ca7f50599de6d22 =
[
[ "boruvkas_minimum_spanning_tree.cpp", "d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html", "d4/d6c/boruvkas__minimum__spanning__tree_8cpp" ],
[ "dijkstra.cpp", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html", "df/dcb/greedy__algorithms_2dijkstra_8cpp" ],
[ "gale_shapley.cpp", "db/d80/gale__shapley_8cpp.html", "db/d80/gale__shapley_8cpp" ],
[ "jump_game.cpp", "d6/dba/jump__game_8cpp.html", "d6/dba/jump__game_8cpp" ],
[ "kruskals_minimum_spanning_tree.cpp", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html", "d8/d7d/kruskals__minimum__spanning__tree_8cpp" ]
];

8
doxygen_crawl.html
View File

@@ -118,6 +118,7 @@
<a href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html"/>
<a href="d7/d1e/graph_2dijkstra_8cpp.html"/>
<a href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html"/>
<a href="db/d80/gale__shapley_8cpp.html"/>
<a href="d6/dba/jump__game_8cpp.html"/>
<a href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html"/>
<a href="d9/d92/chaining_8cpp.html"/>
@@ -509,6 +510,7 @@
<a href="d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html"/>
<a href="d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html"/>
<a href="d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html"/>
<a href="dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html"/>
<a href="d0/d20/namespaceground__to__ground__projectile__motion.html"/>
<a href="d4/d1c/namespacehamming__distance.html"/>
<a href="d6/d0c/namespacehashing.html"/>
@@ -3102,6 +3104,10 @@
<a href="db/d71/quadratic__probing__hash__table_8cpp.html#adccc63a7e57cc6dba75bd62f40feb88b"/>
<a href="db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="db/d71/quadratic__probing__hash__table_8cpp.html#aeb6bca8db4768226f8ea8291ea4f83f6"/>
<a href="db/d80/gale__shapley_8cpp.html"/>
<a href="db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
<a href="db/d80/gale__shapley_8cpp.html#a6d7e84df47dcf19e88f95f8f9040306c"/>
<a href="db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="db/d82/classlarge__number.html"/>
<a href="db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872"/>
<a href="db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337"/>
@@ -3590,6 +3596,8 @@
<a href="dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841"/>
<a href="dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52"/>
<a href="dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17"/>
<a href="dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html"/>
<a href="dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c"/>
<a href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html"/>
<a href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101"/>
<a href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9"/>

5
files.html
View File

@@ -219,8 +219,9 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
<tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="dynsection.toggleFolder('11_')">&#9658;</span><span id="img_11_" class="iconfclosed" onclick="dynsection.toggleFolder('11_')">&#160;</span><a class="el" href="dir_0eaa691bd54ab0922ca7f50599de6d22.html" target="_self">greedy_algorithms</a></td><td class="desc"></td></tr>
<tr id="row_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html" target="_self">boruvkas_minimum_spanning_tree.cpp</a></td><td class="desc">[Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) to find the <a class="el" href="d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning Tree </td></tr>
<tr id="row_11_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html" target="_self">dijkstra.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation </td></tr>
<tr id="row_11_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/dba/jump__game_8cpp.html" target="_self">jump_game.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation </td></tr>
<tr id="row_11_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html" target="_self">kruskals_minimum_spanning_tree.cpp</a></td><td class="desc"><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation </td></tr>
<tr id="row_11_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d80/gale__shapley_8cpp.html" target="_self">gale_shapley.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Gale Shapley Algorithm</a> </td></tr>
<tr id="row_11_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/dba/jump__game_8cpp.html" target="_self">jump_game.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation </td></tr>
<tr id="row_11_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html" target="_self">kruskals_minimum_spanning_tree.cpp</a></td><td class="desc"><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation </td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="dynsection.toggleFolder('12_')">&#9658;</span><span id="img_12_" class="iconfclosed" onclick="dynsection.toggleFolder('12_')">&#160;</span><a class="el" href="dir_ece9b94c107bbaa1dd68197a8c9983b9.html" target="_self">hashing</a></td><td class="desc"></td></tr>
<tr id="row_12_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d92/chaining_8cpp.html" target="_self">chaining.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hash_chain" target="_blank">hash chains</a> </td></tr>
<tr id="row_12_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d80/double__hash__hash__table_8cpp.html" target="_self">double_hash_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double-hashed keys</a> </td></tr>

2
globals_func_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_func_t.html
View File

@@ -145,7 +145,7 @@ $(function(){initNavTree('globals_func_t.html',''); initResizable(true); });
<li>test_longest_common_string_length_for_reversed_inputs()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">longest_common_string.cpp</a></li>
<li>test_longest_common_string_length_is_symmetric()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">longest_common_string.cpp</a></li>
<li>test_remove()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">binary_search_tree2.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">quick_sort_iterative.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a>, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">knuth_morris_pratt.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">gale_shapley.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">quick_sort_iterative.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a>, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">knuth_morris_pratt.cpp</a></li>
<li>TH()&#160;:&#160;<a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a></li>
<li>tolowerRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">decimal_to_roman_numeral.cpp</a></li>
<li>toupperRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">decimal_to_roman_numeral.cpp</a></li>

2
globals_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_t.html
View File

@@ -146,7 +146,7 @@ $(function(){initNavTree('globals_t.html',''); initResizable(true); });
<li>test_longest_common_string_length_is_symmetric()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">longest_common_string.cpp</a></li>
<li>test_remove()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">binary_search_tree2.cpp</a></li>
<li>test_set&#160;:&#160;<a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">brute_force_string_searching.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">quick_sort_iterative.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a>, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">knuth_morris_pratt.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">gale_shapley.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">quick_sort_iterative.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a>, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">knuth_morris_pratt.cpp</a></li>
<li>TH()&#160;:&#160;<a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a></li>
<li>tolowerRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">decimal_to_roman_numeral.cpp</a></li>
<li>toupperRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">decimal_to_roman_numeral.cpp</a></li>

1
namespacemembers_func.html
View File

@@ -172,6 +172,7 @@ $(function(){initNavTree('namespacemembers_func.html',''); initResizable(true);
<h3><a id="index_g" name="index_g"></a>- g -</h3><ul>
<li>gale_shapley()&#160;:&#160;<a class="el" href="dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching</a></li>
<li>get_intersection()&#160;:&#160;<a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e">operations_on_datastructures</a></li>
<li>get_shape()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning</a></li>
<li>get_union()&#160;:&#160;<a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">operations_on_datastructures</a></li>

1
namespacemembers_g.html
View File

@@ -107,6 +107,7 @@ $(function(){initNavTree('namespacemembers_g.html',''); initResizable(true); });
<div class="textblock">Here is a list of all documented namespace members with links to the namespaces they belong to:</div>
<h3><a id="index_g" name="index_g"></a>- g -</h3><ul>
<li>gale_shapley()&#160;:&#160;<a class="el" href="dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching</a></li>
<li>get_intersection()&#160;:&#160;<a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e">operations_on_datastructures</a></li>
<li>get_shape()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning</a></li>
<li>get_union()&#160;:&#160;<a class="el" href="da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">operations_on_datastructures</a></li>

1
namespaces.html
View File

@@ -153,6 +153,7 @@ $(function(){initNavTree('namespaces.html',''); initResizable(true); });
<tr id="row_37_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d9b/namespacegray__code.html" target="_self">gray_code</a></td><td class="desc">Generate n-bit Gray code </td></tr>
<tr id="row_38_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_38_" class="arrow" onclick="dynsection.toggleFolder('38_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/d90/namespacegreedy__algorithms.html" target="_self">greedy_algorithms</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
<tr id="row_38_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html" target="_self">dijkstra</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation </td></tr>
<tr id="row_38_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html" target="_self">stable_matching</a></td><td class="desc">Functions for the Gale-Shapley Algorithm </td></tr>
<tr id="row_39_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d20/namespaceground__to__ground__projectile__motion.html" target="_self">ground_to_ground_projectile_motion</a></td><td class="desc">Functions for the Ground to ground <a href="https://en.wikipedia.org/wiki/Projectile_motion" target="_blank">projectile motion</a> equation </td></tr>
<tr id="row_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d1c/namespacehamming__distance.html" target="_self">hamming_distance</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> implementation </td></tr>
<tr id="row_41_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d0c/namespacehashing.html" target="_self">hashing</a></td><td class="desc">Hashing algorithms </td></tr>

8
navtreedata.js
View File

@@ -147,10 +147,10 @@ var NAVTREEINDEX =
"d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3",
"d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8",
"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039",
"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a",
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a",
"dd/dba/namespacedivide__and__conquer.html",
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf"
"db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46",
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80",
"dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html",
"df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8"
];
var SYNCONMSG = 'click to disable panel synchronisation';

10
navtreeindex10.js
View File

@@ -230,6 +230,10 @@ var NAVTREEINDEX10 =
"db/d71/quadratic__probing__hash__table_8cpp.html#adccc63a7e57cc6dba75bd62f40feb88b":[11,0,12,4,7],
"db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,4,6],
"db/d71/quadratic__probing__hash__table_8cpp.html#aeb6bca8db4768226f8ea8291ea4f83f6":[11,0,12,4,12],
"db/d80/gale__shapley_8cpp.html":[11,0,11,2],
"db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,2,2],
"db/d80/gale__shapley_8cpp.html#a6d7e84df47dcf19e88f95f8f9040306c":[11,0,11,2,0],
"db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,2,1],
"db/d82/classlarge__number.html":[10,0,37],
"db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872":[10,0,37,2],
"db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337":[10,0,37,0],
@@ -245,9 +249,5 @@ var NAVTREEINDEX10 =
"db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687":[10,0,37,10],
"db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9":[10,0,37,14],
"db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf":[10,0,37,11],
"db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b":[10,0,37,12],
"db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46":[10,0,37,16],
"db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93":[10,0,37,7],
"db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac":[10,0,37,5],
"db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57":[10,0,37,19]
"db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b":[10,0,37,12]
};

10
navtreeindex11.js
View File

@@ -1,5 +1,9 @@
var NAVTREEINDEX11 =
{
"db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46":[10,0,37,16],
"db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93":[10,0,37,7],
"db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac":[10,0,37,5],
"db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57":[10,0,37,19],
"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a":[10,0,37,1],
"db/d8b/struct_node.html":[10,0,44],
"db/d93/check__prime_8cpp.html":[11,0,14,7],
@@ -245,9 +249,5 @@ var NAVTREEINDEX11 =
"dc/dd4/classdata__structures_1_1_bloom_filter.html":[10,0,2,9],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[9,0,20,2,2],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[10,0,2,9,2],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[9,0,20,2,3],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[10,0,2,9,3],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[9,0,20,2,1],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[10,0,2,9,1],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[9,0,20,2,0]
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[9,0,20,2,3]
};

14
navtreeindex12.js
View File

@@ -1,5 +1,9 @@
var NAVTREEINDEX12 =
{
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[10,0,2,9,3],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[9,0,20,2,1],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[10,0,2,9,1],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[9,0,20,2,0],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[10,0,2,9,0],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[9,0,20,2,4],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[10,0,2,9,4],
@@ -217,6 +221,8 @@ var NAVTREEINDEX12 =
"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[10,0,2,11,2],
"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[9,0,20,4,5],
"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[10,0,2,11,5],
"dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html":[9,0,38,1],
"dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c":[9,0,38,1,0],
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html":[10,0,10,0,1],
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101":[10,0,10,0,1,14],
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9":[10,0,10,0,1,4],
@@ -243,11 +249,5 @@ var NAVTREEINDEX12 =
"dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d":[11,0,22,14,3],
"dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,14,0],
"dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a":[11,0,22,14,4],
"dd/dae/namespacecount__of__set__bits.html":[9,0,15],
"dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html":[12,4],
"dd/db6/structbinary__search__tree_1_1bst__node.html":[10,0,21,0],
"dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df":[10,0,21,0,2],
"dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29":[10,0,21,0,3],
"dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778":[10,0,21,0,0],
"dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788":[10,0,21,0,1]
"dd/dae/namespacecount__of__set__bits.html":[9,0,15]
};

14
navtreeindex13.js
View File

@@ -1,5 +1,11 @@
var NAVTREEINDEX13 =
{
"dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html":[12,4],
"dd/db6/structbinary__search__tree_1_1bst__node.html":[10,0,21,0],
"dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df":[10,0,21,0,2],
"dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29":[10,0,21,0,3],
"dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778":[10,0,21,0,0],
"dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788":[10,0,21,0,1],
"dd/dba/namespacedivide__and__conquer.html":[9,0,23],
"dd/dca/class_f_c_f_s.html":[10,0,33],
"dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69":[10,0,33,0],
@@ -243,11 +249,5 @@ var NAVTREEINDEX13 =
"df/d47/stack_8hpp_source.html":[11,0,4,20],
"df/d4a/namespaceselection__sort__recursive.html":[9,0,102],
"df/d66/vector__cross__product_8cpp.html":[11,0,14,56],
"df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9":[11,0,14,56,0],
"df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8":[11,0,14,56,1],
"df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,56,3],
"df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,56,2],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html":[9,0,12,0],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2":[9,0,12,0,4],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0":[9,0,12,0,3]
"df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9":[11,0,14,56,0]
};

6
navtreeindex14.js
View File

@@ -1,5 +1,11 @@
var NAVTREEINDEX14 =
{
"df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8":[11,0,14,56,1],
"df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,56,3],
"df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,56,2],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html":[9,0,12,0],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2":[9,0,12,0,4],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0":[9,0,12,0,3],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf":[9,0,12,0,2],
"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830":[9,0,12,0,1],
"df/d72/modular__division_8cpp.html":[11,0,14,35],

4
navtreeindex3.js
View File

@@ -214,8 +214,8 @@ var NAVTREEINDEX3 =
"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828":[10,0,16,0,0,5],
"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8":[10,0,16,0,0,2],
"d2/d90/namespacegreedy__algorithms.html":[9,0,38],
"d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502":[9,0,38,1],
"d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098":[9,0,38,2],
"d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502":[9,0,38,2],
"d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098":[9,0,38,3],
"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html":[10,0,13,0,1],
"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e":[10,0,13,0,1,1],
"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f":[10,0,13,0,1,0],

8
navtreeindex7.js
View File

@@ -64,10 +64,10 @@ var NAVTREEINDEX7 =
"d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,26,3],
"d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52":[11,0,14,26,0],
"d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,26,1],
"d6/dba/jump__game_8cpp.html":[11,0,11,2],
"d6/dba/jump__game_8cpp.html#a33e3819aa9ffec0e380383c52603b502":[11,0,11,2,0],
"d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,11,2,2],
"d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,2,1],
"d6/dba/jump__game_8cpp.html":[11,0,11,3],
"d6/dba/jump__game_8cpp.html#a33e3819aa9ffec0e380383c52603b502":[11,0,11,3,0],
"d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,11,3,2],
"d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,3,1],
"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html":[10,0,11,0,0],
"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9":[10,0,11,0,0,2],
"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec":[10,0,11,0,0,3],

8
navtreeindex8.js
View File

@@ -121,10 +121,10 @@ var NAVTREEINDEX8 =
"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2":[10,0,12,0,0,2],
"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592":[10,0,12,0,0,10],
"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d":[10,0,12,0,0,5],
"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html":[11,0,11,3],
"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#a349e4ab9a97532c3931a2bd2a19c0098":[11,0,11,3,0],
"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,11,3,2],
"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,3,1],
"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html":[11,0,11,4],
"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#a349e4ab9a97532c3931a2bd2a19c0098":[11,0,11,4,0],
"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,11,4,2],
"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,4,1],
"d8/d88/namespaceset_kth_bit.html":[9,0,103],
"d8/d89/namespacelinear__probing.html":[8,0,1],
"d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908":[9,0,57,2],

2
search/all_12.js
View File

File diff suppressed because one or more lines are too long

2
search/all_19.js
View File

@@ -69,7 +69,7 @@ var searchData=
['testcase_5f2_66',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]],
['testcase_5f3_67',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]],
['testcases_68',['TestCases',['../d5/d58/class_test_cases.html',1,'']]],
['tests_69',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;dijkstra.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;linear_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;knuth_morris_pratt.cpp']]],
['tests_69',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;linear_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;knuth_morris_pratt.cpp']]],
['text_5fsearch_2ecpp_70',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]],
['tgamma_71',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]],
['th_72',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],

299
search/all_c.js
View File

@@ -1,152 +1,155 @@
var searchData=
[
['g_0',['g',['../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad',1,'numerical_methods::simpson_method::g()'],['../df/d11/midpoint__integral__method_8cpp.html#ae682ee71af44b1e9e884849cc6a6b040',1,'numerical_methods::midpoint_rule::g()']]],
['games_1',['Games',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52',1,'']]],
['games_2',['games',['../da/d9c/namespacegames.html',1,'']]],
['games_3a_3amemory_5fgame_3',['memory_game',['../d8/d41/namespacegames_1_1memory__game.html',1,'games']]],
['gamma_5fdistribution_4',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution.html',0,'std::gamma_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/gamma_distribution.html',0,'std::gamma_distribution::gamma_distribution()']]],
['gaussian_5felimination_2ecpp_5',['gaussian_elimination.cpp',['../d0/de2/gaussian__elimination_8cpp.html',1,'']]],
['gbump_6',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()']]],
['gcd_7',['gcd',['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a',1,'gcd(int *a, int n):&#160;gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y):&#160;least_common_multiple.cpp']]],
['gcd_5fiterative_5feuclidean_2ecpp_8',['gcd_iterative_euclidean.cpp',['../d4/da0/gcd__iterative__euclidean_8cpp.html',1,'']]],
['gcd_5fof_5fn_5fnumbers_2ecpp_9',['gcd_of_n_numbers.cpp',['../d1/d11/gcd__of__n__numbers_8cpp.html',1,'']]],
['gcd_5frecursive_5feuclidean_2ecpp_10',['gcd_recursive_euclidean.cpp',['../d4/d45/gcd__recursive__euclidean_8cpp.html',1,'']]],
['gcdextended_11',['gcdExtended',['../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86',1,'math::ncr_modulo_p::utils']]],
['gcount_12',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()']]],
['genarray_13',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]],
['generate_14',['generate',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate(T... args)']]],
['generate_5fcanonical_15',['generate_canonical',['http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html',0,'std']]],
['generate_5fdecryption_5fkey_16',['generate_decryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706',1,'ciphers::HillCipher']]],
['generate_5fencryption_5fkey_17',['generate_encryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e',1,'ciphers::HillCipher']]],
['generate_5fkeys_18',['generate_keys',['../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5',1,'ciphers::HillCipher']]],
['generate_5fn_19',['generate_n',['http://en.cppreference.com/w/cpp/algorithm/generate_n.html',0,'std']]],
['generate_5fparentheses_20',['generate_parentheses',['../df/de5/classbacktracking_1_1generate__parentheses.html',1,'backtracking']]],
['generate_5fparentheses_2ecpp_21',['generate_parentheses.cpp',['../dd/d1e/generate__parentheses_8cpp.html',1,'']]],
['generate_5fpossible_5fmoves_22',['generate_possible_moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658',1,'machine_learning::aystar_search::EightPuzzle']]],
['generate_5fsamples_23',['generate_samples',['../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf',1,'math::monte_carlo']]],
['generate_5funiform_24',['generate_uniform',['../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba',1,'probability::geometric_dist']]],
['generateunsortedarray_25',['generateUnsortedArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d',1,'sorting::random_pivot_quick_sort']]],
['generic_5fcategory_26',['generic_category',['http://en.cppreference.com/w/cpp/error/generic_category.html',0,'std']]],
['geometric_5fdist_27',['geometric_dist',['../dd/d8a/namespacegeometric__dist.html',1,'']]],
['geometric_5fdist_2ecpp_28',['geometric_dist.cpp',['../de/d72/geometric__dist_8cpp.html',1,'']]],
['geometric_5fdistribution_29',['geometric_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html',1,'probability::geometric_dist::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution.html',0,'std::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()']]],
['geometry_30',['Geometry',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53',1,'']]],
['geometry_31',['geometry',['../d5/d5f/namespacegeometry.html',1,'']]],
['get_32',['get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()'],['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8',1,'catalan_numbers::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()']]],
['get_5fall_5fwords_33',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]],
['get_5fallocator_34',['get_allocator',['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()']]],
['get_5fchar_35',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]],
['get_5fchar_5fidx_36',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]],
['get_5fclock_5fdiff_37',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.cpp']]],
['get_5fdate_38',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()']]],
['get_5fdeleter_39',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]],
['get_5felements_5finorder_40',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]],
['get_5felements_5fpostorder_41',['get_elements_postorder',['../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff',1,'binary_search_tree']]],
['get_5felements_5fpreorder_42',['get_elements_preorder',['../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13',1,'binary_search_tree']]],
['get_5ffinal_5fstatus_43',['get_final_status',['../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86',1,'fcfs_scheduling.cpp']]],
['get_5ffuture_44',['get_future',['http://en.cppreference.com/w/cpp/thread/promise/get_future.html',0,'std::promise::get_future()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/get_future.html',0,'std::packaged_task::get_future()']]],
['get_5fid_45',['get_id',['http://en.cppreference.com/w/cpp/thread/thread/get_id.html',0,'std::thread::get_id()'],['http://en.cppreference.com/w/cpp/thread/get_id.html',0,'std::this_thread::get_id()']]],
['get_5fidx_5fchar_46',['get_idx_char',['../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c',1,'ciphers::HillCipher']]],
['get_5finput_47',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]],
['get_5fintersection_48',['get_intersection',['../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e',1,'operations_on_datastructures']]],
['get_5finverse_49',['get_inverse',['../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7',1,'ciphers::HillCipher::get_inverse()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a',1,'get_inverse():&#160;ordinary_least_squares_regressor.cpp']]],
['get_5fk_5fth_50',['get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69',1,'data_structures::treap::Treap']]],
['get_5flevel_5forder_51',['get_level_order',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
['get_5fmax_52',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]],
['get_5fmin_53',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]],
['get_5fmin_5f2d_54',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]],
['get_5fminima_55',['get_minima',['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;golden_search_extrema.cpp']]],
['get_5fmoney_56',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]],
['get_5fmonthname_57',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]],
['get_5fnew_5fhandler_58',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]],
['get_5fnext_59',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]],
['get_5fpointer_5fsafety_60',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]],
['get_5fpredecessor_61',['get_predecessor',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126',1,'data_structures::treap::Treap']]],
['get_5frand_62',['get_rand',['../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0',1,'complex_numbers.cpp']]],
['get_5frank_63',['get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039',1,'data_structures::treap::Treap']]],
['get_5fshape_64',['get_shape',['../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078',1,'machine_learning']]],
['get_5fsize_65',['get_size',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f',1,'machine_learning::aystar_search::EightPuzzle']]],
['get_5fstate_66',['get_state',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99',1,'machine_learning::aystar_search::EightPuzzle']]],
['get_5ftemporary_5fbuffer_67',['get_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html',0,'std']]],
['get_5fterminate_68',['get_terminate',['http://en.cppreference.com/w/cpp/error/get_terminate.html',0,'std']]],
['get_5ftest_5fcases_69',['get_test_cases',['../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c',1,'longest_common_string.cpp']]],
['get_5ftime_70',['get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::get_time()'],['http://en.cppreference.com/w/cpp/io/manip/get_time.html',0,'std::get_time()']]],
['get_5ftranspose_71',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]],
['get_5funexpected_72',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]],
['get_5funion_73',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]],
['get_5fweekday_74',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]],
['get_5fxy_5ffrom_5fcsv_75',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]],
['get_5fyear_76',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]],
['getadjlist_77',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]],
['getbalance_78',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]],
['getc_79',['getc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]],
['getchar_80',['getchar',['http://en.cppreference.com/w/cpp/io/c/getchar.html',0,'std']]],
['getchild_81',['GetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4',1,'data_structures::tree_234::Node']]],
['getchildindex_82',['GetChildIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37',1,'data_structures::tree_234::Node']]],
['getconnectedcomponents_83',['getConnectedComponents',['../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b',1,'graph']]],
['getconvexhull_84',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]],
['getcount_85',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]],
['getenv_86',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]],
['getfailurearray_87',['getFailureArray',['../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9',1,'string_search']]],
['gethits_88',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]],
['getinordersuccessor_89',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['getitem_90',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]],
['getitemindex_91',['GetItemIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629',1,'data_structures::tree_234::Node']]],
['getitemleftchild_92',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]],
['getitemrightchild_93',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]],
['getleftmostchild_94',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]],
['getline_95',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]],
['getloc_96',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()']]],
['getmaxitem_97',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]],
['getmedian_98',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]],
['getmediannaive_99',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]],
['getmin_100',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]],
['getminimum_101',['getMinimum',['../d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f',1,'range_queries::sparse_table']]],
['getminitem_102',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]],
['getnextpossiblechild_103',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]],
['getnode_104',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['getnode_105',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]],
['getpagefault_106',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]],
['getparents_107',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]],
['getrandomindex_108',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]],
['getrightmostchild_109',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]],
['gets_110',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]],
['gettreemaxitem_111',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]],
['gettreeminitem_112',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]],
['getvertices_113',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]],
['getwchar_114',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]],
['giga_115',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
['github_20actions_116',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]],
['given_20node_20does_20not_20have_20a_20right_20node_20subtree_117',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
['given_20node_20has_20the_20right_20node_20subtree_118',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'']]],
['global_119',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]],
['gmtime_120',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]],
['gnome_5fsort_2ecpp_121',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]],
['gnomesort_122',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array&lt; T, size &gt; arr)']]],
['golden_5fsearch_5fextrema_2ecpp_123',['golden_search_extrema.cpp',['../d6/d7a/golden__search__extrema_8cpp.html',1,'']]],
['good_124',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]],
['good_5fsuffix_125',['good_suffix',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e',1,'strings::boyer_moore::pattern']]],
['gptr_126',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]],
['gram_5fschmidt_127',['gram_schmidt',['../d4/d0f/namespacegram__schmidt.html',1,'gram_schmidt'],['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt::gram_schmidt()']]],
['gram_5fschmidt_2ecpp_128',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]],
['graph_129',['Graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph&lt; T &gt;'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph'],['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &amp;&amp;adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector&lt; Edge &gt; const &amp;edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54',1,'Graph']]],
['graph_130',['graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md76',1,'Bipartite graph'],['../df/dce/namespacegraph.html',1,'graph']]],
['graph_5fcoloring_131',['graph_coloring',['../d7/d08/namespacegraph__coloring.html',1,'']]],
['graph_5fcoloring_2ecpp_132',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]],
['graphcoloring_133',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]],
['graphics_134',['Graphics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55',1,'']]],
['gray_5fcode_135',['gray_code',['../de/d9b/namespacegray__code.html',1,'']]],
['greater_136',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]],
['greater_5fequal_137',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]],
['greedy_20algorithms_138',['Greedy Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'']]],
['greedy_5falgorithms_139',['greedy_algorithms',['../d2/d90/namespacegreedy__algorithms.html',1,'']]],
['greedy_5falgorithms_3a_3adijkstra_140',['dijkstra',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html',1,'greedy_algorithms']]],
['grey_141',['GREY',['../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e',1,'depth_first_search_with_stack.cpp']]],
['ground_5fto_5fground_5fprojectile_5fmotion_142',['ground_to_ground_projectile_motion',['../d0/d20/namespaceground__to__ground__projectile__motion.html',1,'']]],
['ground_5fto_5fground_5fprojectile_5fmotion_2ecpp_143',['ground_to_ground_projectile_motion.cpp',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html',1,'']]],
['grouping_144',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]],
['guidelines_145',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]],
['guidelines_146',['Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'Commit Guidelines'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'Enforcement Guidelines']]],
['guidelines_147',['guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'Directory guidelines'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'File Name guidelines']]],
['guidelines_20for_20reviewers_20and_20maintainers_148',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]]
['gale_5fshapley_1',['gale_shapley',['../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c',1,'greedy_algorithms::stable_matching']]],
['gale_5fshapley_2ecpp_2',['gale_shapley.cpp',['../db/d80/gale__shapley_8cpp.html',1,'']]],
['games_3',['Games',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52',1,'']]],
['games_4',['games',['../da/d9c/namespacegames.html',1,'']]],
['games_3a_3amemory_5fgame_5',['memory_game',['../d8/d41/namespacegames_1_1memory__game.html',1,'games']]],
['gamma_5fdistribution_6',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution.html',0,'std::gamma_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/gamma_distribution.html',0,'std::gamma_distribution::gamma_distribution()']]],
['gaussian_5felimination_2ecpp_7',['gaussian_elimination.cpp',['../d0/de2/gaussian__elimination_8cpp.html',1,'']]],
['gbump_8',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()']]],
['gcd_9',['gcd',['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a',1,'gcd(int *a, int n):&#160;gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y):&#160;least_common_multiple.cpp']]],
['gcd_5fiterative_5feuclidean_2ecpp_10',['gcd_iterative_euclidean.cpp',['../d4/da0/gcd__iterative__euclidean_8cpp.html',1,'']]],
['gcd_5fof_5fn_5fnumbers_2ecpp_11',['gcd_of_n_numbers.cpp',['../d1/d11/gcd__of__n__numbers_8cpp.html',1,'']]],
['gcd_5frecursive_5feuclidean_2ecpp_12',['gcd_recursive_euclidean.cpp',['../d4/d45/gcd__recursive__euclidean_8cpp.html',1,'']]],
['gcdextended_13',['gcdExtended',['../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86',1,'math::ncr_modulo_p::utils']]],
['gcount_14',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()']]],
['genarray_15',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]],
['generate_16',['generate',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate(T... args)']]],
['generate_5fcanonical_17',['generate_canonical',['http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html',0,'std']]],
['generate_5fdecryption_5fkey_18',['generate_decryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706',1,'ciphers::HillCipher']]],
['generate_5fencryption_5fkey_19',['generate_encryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e',1,'ciphers::HillCipher']]],
['generate_5fkeys_20',['generate_keys',['../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5',1,'ciphers::HillCipher']]],
['generate_5fn_21',['generate_n',['http://en.cppreference.com/w/cpp/algorithm/generate_n.html',0,'std']]],
['generate_5fparentheses_22',['generate_parentheses',['../df/de5/classbacktracking_1_1generate__parentheses.html',1,'backtracking']]],
['generate_5fparentheses_2ecpp_23',['generate_parentheses.cpp',['../dd/d1e/generate__parentheses_8cpp.html',1,'']]],
['generate_5fpossible_5fmoves_24',['generate_possible_moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658',1,'machine_learning::aystar_search::EightPuzzle']]],
['generate_5fsamples_25',['generate_samples',['../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf',1,'math::monte_carlo']]],
['generate_5funiform_26',['generate_uniform',['../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba',1,'probability::geometric_dist']]],
['generateunsortedarray_27',['generateUnsortedArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d',1,'sorting::random_pivot_quick_sort']]],
['generic_5fcategory_28',['generic_category',['http://en.cppreference.com/w/cpp/error/generic_category.html',0,'std']]],
['geometric_5fdist_29',['geometric_dist',['../dd/d8a/namespacegeometric__dist.html',1,'']]],
['geometric_5fdist_2ecpp_30',['geometric_dist.cpp',['../de/d72/geometric__dist_8cpp.html',1,'']]],
['geometric_5fdistribution_31',['geometric_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html',1,'probability::geometric_dist::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution.html',0,'std::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()']]],
['geometry_32',['Geometry',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53',1,'']]],
['geometry_33',['geometry',['../d5/d5f/namespacegeometry.html',1,'']]],
['get_34',['get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()'],['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8',1,'catalan_numbers::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()']]],
['get_5fall_5fwords_35',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]],
['get_5fallocator_36',['get_allocator',['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()']]],
['get_5fchar_37',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]],
['get_5fchar_5fidx_38',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]],
['get_5fclock_5fdiff_39',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.cpp']]],
['get_5fdate_40',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()']]],
['get_5fdeleter_41',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]],
['get_5felements_5finorder_42',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]],
['get_5felements_5fpostorder_43',['get_elements_postorder',['../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff',1,'binary_search_tree']]],
['get_5felements_5fpreorder_44',['get_elements_preorder',['../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13',1,'binary_search_tree']]],
['get_5ffinal_5fstatus_45',['get_final_status',['../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86',1,'fcfs_scheduling.cpp']]],
['get_5ffuture_46',['get_future',['http://en.cppreference.com/w/cpp/thread/promise/get_future.html',0,'std::promise::get_future()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/get_future.html',0,'std::packaged_task::get_future()']]],
['get_5fid_47',['get_id',['http://en.cppreference.com/w/cpp/thread/thread/get_id.html',0,'std::thread::get_id()'],['http://en.cppreference.com/w/cpp/thread/get_id.html',0,'std::this_thread::get_id()']]],
['get_5fidx_5fchar_48',['get_idx_char',['../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c',1,'ciphers::HillCipher']]],
['get_5finput_49',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]],
['get_5fintersection_50',['get_intersection',['../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e',1,'operations_on_datastructures']]],
['get_5finverse_51',['get_inverse',['../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7',1,'ciphers::HillCipher::get_inverse()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a',1,'get_inverse():&#160;ordinary_least_squares_regressor.cpp']]],
['get_5fk_5fth_52',['get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69',1,'data_structures::treap::Treap']]],
['get_5flevel_5forder_53',['get_level_order',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
['get_5fmax_54',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]],
['get_5fmin_55',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]],
['get_5fmin_5f2d_56',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]],
['get_5fminima_57',['get_minima',['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;golden_search_extrema.cpp']]],
['get_5fmoney_58',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]],
['get_5fmonthname_59',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]],
['get_5fnew_5fhandler_60',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]],
['get_5fnext_61',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]],
['get_5fpointer_5fsafety_62',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]],
['get_5fpredecessor_63',['get_predecessor',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126',1,'data_structures::treap::Treap']]],
['get_5frand_64',['get_rand',['../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0',1,'complex_numbers.cpp']]],
['get_5frank_65',['get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039',1,'data_structures::treap::Treap']]],
['get_5fshape_66',['get_shape',['../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078',1,'machine_learning']]],
['get_5fsize_67',['get_size',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f',1,'machine_learning::aystar_search::EightPuzzle']]],
['get_5fstate_68',['get_state',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99',1,'machine_learning::aystar_search::EightPuzzle']]],
['get_5ftemporary_5fbuffer_69',['get_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html',0,'std']]],
['get_5fterminate_70',['get_terminate',['http://en.cppreference.com/w/cpp/error/get_terminate.html',0,'std']]],
['get_5ftest_5fcases_71',['get_test_cases',['../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c',1,'longest_common_string.cpp']]],
['get_5ftime_72',['get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::get_time()'],['http://en.cppreference.com/w/cpp/io/manip/get_time.html',0,'std::get_time()']]],
['get_5ftranspose_73',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]],
['get_5funexpected_74',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]],
['get_5funion_75',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]],
['get_5fweekday_76',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]],
['get_5fxy_5ffrom_5fcsv_77',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]],
['get_5fyear_78',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]],
['getadjlist_79',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]],
['getbalance_80',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]],
['getc_81',['getc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]],
['getchar_82',['getchar',['http://en.cppreference.com/w/cpp/io/c/getchar.html',0,'std']]],
['getchild_83',['GetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4',1,'data_structures::tree_234::Node']]],
['getchildindex_84',['GetChildIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37',1,'data_structures::tree_234::Node']]],
['getconnectedcomponents_85',['getConnectedComponents',['../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b',1,'graph']]],
['getconvexhull_86',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]],
['getcount_87',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]],
['getenv_88',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]],
['getfailurearray_89',['getFailureArray',['../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9',1,'string_search']]],
['gethits_90',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]],
['getinordersuccessor_91',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['getitem_92',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]],
['getitemindex_93',['GetItemIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629',1,'data_structures::tree_234::Node']]],
['getitemleftchild_94',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]],
['getitemrightchild_95',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]],
['getleftmostchild_96',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]],
['getline_97',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]],
['getloc_98',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()']]],
['getmaxitem_99',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]],
['getmedian_100',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]],
['getmediannaive_101',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]],
['getmin_102',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]],
['getminimum_103',['getMinimum',['../d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f',1,'range_queries::sparse_table']]],
['getminitem_104',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]],
['getnextpossiblechild_105',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]],
['getnode_106',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['getnode_107',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]],
['getpagefault_108',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]],
['getparents_109',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]],
['getrandomindex_110',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]],
['getrightmostchild_111',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]],
['gets_112',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]],
['gettreemaxitem_113',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]],
['gettreeminitem_114',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]],
['getvertices_115',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]],
['getwchar_116',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]],
['giga_117',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
['github_20actions_118',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]],
['given_20node_20does_20not_20have_20a_20right_20node_20subtree_119',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
['given_20node_20has_20the_20right_20node_20subtree_120',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md88',1,'']]],
['global_121',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]],
['gmtime_122',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]],
['gnome_5fsort_2ecpp_123',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]],
['gnomesort_124',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array&lt; T, size &gt; arr)']]],
['golden_5fsearch_5fextrema_2ecpp_125',['golden_search_extrema.cpp',['../d6/d7a/golden__search__extrema_8cpp.html',1,'']]],
['good_126',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]],
['good_5fsuffix_127',['good_suffix',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e',1,'strings::boyer_moore::pattern']]],
['gptr_128',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]],
['gram_5fschmidt_129',['gram_schmidt',['../d4/d0f/namespacegram__schmidt.html',1,'gram_schmidt'],['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt::gram_schmidt()']]],
['gram_5fschmidt_2ecpp_130',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]],
['graph_131',['Graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph&lt; T &gt;'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph'],['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &amp;&amp;adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector&lt; Edge &gt; const &amp;edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54',1,'Graph']]],
['graph_132',['graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md76',1,'Bipartite graph'],['../df/dce/namespacegraph.html',1,'graph']]],
['graph_5fcoloring_133',['graph_coloring',['../d7/d08/namespacegraph__coloring.html',1,'']]],
['graph_5fcoloring_2ecpp_134',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]],
['graphcoloring_135',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]],
['graphics_136',['Graphics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55',1,'']]],
['gray_5fcode_137',['gray_code',['../de/d9b/namespacegray__code.html',1,'']]],
['greater_138',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]],
['greater_5fequal_139',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]],
['greedy_20algorithms_140',['Greedy Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'']]],
['greedy_5falgorithms_141',['greedy_algorithms',['../d2/d90/namespacegreedy__algorithms.html',1,'']]],
['greedy_5falgorithms_3a_3adijkstra_142',['dijkstra',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html',1,'greedy_algorithms']]],
['greedy_5falgorithms_3a_3astable_5fmatching_143',['stable_matching',['../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html',1,'greedy_algorithms']]],
['grey_144',['GREY',['../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e',1,'depth_first_search_with_stack.cpp']]],
['ground_5fto_5fground_5fprojectile_5fmotion_145',['ground_to_ground_projectile_motion',['../d0/d20/namespaceground__to__ground__projectile__motion.html',1,'']]],
['ground_5fto_5fground_5fprojectile_5fmotion_2ecpp_146',['ground_to_ground_projectile_motion.cpp',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html',1,'']]],
['grouping_147',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]],
['guidelines_148',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]],
['guidelines_149',['Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'Commit Guidelines'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'Enforcement Guidelines']]],
['guidelines_150',['guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'Directory guidelines'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'File Name guidelines']]],
['guidelines_20for_20reviewers_20and_20maintainers_151',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]]
];

23
search/files_7.js
View File

@@ -1,14 +1,15 @@
var searchData=
[
['gaussian_5felimination_2ecpp_0',['gaussian_elimination.cpp',['../d0/de2/gaussian__elimination_8cpp.html',1,'']]],
['gcd_5fiterative_5feuclidean_2ecpp_1',['gcd_iterative_euclidean.cpp',['../d4/da0/gcd__iterative__euclidean_8cpp.html',1,'']]],
['gcd_5fof_5fn_5fnumbers_2ecpp_2',['gcd_of_n_numbers.cpp',['../d1/d11/gcd__of__n__numbers_8cpp.html',1,'']]],
['gcd_5frecursive_5feuclidean_2ecpp_3',['gcd_recursive_euclidean.cpp',['../d4/d45/gcd__recursive__euclidean_8cpp.html',1,'']]],
['generate_5fparentheses_2ecpp_4',['generate_parentheses.cpp',['../dd/d1e/generate__parentheses_8cpp.html',1,'']]],
['geometric_5fdist_2ecpp_5',['geometric_dist.cpp',['../de/d72/geometric__dist_8cpp.html',1,'']]],
['gnome_5fsort_2ecpp_6',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]],
['golden_5fsearch_5fextrema_2ecpp_7',['golden_search_extrema.cpp',['../d6/d7a/golden__search__extrema_8cpp.html',1,'']]],
['gram_5fschmidt_2ecpp_8',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]],
['graph_5fcoloring_2ecpp_9',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]],
['ground_5fto_5fground_5fprojectile_5fmotion_2ecpp_10',['ground_to_ground_projectile_motion.cpp',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html',1,'']]]
['gale_5fshapley_2ecpp_0',['gale_shapley.cpp',['../db/d80/gale__shapley_8cpp.html',1,'']]],
['gaussian_5felimination_2ecpp_1',['gaussian_elimination.cpp',['../d0/de2/gaussian__elimination_8cpp.html',1,'']]],
['gcd_5fiterative_5feuclidean_2ecpp_2',['gcd_iterative_euclidean.cpp',['../d4/da0/gcd__iterative__euclidean_8cpp.html',1,'']]],
['gcd_5fof_5fn_5fnumbers_2ecpp_3',['gcd_of_n_numbers.cpp',['../d1/d11/gcd__of__n__numbers_8cpp.html',1,'']]],
['gcd_5frecursive_5feuclidean_2ecpp_4',['gcd_recursive_euclidean.cpp',['../d4/d45/gcd__recursive__euclidean_8cpp.html',1,'']]],
['generate_5fparentheses_2ecpp_5',['generate_parentheses.cpp',['../dd/d1e/generate__parentheses_8cpp.html',1,'']]],
['geometric_5fdist_2ecpp_6',['geometric_dist.cpp',['../de/d72/geometric__dist_8cpp.html',1,'']]],
['gnome_5fsort_2ecpp_7',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]],
['golden_5fsearch_5fextrema_2ecpp_8',['golden_search_extrema.cpp',['../d6/d7a/golden__search__extrema_8cpp.html',1,'']]],
['gram_5fschmidt_2ecpp_9',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]],
['graph_5fcoloring_2ecpp_10',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]],
['ground_5fto_5fground_5fprojectile_5fmotion_2ecpp_11',['ground_to_ground_projectile_motion.cpp',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html',1,'']]]
];

2
search/functions_14.js
View File

@@ -52,7 +52,7 @@ var searchData=
['testcase_5f1_49',['testCase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]],
['testcase_5f2_50',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]],
['testcase_5f3_51',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]],
['tests_52',['tests',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;dijkstra.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;linear_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;knuth_morris_pratt.cpp']]],
['tests_52',['tests',['../d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;armstrong_number.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_common_string.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;depth_first_search_with_stack.cpp'],['../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;travelling_salesman_problem.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boruvkas_minimum_spanning_tree.cpp'],['../df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;dijkstra.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;kelvin_to_celsius.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;linear_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;knuth_morris_pratt.cpp']]],
['tgamma_53',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]],
['th_54',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],
['thousands_5fsep_55',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]],

221
search/functions_7.js
View File

@@ -1,114 +1,115 @@
var searchData=
[
['g_0',['g',['../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad',1,'numerical_methods::simpson_method::g()'],['../df/d11/midpoint__integral__method_8cpp.html#ae682ee71af44b1e9e884849cc6a6b040',1,'numerical_methods::midpoint_rule::g()']]],
['gamma_5fdistribution_1',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/gamma_distribution.html',0,'std::gamma_distribution']]],
['gbump_2',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()']]],
['gcd_3',['gcd',['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a',1,'gcd(int *a, int n):&#160;gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y):&#160;least_common_multiple.cpp']]],
['gcdextended_4',['gcdExtended',['../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86',1,'math::ncr_modulo_p::utils']]],
['gcount_5',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()']]],
['genarray_6',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]],
['generate_7',['generate',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate(T... args)']]],
['generate_5fcanonical_8',['generate_canonical',['http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html',0,'std']]],
['generate_5fdecryption_5fkey_9',['generate_decryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706',1,'ciphers::HillCipher']]],
['generate_5fencryption_5fkey_10',['generate_encryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e',1,'ciphers::HillCipher']]],
['generate_5fkeys_11',['generate_keys',['../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5',1,'ciphers::HillCipher']]],
['generate_5fn_12',['generate_n',['http://en.cppreference.com/w/cpp/algorithm/generate_n.html',0,'std']]],
['generate_5fpossible_5fmoves_13',['generate_possible_moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658',1,'machine_learning::aystar_search::EightPuzzle']]],
['generate_5fsamples_14',['generate_samples',['../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf',1,'math::monte_carlo']]],
['generate_5funiform_15',['generate_uniform',['../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba',1,'probability::geometric_dist']]],
['generateunsortedarray_16',['generateUnsortedArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d',1,'sorting::random_pivot_quick_sort']]],
['generic_5fcategory_17',['generic_category',['http://en.cppreference.com/w/cpp/error/generic_category.html',0,'std']]],
['geometric_5fdistribution_18',['geometric_distribution',['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()']]],
['get_19',['get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()'],['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8',1,'catalan_numbers::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()']]],
['get_5fall_5fwords_20',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]],
['get_5fallocator_21',['get_allocator',['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()']]],
['get_5fchar_22',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]],
['get_5fchar_5fidx_23',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]],
['get_5fclock_5fdiff_24',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.cpp']]],
['get_5fdate_25',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()']]],
['get_5fdeleter_26',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]],
['get_5felements_5finorder_27',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]],
['get_5felements_5fpostorder_28',['get_elements_postorder',['../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff',1,'binary_search_tree']]],
['get_5felements_5fpreorder_29',['get_elements_preorder',['../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13',1,'binary_search_tree']]],
['get_5ffinal_5fstatus_30',['get_final_status',['../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86',1,'fcfs_scheduling.cpp']]],
['get_5ffuture_31',['get_future',['http://en.cppreference.com/w/cpp/thread/promise/get_future.html',0,'std::promise::get_future()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/get_future.html',0,'std::packaged_task::get_future()']]],
['get_5fid_32',['get_id',['http://en.cppreference.com/w/cpp/thread/thread/get_id.html',0,'std::thread::get_id()'],['http://en.cppreference.com/w/cpp/thread/get_id.html',0,'std::this_thread::get_id()']]],
['get_5fidx_5fchar_33',['get_idx_char',['../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c',1,'ciphers::HillCipher']]],
['get_5finput_34',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]],
['get_5fintersection_35',['get_intersection',['../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e',1,'operations_on_datastructures']]],
['get_5finverse_36',['get_inverse',['../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7',1,'ciphers::HillCipher::get_inverse()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a',1,'get_inverse():&#160;ordinary_least_squares_regressor.cpp']]],
['get_5fk_5fth_37',['get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69',1,'data_structures::treap::Treap']]],
['get_5flevel_5forder_38',['get_level_order',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
['get_5fmax_39',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]],
['get_5fmin_40',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]],
['get_5fmin_5f2d_41',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]],
['get_5fminima_42',['get_minima',['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;golden_search_extrema.cpp']]],
['get_5fmoney_43',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]],
['get_5fmonthname_44',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]],
['get_5fnew_5fhandler_45',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]],
['get_5fnext_46',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]],
['get_5fpointer_5fsafety_47',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]],
['get_5fpredecessor_48',['get_predecessor',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126',1,'data_structures::treap::Treap']]],
['get_5frand_49',['get_rand',['../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0',1,'complex_numbers.cpp']]],
['get_5frank_50',['get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039',1,'data_structures::treap::Treap']]],
['get_5fshape_51',['get_shape',['../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078',1,'machine_learning']]],
['get_5fsize_52',['get_size',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f',1,'machine_learning::aystar_search::EightPuzzle']]],
['get_5fstate_53',['get_state',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99',1,'machine_learning::aystar_search::EightPuzzle']]],
['get_5ftemporary_5fbuffer_54',['get_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html',0,'std']]],
['get_5fterminate_55',['get_terminate',['http://en.cppreference.com/w/cpp/error/get_terminate.html',0,'std']]],
['get_5ftest_5fcases_56',['get_test_cases',['../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c',1,'longest_common_string.cpp']]],
['get_5ftime_57',['get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::get_time()'],['http://en.cppreference.com/w/cpp/io/manip/get_time.html',0,'std::get_time()']]],
['get_5ftranspose_58',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]],
['get_5funexpected_59',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]],
['get_5funion_60',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]],
['get_5fweekday_61',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]],
['get_5fxy_5ffrom_5fcsv_62',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]],
['get_5fyear_63',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]],
['getadjlist_64',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]],
['getbalance_65',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]],
['getc_66',['getc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]],
['getchar_67',['getchar',['http://en.cppreference.com/w/cpp/io/c/getchar.html',0,'std']]],
['getchild_68',['GetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4',1,'data_structures::tree_234::Node']]],
['getchildindex_69',['GetChildIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37',1,'data_structures::tree_234::Node']]],
['getconnectedcomponents_70',['getConnectedComponents',['../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b',1,'graph']]],
['getconvexhull_71',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]],
['getcount_72',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]],
['getenv_73',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]],
['getfailurearray_74',['getFailureArray',['../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9',1,'string_search']]],
['gethits_75',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]],
['getinordersuccessor_76',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['getitem_77',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]],
['getitemindex_78',['GetItemIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629',1,'data_structures::tree_234::Node']]],
['getitemleftchild_79',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]],
['getitemrightchild_80',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]],
['getleftmostchild_81',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]],
['getline_82',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]],
['getloc_83',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()']]],
['getmaxitem_84',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]],
['getmedian_85',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]],
['getmediannaive_86',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]],
['getmin_87',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]],
['getminimum_88',['getMinimum',['../d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f',1,'range_queries::sparse_table']]],
['getminitem_89',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]],
['getnextpossiblechild_90',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]],
['getnode_91',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['getnode_92',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]],
['getpagefault_93',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]],
['getparents_94',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]],
['getrandomindex_95',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]],
['getrightmostchild_96',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]],
['gets_97',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]],
['gettreemaxitem_98',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]],
['gettreeminitem_99',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]],
['getvertices_100',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]],
['getwchar_101',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]],
['global_102',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]],
['gmtime_103',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]],
['gnomesort_104',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array&lt; T, size &gt; arr)']]],
['good_105',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]],
['gptr_106',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]],
['gram_5fschmidt_107',['gram_schmidt',['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt']]],
['graph_108',['Graph',['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &amp;&amp;adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector&lt; Edge &gt; const &amp;edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()']]],
['graphcoloring_109',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]],
['grouping_110',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]]
['gale_5fshapley_1',['gale_shapley',['../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c',1,'greedy_algorithms::stable_matching']]],
['gamma_5fdistribution_2',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/gamma_distribution.html',0,'std::gamma_distribution']]],
['gbump_3',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()']]],
['gcd_4',['gcd',['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a',1,'gcd(int *a, int n):&#160;gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y):&#160;least_common_multiple.cpp']]],
['gcdextended_5',['gcdExtended',['../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86',1,'math::ncr_modulo_p::utils']]],
['gcount_6',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()']]],
['genarray_7',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]],
['generate_8',['generate',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate(T... args)']]],
['generate_5fcanonical_9',['generate_canonical',['http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html',0,'std']]],
['generate_5fdecryption_5fkey_10',['generate_decryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706',1,'ciphers::HillCipher']]],
['generate_5fencryption_5fkey_11',['generate_encryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e',1,'ciphers::HillCipher']]],
['generate_5fkeys_12',['generate_keys',['../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5',1,'ciphers::HillCipher']]],
['generate_5fn_13',['generate_n',['http://en.cppreference.com/w/cpp/algorithm/generate_n.html',0,'std']]],
['generate_5fpossible_5fmoves_14',['generate_possible_moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658',1,'machine_learning::aystar_search::EightPuzzle']]],
['generate_5fsamples_15',['generate_samples',['../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf',1,'math::monte_carlo']]],
['generate_5funiform_16',['generate_uniform',['../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba',1,'probability::geometric_dist']]],
['generateunsortedarray_17',['generateUnsortedArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d',1,'sorting::random_pivot_quick_sort']]],
['generic_5fcategory_18',['generic_category',['http://en.cppreference.com/w/cpp/error/generic_category.html',0,'std']]],
['geometric_5fdistribution_19',['geometric_distribution',['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()']]],
['get_20',['get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()'],['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8',1,'catalan_numbers::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()']]],
['get_5fall_5fwords_21',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]],
['get_5fallocator_22',['get_allocator',['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()']]],
['get_5fchar_23',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]],
['get_5fchar_5fidx_24',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]],
['get_5fclock_5fdiff_25',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.cpp']]],
['get_5fdate_26',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()']]],
['get_5fdeleter_27',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]],
['get_5felements_5finorder_28',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]],
['get_5felements_5fpostorder_29',['get_elements_postorder',['../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff',1,'binary_search_tree']]],
['get_5felements_5fpreorder_30',['get_elements_preorder',['../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13',1,'binary_search_tree']]],
['get_5ffinal_5fstatus_31',['get_final_status',['../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86',1,'fcfs_scheduling.cpp']]],
['get_5ffuture_32',['get_future',['http://en.cppreference.com/w/cpp/thread/promise/get_future.html',0,'std::promise::get_future()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/get_future.html',0,'std::packaged_task::get_future()']]],
['get_5fid_33',['get_id',['http://en.cppreference.com/w/cpp/thread/thread/get_id.html',0,'std::thread::get_id()'],['http://en.cppreference.com/w/cpp/thread/get_id.html',0,'std::this_thread::get_id()']]],
['get_5fidx_5fchar_34',['get_idx_char',['../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c',1,'ciphers::HillCipher']]],
['get_5finput_35',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]],
['get_5fintersection_36',['get_intersection',['../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e',1,'operations_on_datastructures']]],
['get_5finverse_37',['get_inverse',['../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7',1,'ciphers::HillCipher::get_inverse()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a',1,'get_inverse():&#160;ordinary_least_squares_regressor.cpp']]],
['get_5fk_5fth_38',['get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69',1,'data_structures::treap::Treap']]],
['get_5flevel_5forder_39',['get_level_order',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
['get_5fmax_40',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]],
['get_5fmin_41',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]],
['get_5fmin_5f2d_42',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]],
['get_5fminima_43',['get_minima',['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;golden_search_extrema.cpp']]],
['get_5fmoney_44',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]],
['get_5fmonthname_45',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]],
['get_5fnew_5fhandler_46',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]],
['get_5fnext_47',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]],
['get_5fpointer_5fsafety_48',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]],
['get_5fpredecessor_49',['get_predecessor',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126',1,'data_structures::treap::Treap']]],
['get_5frand_50',['get_rand',['../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0',1,'complex_numbers.cpp']]],
['get_5frank_51',['get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039',1,'data_structures::treap::Treap']]],
['get_5fshape_52',['get_shape',['../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078',1,'machine_learning']]],
['get_5fsize_53',['get_size',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f',1,'machine_learning::aystar_search::EightPuzzle']]],
['get_5fstate_54',['get_state',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99',1,'machine_learning::aystar_search::EightPuzzle']]],
['get_5ftemporary_5fbuffer_55',['get_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html',0,'std']]],
['get_5fterminate_56',['get_terminate',['http://en.cppreference.com/w/cpp/error/get_terminate.html',0,'std']]],
['get_5ftest_5fcases_57',['get_test_cases',['../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c',1,'longest_common_string.cpp']]],
['get_5ftime_58',['get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::get_time()'],['http://en.cppreference.com/w/cpp/io/manip/get_time.html',0,'std::get_time()']]],
['get_5ftranspose_59',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]],
['get_5funexpected_60',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]],
['get_5funion_61',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]],
['get_5fweekday_62',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]],
['get_5fxy_5ffrom_5fcsv_63',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]],
['get_5fyear_64',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]],
['getadjlist_65',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]],
['getbalance_66',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]],
['getc_67',['getc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]],
['getchar_68',['getchar',['http://en.cppreference.com/w/cpp/io/c/getchar.html',0,'std']]],
['getchild_69',['GetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4',1,'data_structures::tree_234::Node']]],
['getchildindex_70',['GetChildIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37',1,'data_structures::tree_234::Node']]],
['getconnectedcomponents_71',['getConnectedComponents',['../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b',1,'graph']]],
['getconvexhull_72',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]],
['getcount_73',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]],
['getenv_74',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]],
['getfailurearray_75',['getFailureArray',['../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9',1,'string_search']]],
['gethits_76',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]],
['getinordersuccessor_77',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['getitem_78',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]],
['getitemindex_79',['GetItemIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629',1,'data_structures::tree_234::Node']]],
['getitemleftchild_80',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]],
['getitemrightchild_81',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]],
['getleftmostchild_82',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]],
['getline_83',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]],
['getloc_84',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()']]],
['getmaxitem_85',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]],
['getmedian_86',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]],
['getmediannaive_87',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]],
['getmin_88',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]],
['getminimum_89',['getMinimum',['../d4/d96/range__queries_2sparse__table_8cpp.html#a932816c3de9e5ad122b180de60978e8f',1,'range_queries::sparse_table']]],
['getminitem_90',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]],
['getnextpossiblechild_91',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]],
['getnode_92',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
['getnode_93',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]],
['getpagefault_94',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]],
['getparents_95',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]],
['getrandomindex_96',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]],
['getrightmostchild_97',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]],
['gets_98',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]],
['gettreemaxitem_99',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]],
['gettreeminitem_100',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]],
['getvertices_101',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]],
['getwchar_102',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]],
['global_103',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]],
['gmtime_104',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]],
['gnomesort_105',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array&lt; T, size &gt; arr)']]],
['good_106',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]],
['gptr_107',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]],
['gram_5fschmidt_108',['gram_schmidt',['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt']]],
['graph_109',['Graph',['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &amp;&amp;adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector&lt; Edge &gt; const &amp;edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()']]],
['graphcoloring_110',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]],
['grouping_111',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]]
];

2
search/functions_d.js
View File

File diff suppressed because one or more lines are too long

3
search/namespaces_5.js
View File

@@ -10,5 +10,6 @@ var searchData=
['gray_5fcode_7',['gray_code',['../de/d9b/namespacegray__code.html',1,'']]],
['greedy_5falgorithms_8',['greedy_algorithms',['../d2/d90/namespacegreedy__algorithms.html',1,'']]],
['greedy_5falgorithms_3a_3adijkstra_9',['dijkstra',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html',1,'greedy_algorithms']]],
['ground_5fto_5fground_5fprojectile_5fmotion_10',['ground_to_ground_projectile_motion',['../d0/d20/namespaceground__to__ground__projectile__motion.html',1,'']]]
['greedy_5falgorithms_3a_3astable_5fmatching_10',['stable_matching',['../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html',1,'greedy_algorithms']]],
['ground_5fto_5fground_5fprojectile_5fmotion_11',['ground_to_ground_projectile_motion',['../d0/d20/namespaceground__to__ground__projectile__motion.html',1,'']]]
];