mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-13 15:49:45 +08:00
83 lines
3.5 KiB
XML
83 lines
3.5 KiB
XML
<?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 2.49.3 (20211023.0002)
|
|
-->
|
|
<!-- Title: backtracking/minimax.cpp Pages: 1 -->
|
|
<svg width="260pt" height="84pt"
|
|
viewBox="0.00 0.00 259.50 84.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 80)">
|
|
<title>backtracking/minimax.cpp</title>
|
|
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 255.5,-80 255.5,4 -4,4"/>
|
|
<!-- Node1 -->
|
|
<g id="node1" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_node1"><a xlink:title="returns which is the longest/shortest number using minimax algorithm">
|
|
<polygon fill="#bfbfbf" stroke="black" points="60,-56.5 60,-75.5 192,-75.5 192,-56.5 60,-56.5"/>
|
|
<text text-anchor="middle" x="126" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking/minimax.cpp</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node2 -->
|
|
<g id="node2" class="node">
|
|
<title>Node2</title>
|
|
<g id="a_node2"><a xlink:title=" ">
|
|
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 58,-19.5 58,-0.5 0,-0.5"/>
|
|
<text text-anchor="middle" x="29" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node2 -->
|
|
<g id="edge1" class="edge">
|
|
<title>Node1->Node2</title>
|
|
<path fill="none" stroke="midnightblue" d="M110.42,-56.32C95,-47.74 71.19,-34.49 53.29,-24.52"/>
|
|
<polygon fill="midnightblue" stroke="midnightblue" points="54.99,-21.46 44.55,-19.65 51.58,-27.58 54.99,-21.46"/>
|
|
</g>
|
|
<!-- Node3 -->
|
|
<g id="node3" class="node">
|
|
<title>Node3</title>
|
|
<g id="a_node3"><a xlink:title=" ">
|
|
<polygon fill="white" stroke="#bfbfbf" points="76.5,-0.5 76.5,-19.5 115.5,-19.5 115.5,-0.5 76.5,-0.5"/>
|
|
<text text-anchor="middle" x="96" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node3 -->
|
|
<g id="edge2" class="edge">
|
|
<title>Node1->Node3</title>
|
|
<path fill="none" stroke="midnightblue" d="M121.05,-56.08C116.9,-48.61 110.85,-37.72 105.73,-28.52"/>
|
|
<polygon fill="midnightblue" stroke="midnightblue" points="108.78,-26.79 100.86,-19.75 102.66,-30.19 108.78,-26.79"/>
|
|
</g>
|
|
<!-- Node4 -->
|
|
<g id="node4" class="node">
|
|
<title>Node4</title>
|
|
<g id="a_node4"><a xlink:title=" ">
|
|
<polygon fill="white" stroke="#bfbfbf" points="134,-0.5 134,-19.5 178,-19.5 178,-0.5 134,-0.5"/>
|
|
<text text-anchor="middle" x="156" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node4 -->
|
|
<g id="edge3" class="edge">
|
|
<title>Node1->Node4</title>
|
|
<path fill="none" stroke="midnightblue" d="M130.95,-56.08C135.1,-48.61 141.15,-37.72 146.27,-28.52"/>
|
|
<polygon fill="midnightblue" stroke="midnightblue" points="149.34,-30.19 151.14,-19.75 143.22,-26.79 149.34,-30.19"/>
|
|
</g>
|
|
<!-- Node5 -->
|
|
<g id="node5" class="node">
|
|
<title>Node5</title>
|
|
<g id="a_node5"><a xlink:title=" ">
|
|
<polygon fill="white" stroke="#bfbfbf" points="196.5,-0.5 196.5,-19.5 251.5,-19.5 251.5,-0.5 196.5,-0.5"/>
|
|
<text text-anchor="middle" x="224" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node5 -->
|
|
<g id="edge4" class="edge">
|
|
<title>Node1->Node5</title>
|
|
<path fill="none" stroke="midnightblue" d="M141.75,-56.32C157.32,-47.74 181.38,-34.49 199.46,-24.52"/>
|
|
<polygon fill="midnightblue" stroke="midnightblue" points="201.22,-27.55 208.29,-19.65 197.85,-21.42 201.22,-27.55"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|