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

Documentation for c84c7da30f

Browse Source
This commit is contained in:
realstealthninja
2024-08-31 01:25:15 +00:00
parent 20cd9a9c6d
commit 50a7a35183
69 changed files with 885 additions and 943 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
d2/d90/namespacegreedy__algorithms.html
View File

@@ -122,6 +122,9 @@ Namespaces</h2></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:a33e3819aa9ffec0e380383c52603b502" id="r_a33e3819aa9ffec0e380383c52603b502"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a33e3819aa9ffec0e380383c52603b502">can_jump</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;nums)</td></tr>
<tr class="memdesc:a33e3819aa9ffec0e380383c52603b502"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks whether the given element (default is <code>1</code>) can jump to the last index. <br /></td></tr>
<tr class="separator:a33e3819aa9ffec0e380383c52603b502"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a127ce4403660032f53ae2e6467e5427d" id="r_a127ce4403660032f53ae2e6467e5427d"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a127ce4403660032f53ae2e6467e5427d"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a127ce4403660032f53ae2e6467e5427d">findMinimumEdge</a> (const int &amp;infinity, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, 6 &gt;, 6 &gt; &amp;graph)</td></tr>
<tr class="memdesc:a127ce4403660032f53ae2e6467e5427d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds the minimum edge of the given graph. <br /></td></tr>
@@ -132,9 +135,54 @@ Functions</h2></td></tr>
<p>for IO operations</p>
<p>for assert for INT_MAX for IO operations</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</p>
<p>Greedy Algorithms </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a33e3819aa9ffec0e380383c52603b502" name="a33e3819aa9ffec0e380383c52603b502"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a33e3819aa9ffec0e380383c52603b502">&#9670;&#160;</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 <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</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 <code>1</code>) 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>
<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.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 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&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(-1); i--) {</div>
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">if</span> (i + nums[i] &gt;= 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 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><!-- 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="../../d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.svg" width="310" height="52"><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="a127ce4403660032f53ae2e6467e5427d" name="a127ce4403660032f53ae2e6467e5427d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a127ce4403660032f53ae2e6467e5427d">&#9670;&#160;</a></span>findMinimumEdge()</h2>

1
d2/d90/namespacegreedy__algorithms.js
View File

@@ -1,5 +1,6 @@
var namespacegreedy__algorithms =
[
[ "dijkstra", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra" ],
[ "can_jump", "d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502", null ],
[ "findMinimumEdge", "d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d", null ]
];

5
d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="greedy_algorithms::can_jump" name="greedy_algorithms::can_jump">
<area shape="rect" id="Node000001" title="Checks whether the given element (default is 1) can jump to the last index." alt="" coords="5,5,141,46"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="189,13,304,38"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,23,173,23,173,28,141,28"/>
</map>

1
d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
c42fb8e2aa1ecbda76282b1d15466f0d

25
df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.svg → d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.svg
View File

@@ -3,9 +3,9 @@
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: canJump Pages: 1 -->
<svg width="186pt" height="27pt"
viewBox="0.00 0.00 186.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<!-- Title: greedy_algorithms::can_jump Pages: 1 -->
<svg width="232pt" height="39pt"
viewBox="0.00 0.00 232.00 38.50" 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">
@@ -17,14 +17,15 @@
]]></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 23.25)">
<title>canJump</title>
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>greedy_algorithms::can_jump</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="This function implements the above algorithm.">
<polygon fill="#999999" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">canJump</text>
<g id="a_Node000001"><a xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</text>
</a>
</g>
</g>
@@ -32,8 +33,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="178.25,-19.25 91.75,-19.25 91.75,0 178.25,0 178.25,-19.25"/>
<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
<polygon fill="white" stroke="#666666" points="224,-24.88 137.5,-24.88 137.5,-5.63 224,-5.63 224,-24.88"/>
<text text-anchor="middle" x="180.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
@@ -41,8 +42,8 @@
<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="M56.22,-9.62C63.5,-9.62 71.62,-9.62 79.8,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.79,-13.13 89.79,-9.63 79.79,-6.13 79.79,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M101.97,-15.25C109.78,-15.25 117.88,-15.25 125.77,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="125.61,-18.75 135.61,-15.25 125.61,-11.75 125.61,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.6 KiB

40
d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph_org.svg Normal file
View File

@@ -0,0 +1,40 @@
<?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.0 (20240811.2233)
-->
<!-- Title: greedy_algorithms::can_jump Pages: 1 -->
<svg width="232pt" height="39pt"
viewBox="0.00 0.00 232.00 38.50" 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 34.5)">
<title>greedy_algorithms::can_jump</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="224,-24.88 137.5,-24.88 137.5,-5.63 224,-5.63 224,-24.88"/>
<text text-anchor="middle" x="180.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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.97,-15.25C109.78,-15.25 117.88,-15.25 125.77,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="125.61,-18.75 135.61,-15.25 125.61,-11.75 125.61,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.9 KiB

9
d5/d79/jump__game_8cpp__incl.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="greedy_algorithms/jump_game.cpp" name="greedy_algorithms/jump_game.cpp">
<area shape="rect" id="Node000001" title="Jumping Game algorithm implementation" alt="" coords="50,5,209,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,70,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="108,48,65,86,61,82,105,44"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="94,94,165,120"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="132,46,132,78,127,78,127,46"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="189,94,246,120"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="153,44,194,81,191,85,149,48"/>
</map>

1
d5/d79/jump__game_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
becd4ae2f466d04a1ba167e3d07a4053

41
d8/df6/jumpgame_8cpp__incl.svg → d5/d79/jump__game_8cpp__incl.svg
View File

