backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 11:32:44 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 0953376d31

Browse Source
This commit is contained in:
github-actions
2023-06-16 21:18:14 +00:00
parent 26f1eee566
commit 14deeecd50
7241 changed files with 234176 additions and 54779 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
dc/d9c/babylonian__method_8cpp.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: numerical_methods/babylonian_method.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -112,8 +112,7 @@ $(document).ready(function(){initNavTree('dc/d9c/babylonian__method_8cpp.html','
</div><div class="textblock"><div class="dynheader">
Include dependency graph for babylonian_method.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d08/babylonian__method_8cpp__incl.svg" width="252" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d08/babylonian__method_8cpp__incl.svg" width="252" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
@@ -178,12 +177,11 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 98</span> <span class="comment">// with 2 defined test cases</span></div>
<div class="line"><span class="lineno"> 99</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 100</span>}</div>
<div class="ttc" id="ababylonian__method_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> babylonian_method.cpp:62</div></div>
<div class="ttc" id="ababylonian__method_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> babylonian_method.cpp:62</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="../../dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg" width="463" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg" width="463" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -249,12 +247,11 @@ Here is the call graph for this function:</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></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="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
<div class="ttc" id="anamespacenumerical__methods_html_a28e67885f8606564cc8335f483f63309"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a></div><div class="ttdeci">double babylonian_method(double radicand)</div><div class="ttdoc">Babylonian methods is an iterative function which returns square root of radicand.</div><div class="ttdef"><b>Definition:</b> babylonian_method.cpp:30</div></div>
<div class="ttc" id="anamespacenumerical__methods_html_a28e67885f8606564cc8335f483f63309"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a></div><div class="ttdeci">double babylonian_method(double radicand)</div><div class="ttdoc">Babylonian methods is an iterative function which returns square root of radicand.</div><div class="ttdef"><b>Definition</b> babylonian_method.cpp:30</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="../../dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="366" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="366" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -265,7 +262,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../dc/d9c/babylonian__method_8cpp.html">babylonian_method.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
</ul>
</div>
</body>

13
dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,6 +1,11 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,33,49,59"/>
<area shape="rect" id="node2" href="$d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" title="Babylonian methods is an iterative function which returns square root of radicand." alt="" coords="97,26,239,66"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="287,6,359,32"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="289,60,357,85"/>
<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,33,49,59"/>
<area shape="rect" id="Node000002" href="$d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" title="Babylonian methods is an iterative function which returns square root of radicand." alt="" coords="97,26,239,66"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,43,82,43,82,49,49,49"/>
<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="287,6,359,32"/>
<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="48,31,70,20,96,11,142,4,190,3,273,9,272,14,190,8,143,10,97,16,72,25,50,36"/>
<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="289,60,357,85"/>
<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="50,56,72,67,97,75,144,82,191,84,274,78,275,83,191,89,143,87,96,80,70,72,48,61"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="239,31,272,25,273,31,240,36"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="240,56,275,62,274,67,239,61"/>
</map>

2
dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +1 @@
1ad0ec97185e9eadcd27498c58bf71ea
950f0521fee49507c3f1f74806aa3175

66
dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -6,21 +6,31 @@
<!-- Title: test Pages: 1 -->
<svg width="274pt" height="69pt"
viewBox="0.00 0.00 273.50 68.87" 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" onload="init(evt)">
<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 64.87)">
<title>test</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;test implementations.">
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="32.5,-40.07 0,-40.07 0,-20.82 32.5,-20.82 32.5,-40.07"/>
<text text-anchor="middle" x="16.25" y="-26.57" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" target="_top" xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
<g id="a_Node000002"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" target="_top" xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
<polygon fill="white" stroke="#666666" points="175.25,-45.69 68.5,-45.69 68.5,-15.19 175.25,-15.19 175.25,-45.69"/>
<text text-anchor="start" x="76.5" y="-32.19" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
<text text-anchor="middle" x="121.88" y="-20.94" font-family="Helvetica,sans-Serif" font-size="10.00">babylonian_method</text>
@@ -28,52 +38,82 @@
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.99,-30.44C39.83,-30.44 48.33,-30.44 57.32,-30.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.05,-33.94 67.05,-30.44 57.05,-26.94 57.05,-33.94"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink: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="265.5,-60.07 211.25,-60.07 211.25,-40.82 265.5,-40.82 265.5,-60.07"/>
<text text-anchor="middle" x="238.38" y="-46.57" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<g id="edge4_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.76,-39.9C42.61,-45.33 55.84,-51.63 68.5,-54.44 113.06,-64.36 165.86,-60.74 200.41,-56.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.52,-59.76 209.96,-54.95 199.58,-52.82 200.52,-59.76"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink: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="264,-20.07 212.75,-20.07 212.75,-0.82 264,-0.82 264,-20.07"/>
<text text-anchor="middle" x="238.38" y="-6.57" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge5" class="edge">
<g id="edge5_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.76,-20.99C42.61,-15.55 55.84,-9.26 68.5,-6.44 113.7,3.62 167.4,-0.26 201.9,-4.7"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.02,-8.25 211.4,-6.15 201.97,-1.31 201.02,-8.25"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M175.43,-39.62C183.82,-41.09 192.35,-42.58 200.29,-43.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.58,-47.57 210.03,-45.84 200.78,-40.67 199.58,-47.57"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M175.43,-21.26C184.33,-19.71 193.37,-18.13 201.7,-16.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="202.29,-19.95 211.53,-14.78 201.08,-13.06 202.29,-19.95"/>
</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>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 5.1 KiB

94
dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg Normal file
View File

@@ -0,0 +1,94 @@
<?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.5 (20230430.1635)
-->
<!-- Title: test Pages: 1 -->
<svg width="274pt" height="69pt"
viewBox="0.00 0.00 273.50 68.87" 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 64.87)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="32.5,-40.07 0,-40.07 0,-20.82 32.5,-20.82 32.5,-40.07"/>
<text text-anchor="middle" x="16.25" y="-26.57" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" target="_top" xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
<polygon fill="white" stroke="#666666" points="175.25,-45.69 68.5,-45.69 68.5,-15.19 175.25,-15.19 175.25,-45.69"/>
<text text-anchor="start" x="76.5" y="-32.19" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
<text text-anchor="middle" x="121.88" y="-20.94" font-family="Helvetica,sans-Serif" font-size="10.00">babylonian_method</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.99,-30.44C39.83,-30.44 48.33,-30.44 57.32,-30.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.05,-33.94 67.05,-30.44 57.05,-26.94 57.05,-33.94"/>
</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="265.5,-60.07 211.25,-60.07 211.25,-40.82 265.5,-40.82 265.5,-60.07"/>
<text text-anchor="middle" x="238.38" y="-46.57" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge4_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.76,-39.9C42.61,-45.33 55.84,-51.63 68.5,-54.44 113.06,-64.36 165.86,-60.74 200.41,-56.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.52,-59.76 209.96,-54.95 199.58,-52.82 200.52,-59.76"/>
</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="264,-20.07 212.75,-20.07 212.75,-0.82 264,-0.82 264,-20.07"/>
<text text-anchor="middle" x="238.38" y="-6.57" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge5_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.76,-20.99C42.61,-15.55 55.84,-9.26 68.5,-6.44 113.7,3.62 167.4,-0.26 201.9,-4.7"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.02,-8.25 211.4,-6.15 201.97,-1.31 201.02,-8.25"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M175.43,-39.62C183.82,-41.09 192.35,-42.58 200.29,-43.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.58,-47.57 210.03,-45.84 200.78,-40.67 199.58,-47.57"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M175.43,-21.26C184.33,-19.71 193.37,-18.13 201.7,-16.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="202.29,-19.95 211.53,-14.78 201.08,-13.06 202.29,-19.95"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.3 KiB

