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

Documentation for ecb8a3388d

Browse Source
This commit is contained in:
realstealthninja
2024-10-24 16:26:35 +00:00
parent 4c55e5257f
commit fe2cc4c065
318 changed files with 3809 additions and 1401 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.map Normal file
View File

@@ -0,0 +1,13 @@
<map id="search/longest_increasing_subsequence_using_binary_search.cpp" name="search/longest_increasing_subsequence_using_binary_search.cpp">
<area shape="rect" id="Node000001" title="find the length of the Longest Increasing Subsequence (LIS) using Binary Search" alt="" coords="125,5,310,61"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,109,70,135"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="162,64,77,104,75,100,160,59"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="94,109,165,135"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="192,63,155,100,151,96,188,59"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="189,109,246,135"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="220,61,220,93,215,93,215,61"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="270,109,344,135"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="247,59,285,96,281,100,243,63"/>
<area shape="rect" id="Node000006" title=" " alt="" coords="369,109,429,135"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="276,59,361,100,359,104,273,64"/>
</map>

1
d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
d13e4b4654217688e7e19aebe8d72b0f

139
d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,139 @@
<?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.2 (20240928.0832)
-->
<!-- Title: search/longest_increasing_subsequence_using_binary_search.cpp Pages: 1 -->
<svg width="326pt" height="105pt"
viewBox="0.00 0.00 325.75 105.00" 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 101)">
<title>search/longest_increasing_subsequence_using_binary_search.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="find the length of the Longest Increasing Subsequence (LIS) using Binary Search">
<polygon fill="#999999" stroke="#666666" points="228.62,-97 89.62,-97 89.62,-55.25 228.62,-55.25 228.62,-97"/>
<text text-anchor="start" x="97.62" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">search/longest_increasing</text>
<text text-anchor="start" x="97.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
<text text-anchor="middle" x="159.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_search.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="M116.78,-54.89C96.1,-45.01 71.73,-33.37 53.18,-24.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="54.9,-21.45 44.37,-20.3 51.88,-27.77 54.9,-21.45"/>
</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="M138.6,-55.07C129.62,-46.29 119.18,-36.09 110.58,-27.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="113.09,-25.24 103.49,-20.75 108.19,-30.25 113.09,-25.24"/>
</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="M159.12,-55.07C159.12,-47.4 159.12,-38.64 159.12,-30.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="162.63,-31.21 159.13,-21.21 155.63,-31.21 162.63,-31.21"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="254,-19.25 198.25,-19.25 198.25,0 254,0 254,-19.25"/>
<text text-anchor="middle" x="226.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M179.96,-55.07C189.08,-46.29 199.67,-36.09 208.41,-27.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="210.84,-30.2 215.61,-20.75 205.98,-25.16 210.84,-30.2"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="317.75,-19.25 272.5,-19.25 272.5,0 317.75,0 317.75,-19.25"/>
<text text-anchor="middle" x="295.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M201.78,-54.89C222.62,-45.01 247.16,-33.37 265.85,-24.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.2,-27.74 274.74,-20.29 264.2,-21.42 267.2,-27.74"/>
</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: 5.6 KiB

113
d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,113 @@
<?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.2 (20240928.0832)
-->
<!-- Title: search/longest_increasing_subsequence_using_binary_search.cpp Pages: 1 -->
<svg width="326pt" height="105pt"
viewBox="0.00 0.00 325.75 105.00" 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 101)">
<title>search/longest_increasing_subsequence_using_binary_search.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="find the length of the Longest Increasing Subsequence (LIS) using Binary Search">
<polygon fill="#999999" stroke="#666666" points="228.62,-97 89.62,-97 89.62,-55.25 228.62,-55.25 228.62,-97"/>
<text text-anchor="start" x="97.62" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">search/longest_increasing</text>
<text text-anchor="start" x="97.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
<text text-anchor="middle" x="159.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_search.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="M116.78,-54.89C96.1,-45.01 71.73,-33.37 53.18,-24.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="54.9,-21.45 44.37,-20.3 51.88,-27.77 54.9,-21.45"/>
</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="M138.6,-55.07C129.62,-46.29 119.18,-36.09 110.58,-27.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="113.09,-25.24 103.49,-20.75 108.19,-30.25 113.09,-25.24"/>
</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="M159.12,-55.07C159.12,-47.4 159.12,-38.64 159.12,-30.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="162.63,-31.21 159.13,-21.21 155.63,-31.21 162.63,-31.21"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="254,-19.25 198.25,-19.25 198.25,0 254,0 254,-19.25"/>
<text text-anchor="middle" x="226.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M179.96,-55.07C189.08,-46.29 199.67,-36.09 208.41,-27.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="210.84,-30.2 215.61,-20.75 205.98,-25.16 210.84,-30.2"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="317.75,-19.25 272.5,-19.25 272.5,0 317.75,0 317.75,-19.25"/>
<text text-anchor="middle" x="295.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M201.78,-54.89C222.62,-45.01 247.16,-33.37 265.85,-24.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.2,-27.74 274.74,-20.29 264.2,-21.42 267.2,-27.74"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.9 KiB

2
d6/dba/jump__game_8cpp.html
View File

@@ -125,7 +125,7 @@ Include dependency graph for jump_game.cpp:</div>
<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="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for string class <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>