@@ -3,9 +3,9 @@
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: greedy_algorithms/jumpgame.cpp Pages: 1 -->
<svg width="189pt" height="83pt"
viewBox="0.00 0.00 188.62 82.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<!-- Title: greedy_algorithms/jump_game.cpp Pages: 1 -->
<svg width="189pt" height="94pt"
viewBox="0.00 0.00 188.62 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">
@@ -17,14 +17,15 @@
]]></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 78.5)">
<title>greedy_algorithms/jumpgame.cpp</title>
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.75)">
<title>greedy_algorithms/jump_game.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implementation of an algorithm to solve the jumping game problem.">
<polygon fill="#999999" stroke="#666666" points="168.62,-74.5 6.38,-74.5 6.38,-55.25 168.62,-55.25 168.62,-74.5"/>
<text text-anchor="middle" x="87.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/jumpgame.cpp</text>
<g id="a_Node000001"><a xlink:title="Jumping Game algorithm implementation">
<polygon fill="#999999" stroke="#666666" points="152.88,-85.75 33.38,-85.75 33.38,-55.25 152.88,-55.25 152.88,-85.75"/>
<text text-anchor="start" x="41.38" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/jump</text>
<text text-anchor="middle" x="93.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_game.cpp</text>
</a>
</g>
</g>
@@ -32,8 +33,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="43,-19.25 0,-19.25 0,0 43,0 43,-19.25"/>
<text text-anchor="middle" x="21.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
@@ -41,8 +42,8 @@
<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="M76.3,-54.84C66.76,-47.15 52.83,-35.9 41.39,-26.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="43.69,-24.03 33.71,-20.48 39.29,-29.48 43.69,-24.03"/>
<path fill="none" stroke="#63b8ff" d="M76.07,-54.95C66.17,-46.5 53.67,-35.83 43.41,-27.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="45.79,-24.51 35.91,-20.68 41.25,-29.84 45.79,-24.51"/>
</a>
</g>
</g>
@@ -50,8 +51,8 @@
<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 60.75,-19.25 60.75,0 114.25,0 114.25,-19.25"/>
<text text-anchor="middle" x="87.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 66.38,-19.25 66.38,0 119.88,0 119.88,-19.25"/>
<text text-anchor="middle" x="93.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
@@ -59,8 +60,8 @@
<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="M87.5,-55.08C87.5,-48.57 87.5,-39.42 87.5,-31.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="91,-31.12 87.5,-21.12 84,-31.12 91,-31.12"/>
<path fill="none" stroke="#63b8ff" d="M93.12,-54.95C93.12,-47.71 93.12,-38.84 93.12,-30.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.63,-31.21 93.13,-21.21 89.63,-31.21 96.63,-31.21"/>
</a>
</g>
</g>
@@ -68,8 +69,8 @@
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="180.62,-19.25 132.38,-19.25 132.38,0 180.62,0 180.62,-19.25"/>
<text text-anchor="middle" x="156.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
<polygon fill="#e0e0e0" stroke="#999999" points="180.62,-19.25 137.62,-19.25 137.62,0 180.62,0 180.62,-19.25"/>
<text text-anchor="middle" x="159.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
@@ -77,8 +78,8 @@
<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="M99.2,-54.84C109.28,-47.07 124.04,-35.67 136.06,-26.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="137.99,-29.33 143.77,-20.45 133.71,-23.79 137.99,-29.33"/>
<path fill="none" stroke="#63b8ff" d="M109.44,-54.95C118.81,-46.59 130.62,-36.05 140.38,-27.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="142.69,-29.98 147.82,-20.71 138.03,-24.75 142.69,-29.98"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 4.0 KiB

76
d5/d79/jump__game_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,76 @@
<?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.0 (20240811.2233)
-->
<!-- Title: greedy_algorithms/jump_game.cpp Pages: 1 -->
<svg width="189pt" height="94pt"
viewBox="0.00 0.00 188.62 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/jump_game.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Jumping Game algorithm implementation">
<polygon fill="#999999" stroke="#666666" points="152.88,-85.75 33.38,-85.75 33.38,-55.25 152.88,-55.25 152.88,-85.75"/>
<text text-anchor="start" x="41.38" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/jump</text>
<text text-anchor="middle" x="93.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_game.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="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</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="M76.07,-54.95C66.17,-46.5 53.67,-35.83 43.41,-27.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="45.79,-24.51 35.91,-20.68 41.25,-29.84 45.79,-24.51"/>
</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="119.88,-19.25 66.38,-19.25 66.38,0 119.88,0 119.88,-19.25"/>
<text text-anchor="middle" x="93.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</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="M93.12,-54.95C93.12,-47.71 93.12,-38.84 93.12,-30.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.63,-31.21 93.13,-21.21 89.63,-31.21 96.63,-31.21"/>
</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="180.62,-19.25 137.62,-19.25 137.62,0 180.62,0 180.62,-19.25"/>
<text text-anchor="middle" x="159.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</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="M109.44,-54.95C118.81,-46.59 130.62,-36.05 140.38,-27.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="142.69,-29.98 147.82,-20.71 138.03,-24.75 142.69,-29.98"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.2 KiB

235
d6/dba/jump__game_8cpp.html Normal file
View File

@@ -0,0 +1,235 @@
<!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/jump_game.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('d6/dba/jump__game_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">jump_game.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for jump_game.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d79/jump__game_8cpp__incl.svg" width="252" 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>
</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:a33e3819aa9ffec0e380383c52603b502" id="r_a33e3819aa9ffec0e380383c52603b502"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;nums)</td></tr>
<tr class="memdesc:a33e3819aa9ffec0e380383c52603b502"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks whether the given element (default is <code>1</code>) can jump to the last index. <br /></td></tr>
<tr class="separator:a33e3819aa9ffec0e380383c52603b502"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the above algorithm. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><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://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation </p>
<p>Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. This solution takes in input as a vector and output as a boolean to check if you can reach the last position. We name the indices good and bad based on whether we can reach the destination if we start at that position. We initialize the last index as lastPos. Here, we start from the end of the array and check if we can ever reach the first index. We check if the sum of the index and the maximum jump count given is greater than or equal to the lastPos. If yes, then that is the last position you can reach starting from the back. After the end of the loop, if we reach the lastPos as 0, then the destination can be reached from the start position.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/rakshaa2000" target="_blank">Rakshaa Viswanathan</a> </dd>
<dd>
<a href="https://github.com/Panquesito7" target="_blank">David Leal</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"> 71</span> {</div>
<div class="line"><span class="lineno"> 72</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 74</span>}</div>
<div class="ttc" id="ajump__game_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> jump_game.cpp:57</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="../../d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="499" height="52"><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="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </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>Function to test the above algorithm. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 57</span> {</div>
<div class="line"><span class="lineno"> 58</span> assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>({4, 3, 1, 0, 5})));</div>
<div class="line"><span class="lineno"> 59</span> assert(!<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>({3, 2, 1, 0, 4})));</div>
<div class="line"><span class="lineno"> 60</span> assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>({5, 9, 4, 7, 15, 3})));</div>
<div class="line"><span class="lineno"> 61</span> assert(!<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>({1, 0, 5, 8, 12})));</div>
<div class="line"><span class="lineno"> 62</span> assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>({2, 1, 4, 7})));</div>
<div class="line"><span class="lineno"> 63</span> </div>
<div class="line"><span class="lineno"> 64</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 65</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="anamespacegreedy__algorithms_html_a33e3819aa9ffec0e380383c52603b502"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a></div><div class="ttdeci">bool can_jump(const std::vector&lt; int &gt; &amp;nums)</div><div class="ttdoc">Checks whether the given element (default is 1) can jump to the last index.</div><div class="ttdef"><b>Definition</b> jump_game.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="../../d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="402" height="52"><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="../../d6/dba/jump__game_8cpp.html">jump_game.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
d6/dba/jump__game_8cpp.js Normal file
View File

