mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
38 lines
1.6 KiB
XML
38 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 2.49.1 (20210923.0004)
|
|
-->
|
|
<!-- Title: math/binary_exponent.cpp Pages: 1 -->
|
|
<svg width="142pt" height="84pt"
|
|
viewBox="0.00 0.00 142.00 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>math/binary_exponent.cpp</title>
|
|
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 138,-80 138,4 -4,4"/>
|
|
<!-- 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="#bfbfbf" stroke="black" points="0,-56.5 0,-75.5 134,-75.5 134,-56.5 0,-56.5"/>
|
|
<text text-anchor="middle" x="67" y="-63.5" 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="white" stroke="#bfbfbf" points="39.5,-0.5 39.5,-19.5 94.5,-19.5 94.5,-0.5 39.5,-0.5"/>
|
|
<text text-anchor="middle" x="67" y="-7.5" 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="midnightblue" d="M67,-56.08C67,-49.01 67,-38.86 67,-29.99"/>
|
|
<polygon fill="midnightblue" stroke="midnightblue" points="70.5,-29.75 67,-19.75 63.5,-29.75 70.5,-29.75"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|