mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
37 lines
1.5 KiB
XML
37 lines
1.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 5.0.1 (20220820.1526)
|
|
-->
|
|
<!-- Title: math/binary_exponent.cpp Pages: 1 -->
|
|
<svg width="139pt" height="82pt"
|
|
viewBox="0.00 0.00 139.00 82.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 78)">
|
|
<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="131,-74 0,-74 0,-55 131,-55 131,-74"/>
|
|
<text text-anchor="middle" x="65.5" y="-62" 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.5,-19 38.5,-19 38.5,0 92.5,0 92.5,-19"/>
|
|
<text text-anchor="middle" x="65.5" y="-7" 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.5,-54.75C65.5,-47.8 65.5,-37.85 65.5,-29.13"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="69,-29.09 65.5,-19.09 62,-29.09 69,-29.09"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|