@@ -0,0 +1,6 @@
var jump__game_8cpp =
[
[ "can_jump", "d6/dba/jump__game_8cpp.html#a33e3819aa9ffec0e380383c52603b502", null ],
[ "main", "d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test", "d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

7
d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="test" name="test">
<area shape="rect" id="Node000001" title="Function to test the above algorithm." alt="" coords="5,13,49,38"/>
<area shape="rect" id="Node000002" href="$d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" title="Checks whether the given element (default is 1) can jump to the last index." alt="" coords="97,5,232,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,23,81,23,81,28,49,28"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="280,13,395,38"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="233,23,264,23,264,28,233,28"/>
</map>

1
d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
70ce6bd1bf4944aea6051b9d04b969c5

84
d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg Normal file
View File

@@ -0,0 +1,84 @@
<?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.0 (20240811.2233)
-->
<!-- Title: test Pages: 1 -->
<svg width="301pt" height="39pt"
viewBox="0.00 0.00 300.50 38.50" 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 34.5)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to test the above algorithm.">
<polygon fill="#999999" stroke="#666666" points="32.5,-24.88 0,-24.88 0,-5.63 32.5,-5.63 32.5,-24.88"/>
<text text-anchor="middle" x="16.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" target="_top" xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
<polygon fill="white" stroke="#666666" points="170,-30.5 68.5,-30.5 68.5,0 170,0 170,-30.5"/>
<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</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="M32.59,-15.25C39.34,-15.25 47.76,-15.25 56.66,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.59,-18.75 66.59,-15.25 56.59,-11.75 56.59,-18.75"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="292.5,-24.88 206,-24.88 206,-5.63 292.5,-5.63 292.5,-24.88"/>
<text text-anchor="middle" x="249.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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="M170.47,-15.25C178.28,-15.25 186.38,-15.25 194.27,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="194.11,-18.75 204.11,-15.25 194.11,-11.75 194.11,-18.75"/>
</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.4 KiB

58
d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg Normal file
View File

@@ -0,0 +1,58 @@
<?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.0 (20240811.2233)
-->
<!-- Title: test Pages: 1 -->
<svg width="301pt" height="39pt"
viewBox="0.00 0.00 300.50 38.50" 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 34.5)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to test the above algorithm.">
<polygon fill="#999999" stroke="#666666" points="32.5,-24.88 0,-24.88 0,-5.63 32.5,-5.63 32.5,-24.88"/>
<text text-anchor="middle" x="16.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" target="_top" xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
<polygon fill="white" stroke="#666666" points="170,-30.5 68.5,-30.5 68.5,0 170,0 170,-30.5"/>
<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</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="M32.59,-15.25C39.34,-15.25 47.76,-15.25 56.66,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.59,-18.75 66.59,-15.25 56.59,-11.75 56.59,-18.75"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="292.5,-24.88 206,-24.88 206,-5.63 292.5,-5.63 292.5,-24.88"/>
<text text-anchor="middle" x="249.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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="M170.47,-15.25C178.28,-15.25 186.38,-15.25 194.27,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="194.11,-18.75 204.11,-15.25 194.11,-11.75 194.11,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.7 KiB

9
d6/dba/jump__game_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,13,55,38"/>
<area shape="rect" id="Node000002" href="$d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the above algorithm." alt="" coords="103,13,146,38"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,23,87,23,87,28,55,28"/>
<area shape="rect" id="Node000003" href="$d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" title="Checks whether the given element (default is 1) can jump to the last index." alt="" coords="194,5,329,46"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,23,178,23,178,28,146,28"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="377,13,493,38"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="330,23,362,23,362,28,330,28"/>
</map>

1
d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
d507de48ae0db31fa3506a26c91e1225

102
d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,102 @@
<?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.0 (20240811.2233)
-->
<!-- Title: main Pages: 1 -->
<svg width="374pt" height="39pt"
viewBox="0.00 0.00 373.50 38.50" 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 34.5)">
<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,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
<text text-anchor="middle" x="18.5" y="-11.38" 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="../../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the above algorithm.">
<polygon fill="white" stroke="#666666" points="105.5,-24.88 73,-24.88 73,-5.63 105.5,-5.63 105.5,-24.88"/>
<text text-anchor="middle" x="89.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</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.2,-15.25C44.58,-15.25 53.31,-15.25 61.45,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-18.75 71.2,-15.25 61.2,-11.75 61.2,-18.75"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" target="_top" xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
<polygon fill="white" stroke="#666666" points="243,-30.5 141.5,-30.5 141.5,0 243,0 243,-30.5"/>
<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="192.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</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="M105.59,-15.25C112.34,-15.25 120.76,-15.25 129.66,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.59,-18.75 139.59,-15.25 129.59,-11.75 129.59,-18.75"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="365.5,-24.88 279,-24.88 279,-5.63 365.5,-5.63 365.5,-24.88"/>
<text text-anchor="middle" x="322.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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="M243.47,-15.25C251.28,-15.25 259.38,-15.25 267.27,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.11,-18.75 277.11,-15.25 267.11,-11.75 267.11,-18.75"/>
</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.3 KiB

76
d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg Normal file
View File

@@ -0,0 +1,76 @@
<?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.0 (20240811.2233)
-->
<!-- Title: main Pages: 1 -->
<svg width="374pt" height="39pt"
viewBox="0.00 0.00 373.50 38.50" 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 34.5)">
<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,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
<text text-anchor="middle" x="18.5" y="-11.38" 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="../../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the above algorithm.">
<polygon fill="white" stroke="#666666" points="105.5,-24.88 73,-24.88 73,-5.63 105.5,-5.63 105.5,-24.88"/>
<text text-anchor="middle" x="89.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</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.2,-15.25C44.58,-15.25 53.31,-15.25 61.45,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-18.75 71.2,-15.25 61.2,-11.75 61.2,-18.75"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" target="_top" xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
<polygon fill="white" stroke="#666666" points="243,-30.5 141.5,-30.5 141.5,0 243,0 243,-30.5"/>
<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="192.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</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="M105.59,-15.25C112.34,-15.25 120.76,-15.25 129.66,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.59,-18.75 139.59,-15.25 129.59,-11.75 129.59,-18.75"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="365.5,-24.88 279,-24.88 279,-5.63 365.5,-5.63 365.5,-24.88"/>
<text text-anchor="middle" x="322.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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="M243.47,-15.25C251.28,-15.25 259.38,-15.25 267.27,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.11,-18.75 277.11,-15.25 267.11,-11.75 267.11,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.5 KiB

9
d8/df6/jumpgame_8cpp__incl.map
View File

@@ -1,9 +0,0 @@
<map id="greedy_algorithms/jumpgame.cpp" name="greedy_algorithms/jumpgame.cpp">
<area shape="rect" id="Node000001" title="Implementation of an algorithm to solve the jumping game problem." alt="" coords="14,5,230,31"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,79,63,105"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="109,34,62,71,59,67,105,29"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="86,79,158,105"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="125,31,125,63,119,63,119,31"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="182,79,246,105"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="139,29,188,67,185,72,136,34"/>
</map>

1
d8/df6/jumpgame_8cpp__incl.md5
View File

@@ -1 +0,0 @@
411bfa00b0abb9d5ae04cbfc3ffb5d69

75
d8/df6/jumpgame_8cpp__incl_org.svg
View File

