mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 12:23:13 +08:00
276 lines
17 KiB
HTML
276 lines
17 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
|
<!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.14.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>TheAlgorithms/C++: greedy_algorithms Namespace Reference</title>
|
|
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
|
<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="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
|
<script type="text/javascript">
|
|
DoxygenAwesomeDarkModeToggle.init()
|
|
</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="../../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/javascript">
|
|
window.MathJax = {
|
|
options: {
|
|
ignoreHtmlClass: 'tex2jax_ignore',
|
|
processHtmlClass: 'tex2jax_process'
|
|
},
|
|
loader: {
|
|
load: ['[tex]/ams']
|
|
},
|
|
tex: {
|
|
macros: {},
|
|
packages: ['base','configmacros','ams']
|
|
}
|
|
};
|
|
</script>
|
|
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
|
<td id="projectalign">
|
|
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">All the algorithms implemented in C++</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</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">
|
|
$(function(){initNavTree('d2/d90/namespacegreedy__algorithms.html','../../',''); });
|
|
</script>
|
|
<div id="container">
|
|
<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="headertitle"><div class="title">greedy_algorithms Namespace Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>for string class
|
|
<a href="#details">More...</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
|
|
Namespaces</h2></td></tr>
|
|
<tr class="memitem:dijkstra" id="r_dijkstra"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </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="memitem:stable_5Fmatching" id="r_stable_5Fmatching"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight">Functions for the Gale-Shapley Algorithm. <br /></td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-nested-classes" class="groupheader"><a id="nested-classes" name="nested-classes"></a>
|
|
Classes</h2></td></tr>
|
|
<tr class="memitem:BinaryAddition" id="r_BinaryAddition"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">BinaryAddition</a></td></tr>
|
|
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">A class to perform binary addition of two binary strings. <a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#details">More...</a><br /></td></tr>
|
|
<tr class="memitem:DigitSeparation" id="r_DigitSeparation"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">DigitSeparation</a></td></tr>
|
|
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">A class that provides methods to separate the digits of a large positive number. <a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#details">More...</a><br /></td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:a33e3819aa9ffec0e380383c52603b502" id="r_a33e3819aa9ffec0e380383c52603b502"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#a33e3819aa9ffec0e380383c52603b502">can_jump</a> (const std::vector< int > &nums)</td></tr>
|
|
<tr class="memdesc:a33e3819aa9ffec0e380383c52603b502"><td class="mdescLeft"> </td><td class="mdescRight">Checks whether the given element (default is <span class="tt">1</span>) can jump to the last index. <br /></td></tr>
|
|
<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098" id="r_a349e4ab9a97532c3931a2bd2a19c0098"><td class="memTemplParams" colspan="2">template<typename T, std::size_t N, std::size_t M> </td></tr>
|
|
<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098 template"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a349e4ab9a97532c3931a2bd2a19c0098">findMinimumEdge</a> (const T &infinity, const std::array< std::array< T, N >, M > &graph)</td></tr>
|
|
<tr class="memdesc:a349e4ab9a97532c3931a2bd2a19c0098"><td class="mdescLeft"> </td><td class="mdescRight">Finds the minimum edge of the given graph. <br /></td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p>for string class </p>
|
|
<p>for uint32_t</p>
|
|
<p>Greedy Algorithms.</p>
|
|
<p>For std::vector to store separated digits.</p>
|
|
<p>for std::vector</p>
|
|
<p>for reverse function for tests for input and outputs</p>
|
|
<p>Greedy Algorithms</p>
|
|
<p>for assert for INT_MAX for IO operations</p>
|
|
<p>Greedy Algorithms</p>
|
|
<p>For reveresing the vector For assert() function to check for errors For abs() function For int64_t data type to handle large numbers For input/output operations</p>
|
|
<p>Greedy Algorithms</p>
|
|
<p>for std::find for assert for std::uint32_t for std::vector</p>
|
|
<p>for assert for std::cout</p>
|
|
<p>Greedy Algorithms</p>
|
|
<p>for array for IO operations for numeric limits</p>
|
|
<p>Greedy Algorithms </p>
|
|
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
|
|
<a id="a33e3819aa9ffec0e380383c52603b502" name="a33e3819aa9ffec0e380383c52603b502"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a33e3819aa9ffec0e380383c52603b502">◆ </a></span>can_jump()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool greedy_algorithms::can_jump </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< int > &</td> <td class="paramname"><span class="paramname"><em>nums</em></span></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Checks whether the given element (default is <span class="tt">1</span>) can jump to the last index. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">nums</td><td>array of numbers containing the maximum jump (in steps) from that index </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>true if the index can be reached </dd>
|
|
<dd>
|
|
false if the index can NOT be reached </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d6/dba/jump__game_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d6/dba/jump__game_8cpp_source.html">jump_game.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 42</span> {</div>
|
|
<div class="line"><span class="lineno"> 43</span> <span class="keywordtype">size_t</span> lastPos = nums.size() - 1;</div>
|
|
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = lastPos; i != <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(-1); i--) {</div>
|
|
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">if</span> (i + nums[i] >= lastPos) {</div>
|
|
<div class="line"><span class="lineno"> 46</span> lastPos = i;</div>
|
|
<div class="line"><span class="lineno"> 47</span> }</div>
|
|
<div class="line"><span class="lineno"> 48</span> }</div>
|
|
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">return</span> lastPos == 0;</div>
|
|
<div class="line"><span class="lineno"> 50</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a349e4ab9a97532c3931a2bd2a19c0098" name="a349e4ab9a97532c3931a2bd2a19c0098"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a349e4ab9a97532c3931a2bd2a19c0098">◆ </a></span>findMinimumEdge()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T, std::size_t N, std::size_t M> </div>
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void greedy_algorithms::findMinimumEdge </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const T &</td> <td class="paramname"><span class="paramname"><em>infinity</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const std::array< std::array< T, N >, M > &</td> <td class="paramname"><span class="paramname"><em>graph</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Finds the minimum edge of the given graph. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">infinity</td><td>Defines the infinity of the graph </td></tr>
|
|
<tr><td class="paramname">graph</td><td>The graph that will be used to find the edge </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html">kruskals_minimum_spanning_tree.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 39</span> {</div>
|
|
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">if</span> (N != M) {</div>
|
|
<div class="line"><span class="lineno"> 41</span> std::cout << <span class="stringliteral">"\nWrong input passed. Provided array has dimensions "</span> << N</div>
|
|
<div class="line"><span class="lineno"> 42</span> << <span class="stringliteral">"x"</span> << M << <span class="stringliteral">". Please provide a square matrix.\n"</span>;</div>
|
|
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><span class="lineno"> 44</span> }</div>
|
|
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(); i++) {</div>
|
|
<div class="line"><span class="lineno"> 46</span> <span class="keywordtype">int</span> min = infinity;</div>
|
|
<div class="line"><span class="lineno"> 47</span> <span class="keywordtype">int</span> minIndex = 0;</div>
|
|
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(); j++) {</div>
|
|
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">if</span> (i != j && <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][j] != 0 && <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][j] < min) {</div>
|
|
<div class="line"><span class="lineno"> 50</span> min = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][j];</div>
|
|
<div class="line"><span class="lineno"> 51</span> minIndex = j;</div>
|
|
<div class="line"><span class="lineno"> 52</span> }</div>
|
|
<div class="line"><span class="lineno"> 53</span> }</div>
|
|
<div class="line"><span class="lineno"> 54</span> std::cout << i << <span class="stringliteral">" - "</span> << minIndex << <span class="stringliteral">"\t"</span> << graph[i][minIndex]</div>
|
|
<div class="line"><span class="lineno"> 55</span> << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><span class="lineno"> 56</span> }</div>
|
|
<div class="line"><span class="lineno"> 57</span>}</div>
|
|
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div id="page-nav" class="page-nav-panel">
|
|
<div id="page-nav-resize-handle"></div>
|
|
<div id="page-nav-tree">
|
|
<div id="page-nav-contents">
|
|
</div><!-- page-nav-contents -->
|
|
</div><!-- page-nav-tree -->
|
|
</div><!-- page-nav -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</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.14.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|