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

Documentation for 0953376d31

Browse Source
This commit is contained in:
github-actions
2023-06-16 21:18:14 +00:00
parent 26f1eee566
commit 14deeecd50
7241 changed files with 234176 additions and 54779 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
dd/d24/namespacedynamic__programming.html
View File

@@ -3,7 +3,7 @@
<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.9.6"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: dynamic_programming Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -192,8 +192,7 @@ Functions</h2></td></tr>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.svg" width="312" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.svg" width="312" 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>
@@ -275,8 +274,7 @@ Here is the call graph for this function:</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.svg" width="308" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.svg" width="308" 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>
@@ -341,8 +339,7 @@ Here is the call graph for this function:</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.svg" width="327" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.svg" width="327" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -353,7 +350,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</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.9.6 </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.9.7 </li>
</ul>
</div>
</body>

5
dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.map
View File

@@ -1,4 +1,5 @@
<map id="dynamic_programming::LIS" name="dynamic_programming::LIS">
<area shape="rect" id="node1" title="Calculate the longest increasing subsequence for the specified numbers." alt="" coords="5,5,186,31"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="234,5,306,31"/>
<area shape="rect" id="Node000001" title="Calculate the longest increasing subsequence for the specified numbers." alt="" coords="5,5,186,31"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="234,5,306,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="186,16,219,16,219,21,186,21"/>
</map>

2
dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.md5
View File

@@ -1 +1 @@
fa06a4b65e01fc1484ffc025467f088b
b794bb4e2fe175e960812153cc6aa135

38
dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.svg
View File

@@ -6,31 +6,59 @@
<!-- Title: dynamic_programming::LIS Pages: 1 -->
<svg width="234pt" height="27pt"
viewBox="0.00 0.00 233.50 27.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" onload="init(evt)">
<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 23.25)">
<title>dynamic_programming::LIS</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Calculate the longest increasing subsequence for the specified numbers.">
<g id="a_Node000001"><a xlink:title="Calculate the longest increasing subsequence for the specified numbers.">
<polygon fill="#999999" stroke="#666666" points="135.25,-19.25 0,-19.25 0,0 135.25,0 135.25,-19.25"/>
<text text-anchor="middle" x="67.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::LIS</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="225.5,-19.25 171.25,-19.25 171.25,0 225.5,0 225.5,-19.25"/>
<text text-anchor="middle" x="198.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<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="M135.64,-9.62C144.01,-9.62 152.33,-9.62 160.02,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="159.76,-13.13 169.76,-9.62 159.76,-6.13 159.76,-13.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 Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

39
dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph_org.svg Normal file
View File

@@ -0,0 +1,39 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: dynamic_programming::LIS Pages: 1 -->
<svg width="234pt" height="27pt"
viewBox="0.00 0.00 233.50 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>dynamic_programming::LIS</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Calculate the longest increasing subsequence for the specified numbers.">
<polygon fill="#999999" stroke="#666666" points="135.25,-19.25 0,-19.25 0,0 135.25,0 135.25,-19.25"/>
<text text-anchor="middle" x="67.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::LIS</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="225.5,-19.25 171.25,-19.25 171.25,0 225.5,0 225.5,-19.25"/>
<text text-anchor="middle" x="198.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</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="M135.64,-9.62C144.01,-9.62 152.33,-9.62 160.02,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="159.76,-13.13 169.76,-9.62 159.76,-6.13 159.76,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.8 KiB

11
dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.map
View File

@@ -1,6 +1,9 @@
<map id="dynamic_programming::maxCircularSum" name="dynamic_programming::maxCircularSum">
<area shape="rect" id="node1" title="returns the maximum contiguous circular sum of an array" alt="" coords="5,47,158,88"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="227,5,300,31"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="229,55,298,80"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="206,104,321,130"/>
<area shape="rect" id="Node000001" title="returns the maximum contiguous circular sum of an array" alt="" coords="5,47,158,88"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="227,5,300,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,44,212,29,213,34,159,49"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="229,55,298,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="158,65,214,65,214,70,158,70"/>
<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="206,104,321,130"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="159,86,200,97,199,102,158,91"/>
</map>

2
dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.md5
View File

@@ -1 +1 @@
a4b53ef7a5f58d91d834f25179f45812
85de9be16b73e8ad71ac29f6c88528d7