@@ -1,75 +0,0 @@
<?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.0 (20240811.2233)
-->
<!-- Title: greedy_algorithms/jumpgame.cpp Pages: 1 -->
<svg width="189pt" height="83pt"
viewBox="0.00 0.00 188.62 82.50" 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 78.5)">
<title>greedy_algorithms/jumpgame.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implementation of an algorithm to solve the jumping game problem.">
<polygon fill="#999999" stroke="#666666" points="168.62,-74.5 6.38,-74.5 6.38,-55.25 168.62,-55.25 168.62,-74.5"/>
<text text-anchor="middle" x="87.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/jumpgame.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="43,-19.25 0,-19.25 0,0 43,0 43,-19.25"/>
<text text-anchor="middle" x="21.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</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="M76.3,-54.84C66.76,-47.15 52.83,-35.9 41.39,-26.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="43.69,-24.03 33.71,-20.48 39.29,-29.48 43.69,-24.03"/>
</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 60.75,-19.25 60.75,0 114.25,0 114.25,-19.25"/>
<text text-anchor="middle" x="87.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</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="M87.5,-55.08C87.5,-48.57 87.5,-39.42 87.5,-31.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="91,-31.12 87.5,-21.12 84,-31.12 91,-31.12"/>
</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="180.62,-19.25 132.38,-19.25 132.38,0 180.62,0 180.62,-19.25"/>
<text text-anchor="middle" x="156.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</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="M99.2,-54.84C109.28,-47.07 124.04,-35.67 136.06,-26.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="137.99,-29.33 143.77,-20.45 133.71,-23.79 137.99,-29.33"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 3.1 KiB

276
df/d64/jumpgame_8cpp.html
View File

