mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 21:01:50 +08:00
37 lines
1.6 KiB
XML
37 lines
1.6 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 8.0.4 (20230421.1958)
|
|
-->
|
|
<!-- Title: math/binary_exponent.cpp Pages: 1 -->
|
|
<svg width="139pt" height="83pt"
|
|
viewBox="0.00 0.00 138.75 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>math/binary_exponent.cpp</title>
|
|
<!-- Node1 -->
|
|
<g id="node1" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_node1"><a xlink:title="C++ Program to find Binary Exponent Iteratively and Recursively.">
|
|
<polygon fill="#999999" stroke="#666666" points="130.75,-74.5 0,-74.5 0,-55.25 130.75,-55.25 130.75,-74.5"/>
|
|
<text text-anchor="middle" x="65.38" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/binary_exponent.cpp</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node2 -->
|
|
<g id="node2" class="node">
|
|
<title>Node2</title>
|
|
<g id="a_node2"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="92.12,-19.25 38.62,-19.25 38.62,0 92.12,0 92.12,-19.25"/>
|
|
<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node2 -->
|
|
<g id="edge1" class="edge">
|
|
<title>Node1->Node2</title>
|
|
<path fill="none" stroke="#63b8ff" d="M65.38,-55.08C65.38,-48.42 65.38,-38.99 65.38,-30.53"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.88,-30.61 65.38,-20.61 61.88,-30.61 68.88,-30.61"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|