mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-07-16 11:32:44 +08:00
Documentation for 8b1eab204b
This commit is contained in:
realstealthninja
@@ -1,3 +1,4 @@
|
||||
<!-- HTML header for doxygen 1.12.0-->
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||||
<head>
|
||||
@@ -5,10 +6,15 @@
|
||||
<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++: backtracking Namespace Reference</title>
|
||||
<title>TheAlgorithms/C++: backtracking Namespace Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||||
<script type="text/javascript">
|
||||
DoxygenAwesomeDarkModeToggle.init()
|
||||
</script>
|
||||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
@@ -18,14 +24,24 @@
|
||||
<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 type="text/javascript">
|
||||
window.MathJax = {
|
||||
options: {
|
||||
ignoreHtmlClass: 'tex2jax_ignore',
|
||||
processHtmlClass: 'tex2jax_process'
|
||||
},
|
||||
loader: {
|
||||
load: ['[tex]/ams']
|
||||
},
|
||||
tex: {
|
||||
macros: {},
|
||||
packages: ['base','configmacros','ams']
|
||||
}
|
||||
};
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
@@ -123,7 +140,7 @@ Classes</h2></td></tr>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50" id="r_a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplParams" colspan="2">template<size_t T> </td></tr>
|
||||
<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplItemLeft" align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a78540bcb5ef3473b2348cbc34748ec50">minimax</a> (int depth, int node_index, bool is_max, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, T > &scores, double <a class="el" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>)</td></tr>
|
||||
<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplItemLeft" align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a78540bcb5ef3473b2348cbc34748ec50">minimax</a> (int depth, int node_index, bool is_max, const std::array< int, T > &scores, double <a class="el" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>)</td></tr>
|
||||
<tr class="memdesc:a78540bcb5ef3473b2348cbc34748ec50"><td class="mdescLeft"> </td><td class="mdescRight">Check which is the maximum/minimum number in the array. <br /></td></tr>
|
||||
<tr class="separator:a78540bcb5ef3473b2348cbc34748ec50"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
@@ -132,21 +149,21 @@ Functions</h2></td></tr>
|
||||
<p>for assert</p>
|
||||
<p>Backtracking algorithms.</p>
|
||||
<p>for IO operations</p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
|
||||
<p>for std::vector</p>
|
||||
<p>for assert for I/O operation</p>
|
||||
<p>Backtracking algorithms</p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for IO operations</p>
|
||||
<p>for std::array for IO operations</p>
|
||||
<p>Backtracking algorithms</p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></p>
|
||||
<p>for std::array</p>
|
||||
<p>Backtracking algorithms</p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a> for assert for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for log2</p>
|
||||
<p>for std::count for assert for IO operations for std::list for std::accumulate for std::vector</p>
|
||||
<p>for std::max, std::min for std::array for log2</p>
|
||||
<p>Backtracking algorithms</p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert</p>
|
||||
<p>for std::array for assert</p>
|
||||
<p>Backtracking algorithms</p>
|
||||
<p>for IO operations for unordered_map for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
|
||||
<p>for IO operations for unordered_map for std::vector</p>
|
||||
<p>Backtracking algorithms</p>
|
||||
<p>for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
|
||||
<p>for IO operations for std::vector</p>
|
||||
<p>Backtracking algorithms</p>
|
||||
<p>for assert</p>
|
||||
<p>Backtracking algorithms </p>
|
||||
@@ -177,7 +194,7 @@ template<size_t T> </div>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, T > &</td> <td class="paramname"><span class="paramname"><em>scores</em></span>, </td>
|
||||
<td class="paramtype">const std::array< int, T > &</td> <td class="paramname"><span class="paramname"><em>scores</em></span>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
@@ -199,6 +216,8 @@ template<size_t T> </div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>the maximum or minimum number </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/dfb/minimax_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../df/dfb/minimax_8cpp_source.html">minimax.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 40</span> {</div>
|
||||
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">if</span> (depth == <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">return</span> scores[node_index];</div>
|
||||
@@ -207,17 +226,10 @@ template<size_t T> </div>
|
||||
<div class="line"><span class="lineno"> 45</span> <span class="keywordtype">int</span> v1 = minimax(depth + 1, node_index * 2, !is_max, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordtype">int</span> v2 = minimax(depth + 1, node_index * 2 + 1, !is_max, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
|
||||
<div class="line"><span class="lineno"> 47</span> </div>
|
||||
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">return</span> is_max ? <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(v1, v2) : <a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::min(v1, v2);</div>
|
||||
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">return</span> is_max ? std::max(v1, v2) : std::min(v1, v2);</div>
|
||||
<div class="line"><span class="lineno"> 49</span>}</div>
|
||||
<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> avltree.cpp:38</div></div>
|
||||
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg" width="400" height="162"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -1,12 +0,0 @@
|
||||
<map id="backtracking::minimax" name="backtracking::minimax">
|
||||
<area shape="rect" id="Node000001" title="Check which is the maximum/minimum number in the array." alt="" coords="5,80,158,106"/>
|
||||
<area shape="poly" id="edge6_Node000001_Node000001" title=" " alt="" coords="54,81,49,71,52,62,63,56,82,53,101,56,111,63,108,67,99,61,81,59,65,61,56,65,55,71,59,78"/>
|
||||
<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="212,29,268,55"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="123,77,196,53,198,58,125,82"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="322,55,394,80"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="158,83,306,70,307,75,158,89"/>
|
||||
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="206,131,274,156"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="125,104,192,126,190,131,123,109"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="219,30,215,21,217,11,226,5,240,3,255,5,263,12,259,16,252,10,240,8,228,10,222,14,220,20,224,28"/>
|
||||
<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="269,46,307,54,306,59,268,51"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
c8b7a04cbe2bf55b877010b7c942dac6
|
||||
@@ -1,128 +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.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: backtracking::minimax Pages: 1 -->
|
||||
<svg width="300pt" height="121pt"
|
||||
viewBox="0.00 0.00 299.75 121.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 117.25)">
|
||||
<title>backtracking::minimax</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Check which is the maximum/minimum number in the array.">
|
||||
<polygon fill="#999999" stroke="#666666" points="114.25,-57.25 0,-57.25 0,-38 114.25,-38 114.25,-57.25"/>
|
||||
<text text-anchor="middle" x="57.12" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::minimax</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge6_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M38.53,-57.54C30.05,-66.15 36.25,-75.25 57.12,-75.25 68.54,-75.25 75.57,-72.53 78.2,-68.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.65,-68.01 76.05,-59.02 74.81,-69.54 81.65,-68.01"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="197,-95.25 154.75,-95.25 154.75,-76 197,-76 197,-95.25"/>
|
||||
<text text-anchor="middle" x="175.88" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M89.11,-57.71C106.06,-63.23 127.01,-70.05 143.96,-75.56"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="142.4,-78.74 152.99,-78.5 144.57,-72.08 142.4,-78.74"/>
|
||||
</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/max.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="291.75,-76.25 237.5,-76.25 237.5,-57 291.75,-57 291.75,-76.25"/>
|
||||
<text text-anchor="middle" x="264.62" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge4_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M114.55,-52.84C149.95,-56.12 194.63,-60.25 225.8,-63.13"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="225.26,-66.59 235.54,-64.03 225.9,-59.62 225.26,-66.59"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="201.5,-19.25 150.25,-19.25 150.25,0 201.5,0 201.5,-19.25"/>
|
||||
<text text-anchor="middle" x="175.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge5_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M89.11,-37.54C104.58,-32.5 123.39,-26.38 139.44,-21.16"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.17,-24.6 148.59,-18.18 138,-17.95 140.17,-24.6"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node2 -->
|
||||
<g id="edge2_Node000002_Node000002" class="edge">
|
||||
<title>Node2->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M161.98,-95.54C155.64,-104.15 160.27,-113.25 175.88,-113.25 184.41,-113.25 189.66,-110.53 191.63,-106.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.12,-106.32 190.02,-97.03 188.22,-107.47 195.12,-106.32"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge3_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M197.43,-81.12C206,-79.25 216.24,-77 226.06,-74.85"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="226.79,-78.28 235.81,-72.72 225.29,-71.44 226.79,-78.28"/>
|
||||
</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>
|
||||
|
Before Width: | Height: | Size: 5.3 KiB |
@@ -1,102 +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.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: backtracking::minimax Pages: 1 -->
|
||||
<svg width="300pt" height="121pt"
|
||||
viewBox="0.00 0.00 299.75 121.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 117.25)">
|
||||
<title>backtracking::minimax</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Check which is the maximum/minimum number in the array.">
|
||||
<polygon fill="#999999" stroke="#666666" points="114.25,-57.25 0,-57.25 0,-38 114.25,-38 114.25,-57.25"/>
|
||||
<text text-anchor="middle" x="57.12" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::minimax</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge6_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M38.53,-57.54C30.05,-66.15 36.25,-75.25 57.12,-75.25 68.54,-75.25 75.57,-72.53 78.2,-68.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.65,-68.01 76.05,-59.02 74.81,-69.54 81.65,-68.01"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="197,-95.25 154.75,-95.25 154.75,-76 197,-76 197,-95.25"/>
|
||||
<text text-anchor="middle" x="175.88" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M89.11,-57.71C106.06,-63.23 127.01,-70.05 143.96,-75.56"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="142.4,-78.74 152.99,-78.5 144.57,-72.08 142.4,-78.74"/>
|
||||
</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/max.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="291.75,-76.25 237.5,-76.25 237.5,-57 291.75,-57 291.75,-76.25"/>
|
||||
<text text-anchor="middle" x="264.62" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge4_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M114.55,-52.84C149.95,-56.12 194.63,-60.25 225.8,-63.13"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="225.26,-66.59 235.54,-64.03 225.9,-59.62 225.26,-66.59"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="201.5,-19.25 150.25,-19.25 150.25,0 201.5,0 201.5,-19.25"/>
|
||||
<text text-anchor="middle" x="175.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge5_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M89.11,-37.54C104.58,-32.5 123.39,-26.38 139.44,-21.16"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.17,-24.6 148.59,-18.18 138,-17.95 140.17,-24.6"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node2 -->
|
||||
<g id="edge2_Node000002_Node000002" class="edge">
|
||||
<title>Node2->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M161.98,-95.54C155.64,-104.15 160.27,-113.25 175.88,-113.25 184.41,-113.25 189.66,-110.53 191.63,-106.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.12,-106.32 190.02,-97.03 188.22,-107.47 195.12,-106.32"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge3_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M197.43,-81.12C206,-79.25 216.24,-77 226.06,-74.85"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="226.79,-78.28 235.81,-72.72 225.29,-71.44 226.79,-78.28"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 4.6 KiB |
Reference in New Issue
Block a user