@@ -1,276 +0,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.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: greedy_algorithms/jumpgame.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('df/d64/jumpgame_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="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">jumpgame.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Implementation of an algorithm to solve the <a href="../../(https://leetcode.com/problems/jump-game/)" target="_blank">jumping game</a> problem.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;vector&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for jumpgame.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/df6/jumpgame_8cpp__incl.svg" width="252" height="111"><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="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:af205390325e8c999bd68b93fa5252755" id="r_af205390325e8c999bd68b93fa5252755"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af205390325e8c999bd68b93fa5252755">canJump</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;nums)</td></tr>
<tr class="memdesc:af205390325e8c999bd68b93fa5252755"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function implements the above algorithm. <br /></td></tr>
<tr class="separator:af205390325e8c999bd68b93fa5252755"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test above algorithm. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><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>Implementation of an algorithm to solve the <a href="../../(https://leetcode.com/problems/jump-game/)" target="_blank">jumping game</a> problem. </p>
<p><b>Problem statement:</b> Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. This solution takes in input as a vector and output as a boolean to check if you can reach the last position. We name the indices good and bad based on whether we can reach the destination if we start at that position. We initialize the last index as lastPos. Here, we start from the end of the array and check if we can ever reach the first index. We check if the sum of the index and the maximum jump count given is greater than or equal to the lastPos. If yes, then that is the last position you can reach starting from the back. After the end of the loop, if we reach the lastPos as 0, then the destination can be reached from the start position. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/rakshaa2000" target="_blank">Rakshaa Viswanathan</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="af205390325e8c999bd68b93fa5252755" name="af205390325e8c999bd68b93fa5252755"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af205390325e8c999bd68b93fa5252755">&#9670;&#160;</a></span>canJump()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool canJump </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; int &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>nums</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>This function implements the above algorithm. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">array</td><td>of numbers containing the maximum jump (in steps) from that index </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>bool value whether final index can be reached or not </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 26</span> {</div>
<div class="line"><span class="lineno"> 27</span> <span class="keyword">auto</span> lastPos = nums.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1;</div>
<div class="line"><span class="lineno"> 28</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = nums.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1; i &gt;= 0; i--) {</div>
<div class="line"><span class="lineno"> 29</span> <span class="keywordflow">if</span> (i + nums[i] &gt;= lastPos) {</div>
<div class="line"><span class="lineno"> 30</span> lastPos = i;</div>
<div class="line"><span class="lineno"> 31</span> }</div>
<div class="line"><span class="lineno"> 32</span> }</div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordflow">return</span> lastPos == 0;</div>
<div class="line"><span class="lineno"> 34</span>}</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><!-- 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="../../df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.svg" width="248" height="36"><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="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"> 65</span> {</div>
<div class="line"><span class="lineno"> 66</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 68</span>}</div>
<div class="ttc" id="ajumpgame_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition</b> jumpgame.cpp:41</div></div>
</div><!-- 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="../../df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="438" height="86"><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="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </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>Function to test above algorithm. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 41</span> {</div>
<div class="line"><span class="lineno"> 42</span> <span class="comment">// Test 1</span></div>
<div class="line"><span class="lineno"> 43</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> num1={4,3,1,0,5};</div>
<div class="line"><span class="lineno"> 44</span> assert(<a class="code hl_function" href="#af205390325e8c999bd68b93fa5252755">canJump</a>(num1)==<span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 45</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Input: &quot;</span>;</div>
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">for</span>(<span class="keyword">auto</span> i: num1){</div>
<div class="line"><span class="lineno"> 47</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;i&lt;&lt;<span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 48</span> }</div>
<div class="line"><span class="lineno"> 49</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Output: true&quot;</span>&lt;&lt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 50</span> <span class="comment">// Test 2</span></div>
<div class="line"><span class="lineno"> 51</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> num2={3,2,1,0,4};</div>
<div class="line"><span class="lineno"> 52</span> assert(<a class="code hl_function" href="#af205390325e8c999bd68b93fa5252755">canJump</a>(num2)==<span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 53</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Input: &quot;</span>;</div>
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">for</span>(<span class="keyword">auto</span> i: num2){</div>
<div class="line"><span class="lineno"> 55</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;i&lt;&lt;<span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 56</span> }</div>
<div class="line"><span class="lineno"> 57</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Output: false&quot;</span>&lt;&lt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 58</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="ajumpgame_8cpp_html_af205390325e8c999bd68b93fa5252755"><div class="ttname"><a href="#af205390325e8c999bd68b93fa5252755">canJump</a></div><div class="ttdeci">bool canJump(const std::vector&lt; int &gt; &amp;nums)</div><div class="ttdoc">This function implements the above algorithm.</div><div class="ttdef"><b>Definition</b> jumpgame.cpp:26</div></div>
<div class="ttc" id="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="../../df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="340" height="86"><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="../../df/d64/jumpgame_8cpp.html">jumpgame.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
df/d64/jumpgame_8cpp.js
View File

@@ -1,6 +0,0 @@
var jumpgame_8cpp =
[
[ "canJump", "df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755", null ],
[ "main", "df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test", "df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

9
df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,9 +0,0 @@
<map id="test" name="test">
<area shape="rect" id="Node000001" title="Function to test above algorithm." alt="" coords="5,31,49,56"/>
<area shape="rect" id="Node000002" href="$df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755" title="This function implements the above algorithm." alt="" coords="97,5,171,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,36,81,28,82,33,50,41"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="98,55,170,80"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,46,83,53,82,59,48,51"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="219,5,334,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="172,16,203,16,203,21,172,21"/>
</map>

1
df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +0,0 @@
2bb1bce3655c3ec40a1df7d0baae19e4

101
df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -1,101 +0,0 @@
<?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.0 (20240811.2233)
-->
<!-- Title: test Pages: 1 -->
<svg width="255pt" height="64pt"
viewBox="0.00 0.00 254.75 64.25" 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 60.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to test above algorithm.">
<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755" target="_top" xlink:title="This function implements the above algorithm.">
<polygon fill="white" stroke="#666666" points="124.25,-56.25 68.5,-56.25 68.5,-37 124.25,-37 124.25,-56.25"/>
<text text-anchor="middle" x="96.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">canJump</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="M32.68,-31.38C39.81,-33.11 48.62,-35.26 57.36,-37.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.25,-40.71 66.8,-39.67 57.91,-33.91 56.25,-40.71"/>
</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/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="123.12,-19.25 69.62,-19.25 69.62,0 123.12,0 123.12,-19.25"/>
<text text-anchor="middle" x="96.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</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="M32.68,-24.07C40,-22.38 49.09,-20.29 58.05,-18.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="58.77,-21.65 67.73,-15.99 57.2,-14.83 58.77,-21.65"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="246.75,-56.25 160.25,-56.25 160.25,-37 246.75,-37 246.75,-56.25"/>
<text text-anchor="middle" x="203.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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="M124.72,-46.62C132,-46.62 140.12,-46.62 148.3,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.29,-50.13 158.29,-46.63 148.29,-43.13 148.29,-50.13"/>
</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

Before

Width:  |  Height:  |  Size: 4.1 KiB

75
df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
View File

@@ -1,75 +0,0 @@
<?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.0 (20240811.2233)
-->
<!-- Title: test Pages: 1 -->
<svg width="255pt" height="64pt"
viewBox="0.00 0.00 254.75 64.25" 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 60.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to test above algorithm.">
<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755" target="_top" xlink:title="This function implements the above algorithm.">
<polygon fill="white" stroke="#666666" points="124.25,-56.25 68.5,-56.25 68.5,-37 124.25,-37 124.25,-56.25"/>
<text text-anchor="middle" x="96.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">canJump</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="M32.68,-31.38C39.81,-33.11 48.62,-35.26 57.36,-37.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.25,-40.71 66.8,-39.67 57.91,-33.91 56.25,-40.71"/>
</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/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="123.12,-19.25 69.62,-19.25 69.62,0 123.12,0 123.12,-19.25"/>
<text text-anchor="middle" x="96.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</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="M32.68,-24.07C40,-22.38 49.09,-20.29 58.05,-18.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="58.77,-21.65 67.73,-15.99 57.2,-14.83 58.77,-21.65"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="246.75,-56.25 160.25,-56.25 160.25,-37 246.75,-37 246.75,-56.25"/>
<text text-anchor="middle" x="203.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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="M124.72,-46.62C132,-46.62 140.12,-46.62 148.3,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.29,-50.13 158.29,-46.63 148.29,-43.13 148.29,-50.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 3.3 KiB

11
df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,11 +0,0 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
<area shape="rect" id="Node000002" href="$df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test above algorithm." alt="" coords="103,31,146,56"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
<area shape="rect" id="Node000003" href="$df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755" title="This function implements the above algorithm." alt="" coords="194,5,268,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,36,179,28,180,33,147,41"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="196,55,267,80"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,46,181,53,179,59,146,51"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="316,5,432,31"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="269,16,300,16,300,21,269,21"/>
</map>

1
df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +0,0 @@
d8703c08ff92e9d5bfe70af68d7daa05

119
df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,119 +0,0 @@
<?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.0 (20240811.2233)
-->
<!-- Title: main Pages: 1 -->
<svg width="328pt" height="64pt"
viewBox="0.00 0.00 327.75 64.25" 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 60.25)">
<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,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
<text text-anchor="middle" x="18.5" y="-23.75" 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="../../df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test above algorithm.">
<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</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.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755" target="_top" xlink:title="This function implements the above algorithm.">
<polygon fill="white" stroke="#666666" points="197.25,-56.25 141.5,-56.25 141.5,-37 197.25,-37 197.25,-56.25"/>
<text text-anchor="middle" x="169.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">canJump</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="M105.68,-31.38C112.81,-33.11 121.62,-35.26 130.36,-37.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.25,-40.71 139.8,-39.67 130.91,-33.91 129.25,-40.71"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="196.12,-19.25 142.62,-19.25 142.62,0 196.12,0 196.12,-19.25"/>
<text text-anchor="middle" x="169.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.68,-24.07C113,-22.38 122.09,-20.29 131.05,-18.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="131.77,-21.65 140.73,-15.99 130.2,-14.83 131.77,-21.65"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="319.75,-56.25 233.25,-56.25 233.25,-37 319.75,-37 319.75,-56.25"/>
<text text-anchor="middle" x="276.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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="M197.72,-46.62C205,-46.62 213.12,-46.62 221.3,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="221.29,-50.13 231.29,-46.63 221.29,-43.13 221.29,-50.13"/>
</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

Before

Width:  |  Height:  |  Size: 4.9 KiB

93
df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -1,93 +0,0 @@
<?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.0 (20240811.2233)
-->
<!-- Title: main Pages: 1 -->
<svg width="328pt" height="64pt"
viewBox="0.00 0.00 327.75 64.25" 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 60.25)">
<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,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
<text text-anchor="middle" x="18.5" y="-23.75" 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="../../df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test above algorithm.">
<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</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.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755" target="_top" xlink:title="This function implements the above algorithm.">
<polygon fill="white" stroke="#666666" points="197.25,-56.25 141.5,-56.25 141.5,-37 197.25,-37 197.25,-56.25"/>
<text text-anchor="middle" x="169.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">canJump</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="M105.68,-31.38C112.81,-33.11 121.62,-35.26 130.36,-37.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.25,-40.71 139.8,-39.67 130.91,-33.91 129.25,-40.71"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="196.12,-19.25 142.62,-19.25 142.62,0 196.12,0 196.12,-19.25"/>
<text text-anchor="middle" x="169.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.68,-24.07C113,-22.38 122.09,-20.29 131.05,-18.22"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="131.77,-21.65 140.73,-15.99 130.2,-14.83 131.77,-21.65"/>
</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="319.75,-56.25 233.25,-56.25 233.25,-37 319.75,-37 319.75,-56.25"/>
<text text-anchor="middle" x="276.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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="M197.72,-46.62C205,-46.62 213.12,-46.62 221.3,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="221.29,-50.13 231.29,-46.63 221.29,-43.13 221.29,-50.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 4.1 KiB

5
df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.map
View File

@@ -1,5 +0,0 @@
<map id="canJump" name="canJump">
<area shape="rect" id="Node000001" title="This function implements the above algorithm." alt="" coords="5,5,80,31"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="128,5,243,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="80,16,112,16,112,21,80,21"/>
</map>

1
df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.md5
View File

@@ -1 +0,0 @@
28a0d779acac6220e74738b766d12c04

39
df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph_org.svg
View File

@@ -1,39 +0,0 @@
<?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.0 (20240811.2233)
-->
<!-- Title: canJump Pages: 1 -->
<svg width="186pt" height="27pt"
viewBox="0.00 0.00 186.25 27.25" 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 23.25)">
<title>canJump</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="This function implements the above algorithm.">
<polygon fill="#999999" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">canJump</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/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="178.25,-19.25 91.75,-19.25 91.75,0 178.25,0 178.25,-19.25"/>
<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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="M56.22,-9.62C63.5,-9.62 71.62,-9.62 79.8,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.79,-13.13 89.79,-9.63 79.79,-6.13 79.79,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 1.7 KiB