56
dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: dynamic_programming::maxCircularSum Pages: 1 -->
<svg width="245pt" height="101pt"
viewBox="0.00 0.00 244.75 101.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" onload="init(evt)">
<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 97.25)">
<title>dynamic_programming::maxCircularSum</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="returns the maximum contiguous circular sum of an array">
<g id="a_Node000001"><a xlink:title="returns the maximum contiguous circular sum of an array">
<polygon fill="#999999" stroke="#666666" points="114.25,-61.88 0,-61.88 0,-31.38 114.25,-31.38 114.25,-61.88"/>
<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
<text text-anchor="middle" x="57.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::maxCircularSum</text>
@@ -19,49 +29,73 @@
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="220.62,-93.25 166.38,-93.25 166.38,-74 220.62,-74 220.62,-93.25"/>
<text text-anchor="middle" x="193.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<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="M114.72,-62.21C128.48,-66 142.85,-69.95 155.43,-73.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.41,-77.04 164.98,-76.32 156.26,-70.29 154.41,-77.04"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="219.12,-56.25 167.88,-56.25 167.88,-37 219.12,-37 219.12,-56.25"/>
<text text-anchor="middle" x="193.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<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="M114.72,-46.62C128.92,-46.62 143.77,-46.62 156.65,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.38,-50.13 166.38,-46.62 156.38,-43.13 156.38,-50.13"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink: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="236.75,-19.25 150.25,-19.25 150.25,0 236.75,0 236.75,-19.25"/>
<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<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="M114.72,-31.04C124.94,-28.23 135.5,-25.32 145.41,-22.59"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="146.15,-25.74 154.86,-19.71 144.29,-18.99 146.15,-25.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 Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 4.3 KiB

76
dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_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 8.0.5 (20230430.1635)
-->
<!-- Title: dynamic_programming::maxCircularSum Pages: 1 -->
<svg width="245pt" height="101pt"
viewBox="0.00 0.00 244.75 101.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 97.25)">
<title>dynamic_programming::maxCircularSum</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="returns the maximum contiguous circular sum of an array">
<polygon fill="#999999" stroke="#666666" points="114.25,-61.88 0,-61.88 0,-31.38 114.25,-31.38 114.25,-61.88"/>
<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
<text text-anchor="middle" x="57.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::maxCircularSum</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="220.62,-93.25 166.38,-93.25 166.38,-74 220.62,-74 220.62,-93.25"/>
<text text-anchor="middle" x="193.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</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="M114.72,-62.21C128.48,-66 142.85,-69.95 155.43,-73.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.41,-77.04 164.98,-76.32 156.26,-70.29 154.41,-77.04"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="219.12,-56.25 167.88,-56.25 167.88,-37 219.12,-37 219.12,-56.25"/>
<text text-anchor="middle" x="193.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</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="M114.72,-46.62C128.92,-46.62 143.77,-46.62 156.65,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.38,-50.13 166.38,-46.62 156.38,-43.13 156.38,-50.13"/>
</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="236.75,-19.25 150.25,-19.25 150.25,0 236.75,0 236.75,-19.25"/>
<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</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="M114.72,-31.04C124.94,-28.23 135.5,-25.32 145.41,-22.59"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="146.15,-25.74 154.86,-19.71 144.29,-18.99 146.15,-25.74"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.5 KiB

5
dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.map
View File

@@ -1,4 +1,5 @@
<map id="dynamic_programming::lps" name="dynamic_programming::lps">
<area shape="rect" id="node1" title="Function that returns the longest palindromic subsequence of a string." alt="" coords="5,5,183,31"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="231,5,303,31"/>
<area shape="rect" id="Node000001" title="Function that returns the longest palindromic subsequence of a string." alt="" coords="5,5,183,31"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="231,5,303,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,16,216,16,216,21,183,21"/>
</map>

2
dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.md5
View File

@@ -1 +1 @@
a5c5590509e672b7349efec3cef95ec2
1f4139b93c017d0ebbdfc39bf36938b0

38
dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.svg
View File

@@ -6,31 +6,59 @@
<!-- Title: dynamic_programming::lps Pages: 1 -->
<svg width="231pt" height="27pt"
viewBox="0.00 0.00 231.25 27.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" onload="init(evt)">
<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 23.25)">
<title>dynamic_programming::lps</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Function that returns the longest palindromic subsequence of a string.">
<g id="a_Node000001"><a xlink:title="Function that returns the longest palindromic subsequence of a string.">
<polygon fill="#999999" stroke="#666666" points="133,-19.25 0,-19.25 0,0 133,0 133,-19.25"/>
<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::lps</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="223.25,-19.25 169,-19.25 169,0 223.25,0 223.25,-19.25"/>
<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<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="M133.18,-9.62C141.64,-9.62 150.04,-9.62 157.82,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="157.68,-13.13 167.68,-9.62 157.68,-6.13 157.68,-13.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 Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

39
dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph_org.svg Normal file
View File

@@ -0,0 +1,39 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: dynamic_programming::lps Pages: 1 -->
<svg width="231pt" height="27pt"
viewBox="0.00 0.00 231.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>dynamic_programming::lps</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function that returns the longest palindromic subsequence of a string.">
<polygon fill="#999999" stroke="#666666" points="133,-19.25 0,-19.25 0,0 133,0 133,-19.25"/>
<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::lps</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="223.25,-19.25 169,-19.25 169,0 223.25,0 223.25,-19.25"/>
<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</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="M133.18,-9.62C141.64,-9.62 150.04,-9.62 157.82,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="157.68,-13.13 167.68,-9.62 157.68,-6.13 157.68,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.7 KiB