16
dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
View File

@@ -1,7 +1,13 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,33,55,59"/>
<area shape="rect" id="node2" href="$dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,33,146,59"/>
<area shape="rect" id="node3" href="$d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" title="Babylonian methods is an iterative function which returns square root of radicand." alt="" coords="194,26,336,66"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="384,6,457,32"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="386,60,455,85"/>
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,33,55,59"/>
<area shape="rect" id="Node000002" href="$dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,33,146,59"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,43,88,43,88,49,55,49"/>
<area shape="rect" id="Node000003" href="$d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" title="Babylonian methods is an iterative function which returns square root of radicand." alt="" coords="194,26,336,66"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="147,43,179,43,179,49,147,49"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="384,6,457,32"/>
<area shape="poly" id="edge5_Node000002_Node000004" title=" " alt="" coords="145,31,168,20,193,11,240,4,287,3,370,9,370,14,287,8,240,10,195,16,170,25,148,36"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="386,60,455,85"/>
<area shape="poly" id="edge6_Node000002_Node000005" title=" " alt="" coords="148,56,170,67,195,75,241,82,288,84,372,78,372,83,288,89,241,87,193,80,168,72,145,61"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="336,31,369,25,370,31,337,36"/>
<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="337,56,372,62,371,67,336,61"/>
</map>

2
dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
View File

@@ -1 +1 @@
82a8c26b631a3e051a9a174d482f205e
46be0b0c238595f958fed6afd4898473

75
dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
View File