4
dir_0eaa691bd54ab0922ca7f50599de6d22.html
View File

@@ -116,8 +116,8 @@ 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="df/d64/jumpgame_8cpp.html">jumpgame.cpp</a></td></tr>
<tr class="memdesc:df/d64/jumpgame_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of an algorithm to solve the <a href="(https://leetcode.com/problems/jump-game/)" target="_blank">jumping game</a> problem. <br /></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>
<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="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html">kruskals_minimum_spanning_tree.cpp</a></td></tr>
<tr class="memdesc:d8/d7d/kruskals__minimum__spanning__tree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation <br /></td></tr>

2
dir_0eaa691bd54ab0922ca7f50599de6d22.js
View File

@@ -2,6 +2,6 @@ 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" ],
[ "jumpgame.cpp", "df/d64/jumpgame_8cpp.html", "df/d64/jumpgame_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" ]
];

11
doxygen_crawl.html
View File

@@ -116,7 +116,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="df/d64/jumpgame_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"/>
<a href="d6/d80/double__hash__hash__table_8cpp.html"/>
@@ -1355,6 +1355,7 @@
<a href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8"/>
<a href="d2/d90/namespacegreedy__algorithms.html"/>
<a href="d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d"/>
<a href="d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502"/>
<a href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html"/>
<a href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e"/>
<a href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f"/>
@@ -2163,6 +2164,10 @@
<a href="d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
<a href="d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52"/>
<a href="d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="d6/dba/jump__game_8cpp.html"/>
<a href="d6/dba/jump__game_8cpp.html#a33e3819aa9ffec0e380383c52603b502"/>
<a href="d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
<a href="d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html"/>
<a href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9"/>
<a href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec"/>
@@ -3829,10 +3834,6 @@
<a href="df/d4a/namespaceselection__sort__recursive.html"/>
<a href="df/d4e/namespacesorting_1_1strand.html#a2bea2fe5dd38ed63610fdeaddf5785cd"/>
<a href="df/d5a/namespacesorting_1_1cycle__sort.html#ae79a9d247691fce0d655fce75f1c04fa"/>
<a href="df/d64/jumpgame_8cpp.html"/>
<a href="df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
<a href="df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755"/>
<a href="df/d66/vector__cross__product_8cpp.html"/>
<a href="df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9"/>
<a href="df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8"/>

2
files.html
View File

@@ -217,7 +217,7 @@ 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="df/d64/jumpgame_8cpp.html" target="_self">jumpgame.cpp</a></td><td class="desc">Implementation of an algorithm to solve the <a href="(https://leetcode.com/problems/jump-game/)" target="_blank">jumping game</a> problem </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_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>

1
globals_c.html
View File

@@ -107,7 +107,6 @@ $(function(){initNavTree('globals_c.html',''); initResizable(true); });
<div class="textblock">Here is a list of all documented file members with links to the documentation:</div>
<h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
<li>canJump()&#160;:&#160;<a class="el" href="df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755">jumpgame.cpp</a></li>
<li>change()&#160;:&#160;<a class="el" href="d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">rungekutta.cpp</a></li>
<li>check_termination()&#160;:&#160;<a class="el" href="da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377">durand_kerner_roots.cpp</a></li>
<li>CIPHERS_UINT128_T_HPP_&#160;:&#160;<a class="el" href="da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57">uint128_t.hpp</a></li>

1
globals_func_c.html
View File

@@ -107,7 +107,6 @@ $(function(){initNavTree('globals_func_c.html',''); initResizable(true); });
<div class="textblock">Here is a list of all documented functions with links to the documentation:</div>
<h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
<li>canJump()&#160;:&#160;<a class="el" href="df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755">jumpgame.cpp</a></li>
<li>change()&#160;:&#160;<a class="el" href="d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">rungekutta.cpp</a></li>
<li>check_termination()&#160;:&#160;<a class="el" href="da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377">durand_kerner_roots.cpp</a></li>
<li>circle()&#160;:&#160;<a class="el" href="d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">smallest_circle.cpp</a></li>

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

File diff suppressed because one or more lines are too long

2
globals_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_t.html
View File

File diff suppressed because one or more lines are too long

1
namespacemembers_c.html
View File

@@ -107,6 +107,7 @@ $(function(){initNavTree('namespacemembers_c.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_c" name="index_c"></a>- c -</h3><ul>
<li>can_jump()&#160;:&#160;<a class="el" href="d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms</a></li>
<li>check_if_equal()&#160;:&#160;<a class="el" href="d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">string_search</a></li>
<li>checkBipartite()&#160;:&#160;<a class="el" href="df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7">graph</a></li>
<li>circle_area()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75">math</a></li>

1
namespacemembers_func.html
View File

@@ -131,6 +131,7 @@ $(function(){initNavTree('namespacemembers_func.html',''); initResizable(true);
<h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
<li>can_jump()&#160;:&#160;<a class="el" href="d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms</a></li>
<li>check_if_equal()&#160;:&#160;<a class="el" href="d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">string_search</a></li>
<li>checkBipartite()&#160;:&#160;<a class="el" href="df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7">graph</a></li>
<li>circle_area()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75">math</a></li>

22
navtreedata.js
View File

@@ -140,17 +140,17 @@ var NAVTREEINDEX =
"cpp/iterator/distance.html",
"cpp/thread/lock.html",
"d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1",
"d3/d09/node_8hpp_source.html",
"d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c",
"d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd",
"d6/d84/namespaceutils.html",
"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f",
"d9/d14/array__left__rotation_8cpp.html#aa515639572647508b94986489aab6d76",
"da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867",
"db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee",
"dd/d1b/structquery.html",
"de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
"df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84"
"d3/d09/node_8hpp.html",
"d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6",
"d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331",
"d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08",
"d8/d69/classgraph_1_1_h_k_graph.html",
"d9/d13/namespaceinversion.html",
"da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d",
"db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d",
"dd/d12/vigenere__cipher_8cpp.html",
"de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6",
"df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08"
];
var SYNCONMSG = 'click to disable panel synchronisation';

12
navtreeindex10.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX10 =
{
"da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,11,3],
"da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2":[11,0,6,11,0],
"da/d5a/class_complex.html":[10,0,26],
"da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6":[10,0,26,11],
"da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da":[10,0,26,7],
"da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867":[10,0,26,0],
"da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323":[10,0,26,1],
"da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac":[10,0,26,9],
@@ -244,10 +249,5 @@ var NAVTREEINDEX10 =
"db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860":[10,0,58,28],
"db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67":[10,0,58,68],
"db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c":[10,0,58,52],
"db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30":[10,0,58,27],
"db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d":[10,0,58,31],
"db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004":[10,0,58,35],
"db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc":[10,0,58,48],
"db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953":[10,0,58,78],
"db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b":[10,0,58,3]
"db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30":[10,0,58,27]
};

12
navtreeindex11.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX11 =
{
"db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d":[10,0,58,31],
"db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004":[10,0,58,35],
"db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc":[10,0,58,48],
"db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953":[10,0,58,78],
"db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b":[10,0,58,3],
"db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee":[10,0,58,72],
"db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec":[10,0,58,38],
"db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e":[10,0,58,11],
@@ -244,10 +249,5 @@ var NAVTREEINDEX11 =
"dd/d0d/insertion__sort_8cpp.html#a78cb2f3b97b6db2c062b2a1df05c9ea9":[11,0,22,9,2],
"dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,22,9,4],
"dd/d0d/insertion__sort_8cpp.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f":[11,0,22,9,1],
"dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,9,3],
"dd/d12/vigenere__cipher_8cpp.html":[11,0,2,8],
"dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e":[11,0,2,8,0],
"dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257":[11,0,2,8,1],
"dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,2,8,3],
"dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,8,2]
"dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,9,3]
};

12
navtreeindex12.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX12 =
{
"dd/d12/vigenere__cipher_8cpp.html":[11,0,2,8],
"dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e":[11,0,2,8,0],
"dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257":[11,0,2,8,1],
"dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,2,8,3],
"dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,8,2],
"dd/d1b/structquery.html":[10,0,46],
"dd/d1c/classhash__chain.html":[10,0,34],
"dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a":[10,0,34,4],
@@ -244,10 +249,5 @@ var NAVTREEINDEX12 =
"de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c":[10,0,16,1,1],
"de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6":[9,0,95,0,6],
"de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6":[10,0,16,1,6],
"de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6":[9,0,95,0,7],
"de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6":[10,0,16,1,7],
"de/d0d/fibonacci__search_8cpp.html":[11,0,21,1],
"de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61":[11,0,21,1,0],
"de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f":[11,0,21,1,3],
"de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d":[11,0,21,1,2]
"de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6":[9,0,95,0,7]
};

12
navtreeindex13.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX13 =
{
"de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6":[10,0,16,1,7],
"de/d0d/fibonacci__search_8cpp.html":[11,0,21,1],
"de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61":[11,0,21,1,0],
"de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f":[11,0,21,1,3],
"de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d":[11,0,21,1,2],
"de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,1,1],
"de/d23/disjoint__set_8cpp.html":[11,0,4,6],
"de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec":[11,0,4,6,0],
@@ -196,10 +201,6 @@ var NAVTREEINDEX13 =
"df/d47/stack_8hpp.html":[11,0,4,20],
"df/d47/stack_8hpp_source.html":[11,0,4,20],
"df/d4a/namespaceselection__sort__recursive.html":[9,0,101],
"df/d64/jumpgame_8cpp.html":[11,0,11,2],
"df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,11,2,2],
"df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,2,1],
"df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755":[11,0,11,2,0],
"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],
@@ -248,6 +249,5 @@ var NAVTREEINDEX13 =
"df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7":[9,0,35,7],
"df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2":[9,0,35,4],
"df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae":[9,0,35,8],
"df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346":[9,0,35,14],
"df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08":[9,0,35,5]
"df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346":[9,0,35,14]
};

1
navtreeindex14.js
View File

@@ -1,5 +1,6 @@
var NAVTREEINDEX14 =
{
"df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08":[9,0,35,5],
"df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84":[9,0,35,9],
"df/dd0/queue__using__two__stacks_8cpp.html":[11,0,4,15],
"df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863":[11,0,4,15,1],

6
navtreeindex3.js
View File

@@ -214,7 +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,37],
"d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d":[9,0,37,1],
"d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d":[9,0,37,2],
"d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502":[9,0,37,1],
"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],
@@ -248,6 +249,5 @@ var NAVTREEINDEX3 =
"d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,15,17,1],
"d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[11,0,15,17,3],
"d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe":[11,0,15,17,2],
"d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[11,0,15,17,0],
"d3/d09/node_8hpp.html":[11,0,4,12]
"d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[11,0,15,17,0]
};

4
navtreeindex4.js
View File

@@ -1,5 +1,6 @@
var NAVTREEINDEX4 =
{
"d3/d09/node_8hpp.html":[11,0,4,12],
"d3/d09/node_8hpp_source.html":[11,0,4,12],
"d3/d17/namespaceutil__functions.html":[9,0,126],
"d3/d19/sparse__matrix_8cpp.html":[11,0,17,18],
@@ -248,6 +249,5 @@ var NAVTREEINDEX4 =
"d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,22,21,1],
"d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d":[11,0,22,21,7],
"d4/d7a/shell__sort2_8cpp.html#a4d76603c54d3dc56146e92d10a043924":[11,0,22,21,4],
"d4/d7a/shell__sort2_8cpp.html#a5669396c6a6b1e14b97589b6e37980aa":[11,0,22,21,3],
"d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6":[11,0,22,21,6]
"d4/d7a/shell__sort2_8cpp.html#a5669396c6a6b1e14b97589b6e37980aa":[11,0,22,21,3]
};

4
navtreeindex5.js
View File

@@ -1,5 +1,6 @@
var NAVTREEINDEX5 =
{
"d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6":[11,0,22,21,6],
"d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c":[11,0,22,21,0],
"d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e":[11,0,22,21,8],
"d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246":[11,0,22,21,5],
@@ -248,6 +249,5 @@ var NAVTREEINDEX5 =
"d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079":[9,0,106,6],
"d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935":[9,0,106,1],
"d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf":[9,0,106,14],
"d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824":[9,0,106,7],
"d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331":[9,0,106,15]
"d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824":[9,0,106,7]
};

4
navtreeindex6.js
View File

@@ -1,5 +1,6 @@
var NAVTREEINDEX6 =
{
"d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331":[9,0,106,15],
"d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd":[9,0,106,13],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html":[9,0,20,0,0],
"d5/d95/structdata__structures_1_1treap_1_1_treap.html":[10,0,2,5,0],
@@ -248,6 +249,5 @@ var NAVTREEINDEX6 =
"d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50":[11,0,6,14,1],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,14,0],
"d6/d84/classhashing_1_1sha256_1_1_hash.html":[10,0,8,0,0],
"d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3":[10,0,8,0,0,1],
"d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08":[10,0,8,0,0,0]
"d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3":[10,0,8,0,0,1]
};

12
navtreeindex7.js
View File

@@ -1,5 +1,6 @@
var NAVTREEINDEX7 =
{
"d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08":[10,0,8,0,0,0],
"d6/d84/namespaceutils.html":[9,0,127],
"d6/d8d/namespacemorse.html":[9,0,73],
"d6/d9d/large__factorial_8cpp.html":[11,0,14,28],
@@ -32,6 +33,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/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],
@@ -244,10 +249,5 @@ var NAVTREEINDEX7 =
"d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9":[11,0,22,17,2],
"d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8":[11,0,22,17,1],
"d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,17,0],
"d8/d64/namespaceboruvkas__minimum__spanning__tree.html":[9,0,10],
"d8/d69/classgraph_1_1_h_k_graph.html":[9,0,35,1],
"d8/d69/classgraph_1_1_h_k_graph.html":[10,0,6,2],
"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[9,0,35,1,1],
"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[10,0,6,2,1],
"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[9,0,35,1,6]
"d8/d64/namespaceboruvkas__minimum__spanning__tree.html":[9,0,10]
};

12
navtreeindex8.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX8 =
{
"d8/d69/classgraph_1_1_h_k_graph.html":[9,0,35,1],
"d8/d69/classgraph_1_1_h_k_graph.html":[10,0,6,2],
"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[9,0,35,1,1],
"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[10,0,6,2,1],
"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[9,0,35,1,6],
"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[10,0,6,2,6],
"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[9,0,35,1,2],
"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[10,0,6,2,2],
@@ -244,10 +249,5 @@ var NAVTREEINDEX8 =
"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499":[10,0,13,0,0,1],
"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6":[10,0,13,0,0,0],
"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25":[10,0,13,0,0,2],
"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae":[10,0,13,0,0,3],
"d9/d13/namespaceinversion.html":[9,0,46],
"d9/d14/array__left__rotation_8cpp.html":[11,0,16,0],
"d9/d14/array__left__rotation_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,0,4],
"d9/d14/array__left__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,0,7],
"d9/d14/array__left__rotation_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,0,1]
"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae":[10,0,13,0,0,3]
};

12
navtreeindex9.js
View File

@@ -1,5 +1,10 @@
var NAVTREEINDEX9 =
{
"d9/d13/namespaceinversion.html":[9,0,46],
"d9/d14/array__left__rotation_8cpp.html":[11,0,16,0],
"d9/d14/array__left__rotation_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,0,4],
"d9/d14/array__left__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,0,7],
"d9/d14/array__left__rotation_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,0,1],
"d9/d14/array__left__rotation_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,0,6],
"d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,0,3],
"d9/d14/array__left__rotation_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,0,5],
@@ -244,10 +249,5 @@ var NAVTREEINDEX9 =
"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,2,0],
"da/d52/minimum__edit__distance_8cpp.html":[11,0,6,11],
"da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347":[11,0,6,11,2],
"da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,6,11,1],
"da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,11,3],
"da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2":[11,0,6,11,0],
"da/d5a/class_complex.html":[10,0,26],
"da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6":[10,0,26,11],
"da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da":[10,0,26,7]
"da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,6,11,1]
};

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

File diff suppressed because one or more lines are too long

4
search/all_8.js
View File

@@ -10,8 +10,8 @@ var searchData=
['calculate_7',['calculate',['../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978',1,'math::binomial']]],
['call_5fonce_8',['call_once',['http://en.cppreference.com/w/cpp/thread/call_once.html',0,'std']]],
['calloc_9',['calloc',['http://en.cppreference.com/w/cpp/memory/c/calloc.html',0,'std']]],
['canimove_10',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]],
['canjump_11',['canJump',['../df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755',1,'jumpgame.cpp']]],
['can_5fjump_10',['can_jump',['../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502',1,'greedy_algorithms']]],
['canimove_11',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]],
['capacity_12',['capacity',['../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02',1,'MinHeap::capacity'],['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()']]],
['cardinality_20matching_13',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]],
['case_201_3a_20the_20given_20node_20has_20the_20right_20node_20subtree_14',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],