@@ -6,36 +6,49 @@
<!-- Title: main Pages: 1 -->
<svg width="347pt" height="69pt"
viewBox="0.00 0.00 346.50 68.87" 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" onload="init(evt)">
<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 64.87)">
<title>main</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-40.07 0,-40.07 0,-20.82 37,-20.82 37,-40.07"/>
<text text-anchor="middle" x="18.5" y="-26.57" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<g id="a_Node000002"><a xlink:href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="105.5,-40.07 73,-40.07 73,-20.82 105.5,-20.82 105.5,-40.07"/>
<text text-anchor="middle" x="89.25" y="-26.57" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.2,-30.44C44.67,-30.44 53.52,-30.44 61.73,-30.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.71,-33.94 71.71,-30.44 61.71,-26.94 61.71,-33.94"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" target="_top" xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
<g id="a_Node000003"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" target="_top" xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
<polygon fill="white" stroke="#666666" points="248.25,-45.69 141.5,-45.69 141.5,-15.19 248.25,-15.19 248.25,-45.69"/>
<text text-anchor="start" x="149.5" y="-32.19" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
<text text-anchor="middle" x="194.88" y="-20.94" font-family="Helvetica,sans-Serif" font-size="10.00">babylonian_method</text>
@@ -43,52 +56,82 @@
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.99,-30.44C112.83,-30.44 121.33,-30.44 130.32,-30.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.05,-33.94 140.05,-30.44 130.05,-26.94 130.05,-33.94"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="338.5,-60.07 284.25,-60.07 284.25,-40.82 338.5,-40.82 338.5,-60.07"/>
<text text-anchor="middle" x="311.38" y="-46.57" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge5" class="edge">
<g id="edge5_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.76,-39.9C115.61,-45.33 128.84,-51.63 141.5,-54.44 186.06,-64.36 238.86,-60.74 273.41,-56.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="273.52,-59.76 282.96,-54.95 272.58,-52.82 273.52,-59.76"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="337,-20.07 285.75,-20.07 285.75,-0.82 337,-0.82 337,-20.07"/>
<text text-anchor="middle" x="311.38" y="-6.57" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge6" class="edge">
<g id="edge6_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge6_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.76,-20.99C115.61,-15.55 128.84,-9.26 141.5,-6.44 186.7,3.62 240.4,-0.26 274.9,-4.7"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="274.02,-8.25 284.4,-6.15 274.97,-1.31 274.02,-8.25"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M248.43,-39.62C256.82,-41.09 265.35,-42.58 273.29,-43.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="272.58,-47.57 283.03,-45.84 273.78,-40.67 272.58,-47.57"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<g id="edge4_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M248.43,-21.26C257.33,-19.71 266.37,-18.13 274.7,-16.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="275.29,-19.95 284.53,-14.78 274.08,-13.06 275.29,-19.95"/>
</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>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.6 KiB

After

Width:  |  Height:  |  Size: 6.0 KiB

112
dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg Normal file
View File

@@ -0,0 +1,112 @@
<?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.5 (20230430.1635)
-->
<!-- Title: main Pages: 1 -->
<svg width="347pt" height="69pt"
viewBox="0.00 0.00 346.50 68.87" 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 64.87)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-40.07 0,-40.07 0,-20.82 37,-20.82 37,-40.07"/>
<text text-anchor="middle" x="18.5" y="-26.57" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="105.5,-40.07 73,-40.07 73,-20.82 105.5,-20.82 105.5,-40.07"/>
<text text-anchor="middle" x="89.25" y="-26.57" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.2,-30.44C44.67,-30.44 53.52,-30.44 61.73,-30.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.71,-33.94 71.71,-30.44 61.71,-26.94 61.71,-33.94"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" target="_top" xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
<polygon fill="white" stroke="#666666" points="248.25,-45.69 141.5,-45.69 141.5,-15.19 248.25,-15.19 248.25,-45.69"/>
<text text-anchor="start" x="149.5" y="-32.19" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
<text text-anchor="middle" x="194.88" y="-20.94" font-family="Helvetica,sans-Serif" font-size="10.00">babylonian_method</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.99,-30.44C112.83,-30.44 121.33,-30.44 130.32,-30.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.05,-33.94 140.05,-30.44 130.05,-26.94 130.05,-33.94"/>
</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/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="338.5,-60.07 284.25,-60.07 284.25,-40.82 338.5,-40.82 338.5,-60.07"/>
<text text-anchor="middle" x="311.38" y="-46.57" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge5_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.76,-39.9C115.61,-45.33 128.84,-51.63 141.5,-54.44 186.06,-64.36 238.86,-60.74 273.41,-56.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="273.52,-59.76 282.96,-54.95 272.58,-52.82 273.52,-59.76"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="337,-20.07 285.75,-20.07 285.75,-0.82 337,-0.82 337,-20.07"/>
<text text-anchor="middle" x="311.38" y="-6.57" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge6_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge6_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.76,-20.99C115.61,-15.55 128.84,-9.26 141.5,-6.44 186.7,3.62 240.4,-0.26 274.9,-4.7"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="274.02,-8.25 284.4,-6.15 274.97,-1.31 274.02,-8.25"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M248.43,-39.62C256.82,-41.09 265.35,-42.58 273.29,-43.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="272.58,-47.57 283.03,-45.84 273.78,-40.67 272.58,-47.57"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M248.43,-21.26C257.33,-19.71 266.37,-18.13 274.7,-16.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="275.29,-19.95 284.53,-14.78 274.08,-13.06 275.29,-19.95"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.2 KiB