4
search/all_f.js
View File

@@ -5,7 +5,7 @@ var searchData=
['jmp_5fbuf_2',['jmp_buf',['http://en.cppreference.com/w/cpp/utility/program/jmp_buf.html',0,'std']]],
['join_3',['join',['http://en.cppreference.com/w/cpp/thread/thread/join.html',0,'std::thread']]],
['joinable_4',['joinable',['http://en.cppreference.com/w/cpp/thread/thread/joinable.html',0,'std::thread']]],
['jump_5fsearch_2ecpp_5',['jump_search.cpp',['../d2/d22/jump__search_8cpp.html',1,'']]],
['jumpgame_2ecpp_6',['jumpgame.cpp',['../df/d64/jumpgame_8cpp.html',1,'']]],
['jump_5fgame_2ecpp_5',['jump_game.cpp',['../d6/dba/jump__game_8cpp.html',1,'']]],
['jump_5fsearch_2ecpp_6',['jump_search.cpp',['../d2/d22/jump__search_8cpp.html',1,'']]],
['jumpsearch_7',['jumpSearch',['../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0',1,'jump_search.cpp']]]
];

4
search/files_a.js
View File

@@ -1,6 +1,6 @@
var searchData=
[
['jarvis_5falgorithm_2ecpp_0',['jarvis_algorithm.cpp',['../d4/d8d/jarvis__algorithm_8cpp.html',1,'']]],
['jump_5fsearch_2ecpp_1',['jump_search.cpp',['../d2/d22/jump__search_8cpp.html',1,'']]],
['jumpgame_2ecpp_2',['jumpgame.cpp',['../df/d64/jumpgame_8cpp.html',1,'']]]
['jump_5fgame_2ecpp_1',['jump_game.cpp',['../d6/dba/jump__game_8cpp.html',1,'']]],
['jump_5fsearch_2ecpp_2',['jump_search.cpp',['../d2/d22/jump__search_8cpp.html',1,'']]]
];

2
search/functions_14.js
View File

File diff suppressed because one or more lines are too long

4
search/functions_3.js
View File

@@ -6,8 +6,8 @@ var searchData=
['calculate_3',['calculate',['../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978',1,'math::binomial']]],
['call_5fonce_4',['call_once',['http://en.cppreference.com/w/cpp/thread/call_once.html',0,'std']]],
['calloc_5',['calloc',['http://en.cppreference.com/w/cpp/memory/c/calloc.html',0,'std']]],
['canimove_6',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]],
['canjump_7',['canJump',['../df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755',1,'jumpgame.cpp']]],
['can_5fjump_6',['can_jump',['../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502',1,'greedy_algorithms']]],
['canimove_7',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]],
['capacity_8',['capacity',['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()']]],
['category_9',['category',['http://en.cppreference.com/w/cpp/error/error_code/category.html',0,'std::error_code::category()'],['http://en.cppreference.com/w/cpp/error/error_condition/category.html',0,'std::error_condition::category()']]],
['cauchy_5fdistribution_10',['cauchy_distribution',['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/cauchy_distribution.html',0,'std::cauchy_distribution']]],

2
search/functions_d.js
View File

File diff suppressed because one or more lines are too long