mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-30 13:33:58 +08:00
Documentation for c6af943508
This commit is contained in:
realstealthninja
@@ -137,7 +137,7 @@ Classes</h2></td></tr>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d0c/namespacehashing.html">hashing</a></td></tr>
|
||||
<tr class="memdesc:d6/d0c/namespacehashing"><td class="mdescLeft"> </td><td class="mdescRight">Hashing algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:d6/d0c/namespacehashing"><td class="mdescLeft"> </td><td class="mdescRight">Used for assert. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dd3/namespace_s_h_a.html">SHA</a></td></tr>
|
||||
<tr class="memdesc:de/dd3/namespace_s_h_a"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/SHA-1" target="_blank">SHA-1</a> algorithm implementation. <br /></td></tr>
|
||||
|
||||
@@ -238,7 +238,7 @@ Functions</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> evaluate_integral;</div>
|
||||
<div class="line"><span class="lineno"> 105</span>}</div>
|
||||
<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/at.html">std::map::at</a></div><div class="ttdeci">T at(T... args)</div></div>
|
||||
<div class="ttc" id="adata__structures_2sparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:47</div></div>
|
||||
<div class="ttc" id="adata__structures_2sparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
|
||||
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/insert.html">std::map::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
|
||||
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a></div></div>
|
||||
|
||||
@@ -1,21 +1,23 @@
|
||||
<map id="numerical_methods/durand_kerner_roots.cpp" name="numerical_methods/durand_kerner_roots.cpp">
|
||||
<area shape="rect" id="Node000001" title="Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm" alt="" coords="310,5,487,46"/>
|
||||
<area shape="rect" id="Node000001" title="Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm" alt="" coords="351,5,528,46"/>
|
||||
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,80,120"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="310,49,96,96,94,91,309,44"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="351,46,95,96,94,91,350,41"/>
|
||||
<area shape="rect" id="Node000003" title=" " alt="" coords="104,94,168,120"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="334,49,184,94,182,89,332,44"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="364,49,184,96,182,91,363,44"/>
|
||||
<area shape="rect" id="Node000004" title=" " alt="" coords="192,94,250,120"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="355,49,263,90,261,85,353,44"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="386,49,266,92,264,87,384,44"/>
|
||||
<area shape="rect" id="Node000005" title=" " alt="" coords="274,94,344,120"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="378,48,336,86,332,82,375,44"/>
|
||||
<area shape="rect" id="Node000006" title=" " alt="" coords="369,94,428,120"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="401,46,401,78,396,78,396,46"/>
|
||||
<area shape="rect" id="Node000007" title=" " alt="" coords="452,94,505,120"/>
|
||||
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="420,45,457,81,454,85,416,48"/>
|
||||
<area shape="rect" id="Node000008" title=" " alt="" coords="530,94,595,120"/>
|
||||
<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="441,44,525,85,523,89,438,49"/>
|
||||
<area shape="rect" id="Node000009" title=" " alt="" coords="619,94,690,120"/>
|
||||
<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="463,44,604,87,603,92,462,49"/>
|
||||
<area shape="rect" id="Node000010" title=" " alt="" coords="714,94,782,120"/>
|
||||
<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="488,43,700,91,699,96,487,49"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="409,49,343,88,341,83,406,44"/>
|
||||
<area shape="rect" id="Node000006" title=" " alt="" coords="368,94,429,120"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="432,48,414,81,410,79,427,45"/>
|
||||
<area shape="rect" id="Node000007" title=" " alt="" coords="453,94,512,120"/>
|
||||
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="453,45,471,79,466,81,448,48"/>
|
||||
<area shape="rect" id="Node000008" title=" " alt="" coords="536,94,589,120"/>
|
||||
<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="472,44,532,83,530,88,469,49"/>
|
||||
<area shape="rect" id="Node000009" title=" " alt="" coords="614,94,679,120"/>
|
||||
<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="492,44,602,86,600,91,491,49"/>
|
||||
<area shape="rect" id="Node000010" title=" " alt="" coords="703,94,774,120"/>
|
||||
<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="515,44,689,90,687,95,514,49"/>
|
||||
<area shape="rect" id="Node000011" title=" " alt="" coords="798,94,866,120"/>
|
||||
<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="529,40,784,91,783,96,528,45"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
cac6ddeb8112feac143e4e69b4e6cfb8
|
||||
b3701516f65ef32386452ebbb07ed41d
|
||||
@@ -47,7 +47,7 @@
|
||||
</g>
|
||||
</defs>
|
||||
<script type="application/ecmascript">
|
||||
var viewWidth = 590;
|
||||
var viewWidth = 653;
|
||||
var viewHeight = 94;
|
||||
var sectionId = 'dynsection-0';
|
||||
</script>
|
||||
@@ -59,9 +59,9 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm">
|
||||
<polygon fill="#999999" stroke="#666666" points="361.38,-85.75 228.38,-85.75 228.38,-55.25 361.38,-55.25 361.38,-85.75"/>
|
||||
<text text-anchor="start" x="236.38" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/durand</text>
|
||||
<text text-anchor="middle" x="294.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_kerner_roots.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="392.38,-85.75 259.38,-85.75 259.38,-55.25 392.38,-55.25 392.38,-85.75"/>
|
||||
<text text-anchor="start" x="267.38" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/durand</text>
|
||||
<text text-anchor="middle" x="325.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_kerner_roots.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -78,8 +78,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M227.89,-55.12C184.67,-45.79 126.94,-33.21 67.3,-19.78"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.15,-16.38 57.62,-17.59 66.61,-23.21 68.15,-16.38"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M258.95,-57.35C208.72,-48.07 137.98,-34.63 67.05,-19.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.12,-16.3 57.61,-17.65 66.67,-23.15 68.12,-16.3"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -96,8 +96,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M245.67,-54.8C210.65,-44.33 164.44,-30.52 133.07,-21.14"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.27,-17.85 123.69,-18.34 132.27,-24.56 134.27,-17.85"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M268.69,-54.82C232.4,-45.49 184.16,-33.06 133.28,-19.87"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.4,-16.54 123.85,-17.42 132.65,-23.32 134.4,-16.54"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -114,8 +114,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M261.66,-54.8C240.53,-45.44 213.35,-33.41 192.7,-24.27"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="194.22,-21.11 183.66,-20.27 191.38,-27.51 194.22,-21.11"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M284.91,-54.8C256.98,-44.77 220.49,-31.67 194.51,-22.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.76,-19.07 185.16,-18.98 193.39,-25.66 195.76,-19.07"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -132,8 +132,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge4_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M278.31,-54.95C268.7,-46.5 256.56,-35.83 246.6,-27.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="249.16,-24.67 239.34,-20.7 244.54,-29.93 249.16,-24.67"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M301.4,-54.8C286.47,-45.83 267.46,-34.41 252.51,-25.42"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="254.58,-22.58 244.2,-20.43 250.97,-28.58 254.58,-22.58"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -141,8 +141,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="317.12,-19.25 272.62,-19.25 272.62,0 317.12,0 317.12,-19.25"/>
|
||||
<text text-anchor="middle" x="294.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="317.5,-19.25 272.25,-19.25 272.25,0 317.5,0 317.5,-19.25"/>
|
||||
<text text-anchor="middle" x="294.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -150,8 +150,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge5_Node000001_Node000006" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M294.88,-54.95C294.88,-47.71 294.88,-38.84 294.88,-30.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="298.38,-31.21 294.88,-21.21 291.38,-31.21 298.38,-31.21"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M318.21,-54.95C314.22,-47.36 309.28,-37.99 304.98,-29.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="308.12,-28.26 300.36,-21.04 301.92,-31.52 308.12,-28.26"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -159,8 +159,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000007" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_Node000007"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="374.88,-19.25 334.88,-19.25 334.88,0 374.88,0 374.88,-19.25"/>
|
||||
<text text-anchor="middle" x="354.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="380.12,-19.25 335.62,-19.25 335.62,0 380.12,0 380.12,-19.25"/>
|
||||
<text text-anchor="middle" x="357.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -168,8 +168,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge6_Node000001_Node000007" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M309.71,-54.95C318.14,-46.67 328.74,-36.27 337.56,-27.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="339.86,-30.26 344.55,-20.76 334.96,-25.27 339.86,-30.26"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M333.79,-54.95C337.91,-47.36 343,-37.99 347.44,-29.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="350.52,-31.49 352.22,-21.03 344.37,-28.15 350.52,-31.49"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -177,8 +177,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000008" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_Node000008"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="442.38,-19.25 393.38,-19.25 393.38,0 442.38,0 442.38,-19.25"/>
|
||||
<text text-anchor="middle" x="417.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fstream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="437.88,-19.25 397.88,-19.25 397.88,0 437.88,0 437.88,-19.25"/>
|
||||
<text text-anchor="middle" x="417.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -186,8 +186,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge7_Node000001_Node000008" class="edge">
|
||||
<title>Node1->Node8</title>
|
||||
<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M325.6,-54.8C344.96,-45.53 369.8,-33.63 388.84,-24.52"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="390.14,-27.78 397.65,-20.31 387.12,-21.47 390.14,-27.78"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M348.62,-54.95C362.49,-46.07 380.19,-34.74 394.23,-25.76"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="395.88,-28.86 402.42,-20.52 392.11,-22.96 395.88,-28.86"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -195,8 +195,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000009" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_Node000009"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="513.62,-19.25 460.12,-19.25 460.12,0 513.62,0 513.62,-19.25"/>
|
||||
<text text-anchor="middle" x="486.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="505.38,-19.25 456.38,-19.25 456.38,0 505.38,0 505.38,-19.25"/>
|
||||
<text text-anchor="middle" x="480.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fstream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -204,8 +204,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge8_Node000001_Node000009" class="edge">
|
||||
<title>Node1->Node9</title>
|
||||
<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M342.83,-54.8C375.53,-44.77 418.25,-31.67 448.65,-22.35"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="449.67,-25.69 458.21,-19.42 447.62,-19 449.67,-25.69"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M364.59,-54.8C389.78,-45.23 422.34,-32.86 446.6,-23.64"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="447.58,-27.01 455.69,-20.19 445.1,-20.47 447.58,-27.01"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -213,8 +213,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000010" class="node">
|
||||
<title>Node10</title>
|
||||
<g id="a_Node000010"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="582.12,-19.25 531.62,-19.25 531.62,0 582.12,0 582.12,-19.25"/>
|
||||
<text text-anchor="middle" x="556.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">valarray</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="576.62,-19.25 523.12,-19.25 523.12,0 576.62,0 576.62,-19.25"/>
|
||||
<text text-anchor="middle" x="549.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -222,8 +222,26 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge9_Node000001_Node000010" class="edge">
|
||||
<title>Node1->Node10</title>
|
||||
<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M361.84,-55.32C404.68,-46.12 461.69,-33.62 520.31,-19.81"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="520.88,-23.27 529.8,-17.56 519.27,-16.46 520.88,-23.27"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M381.82,-54.8C422.4,-44.13 476.19,-29.99 511.87,-20.61"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="512.53,-24.06 521.31,-18.13 510.75,-17.29 512.53,-24.06"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node11 -->
|
||||
<g id="Node000011" class="node">
|
||||
<title>Node11</title>
|
||||
<g id="a_Node000011"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="645.12,-19.25 594.62,-19.25 594.62,0 645.12,0 645.12,-19.25"/>
|
||||
<text text-anchor="middle" x="619.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">valarray</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node11 -->
|
||||
<g id="edge10_Node000001_Node000011" class="edge">
|
||||
<title>Node1->Node11</title>
|
||||
<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M392.62,-57.69C442.7,-48.58 513.19,-35.23 583.47,-19.69"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="583.82,-23.2 592.82,-17.61 582.29,-16.37 583.82,-23.2"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 12 KiB After Width: | Height: | Size: 12 KiB |
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: numerical_methods/durand_kerner_roots.cpp Pages: 1 -->
|
||||
<svg width="590pt" height="94pt"
|
||||
viewBox="0.00 0.00 590.12 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="653pt" height="94pt"
|
||||
viewBox="0.00 0.00 653.12 93.75" 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 89.75)">
|
||||
<title>numerical_methods/durand_kerner_roots.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm">
|
||||
<polygon fill="#999999" stroke="#666666" points="361.38,-85.75 228.38,-85.75 228.38,-55.25 361.38,-55.25 361.38,-85.75"/>
|
||||
<text text-anchor="start" x="236.38" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/durand</text>
|
||||
<text text-anchor="middle" x="294.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_kerner_roots.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="392.38,-85.75 259.38,-85.75 259.38,-55.25 392.38,-55.25 392.38,-85.75"/>
|
||||
<text text-anchor="start" x="267.38" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/durand</text>
|
||||
<text text-anchor="middle" x="325.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_kerner_roots.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -31,8 +31,8 @@
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M227.89,-55.12C184.67,-45.79 126.94,-33.21 67.3,-19.78"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.15,-16.38 57.62,-17.59 66.61,-23.21 68.15,-16.38"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M258.95,-57.35C208.72,-48.07 137.98,-34.63 67.05,-19.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.12,-16.3 57.61,-17.65 66.67,-23.15 68.12,-16.3"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -49,8 +49,8 @@
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M245.67,-54.8C210.65,-44.33 164.44,-30.52 133.07,-21.14"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.27,-17.85 123.69,-18.34 132.27,-24.56 134.27,-17.85"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M268.69,-54.82C232.4,-45.49 184.16,-33.06 133.28,-19.87"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.4,-16.54 123.85,-17.42 132.65,-23.32 134.4,-16.54"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -67,8 +67,8 @@
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M261.66,-54.8C240.53,-45.44 213.35,-33.41 192.7,-24.27"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="194.22,-21.11 183.66,-20.27 191.38,-27.51 194.22,-21.11"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M284.91,-54.8C256.98,-44.77 220.49,-31.67 194.51,-22.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.76,-19.07 185.16,-18.98 193.39,-25.66 195.76,-19.07"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -85,8 +85,8 @@
|
||||
<g id="edge4_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M278.31,-54.95C268.7,-46.5 256.56,-35.83 246.6,-27.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="249.16,-24.67 239.34,-20.7 244.54,-29.93 249.16,-24.67"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M301.4,-54.8C286.47,-45.83 267.46,-34.41 252.51,-25.42"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="254.58,-22.58 244.2,-20.43 250.97,-28.58 254.58,-22.58"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -94,8 +94,8 @@
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="317.12,-19.25 272.62,-19.25 272.62,0 317.12,0 317.12,-19.25"/>
|
||||
<text text-anchor="middle" x="294.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="317.5,-19.25 272.25,-19.25 272.25,0 317.5,0 317.5,-19.25"/>
|
||||
<text text-anchor="middle" x="294.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -103,8 +103,8 @@
|
||||
<g id="edge5_Node000001_Node000006" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M294.88,-54.95C294.88,-47.71 294.88,-38.84 294.88,-30.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="298.38,-31.21 294.88,-21.21 291.38,-31.21 298.38,-31.21"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M318.21,-54.95C314.22,-47.36 309.28,-37.99 304.98,-29.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="308.12,-28.26 300.36,-21.04 301.92,-31.52 308.12,-28.26"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -112,8 +112,8 @@
|
||||
<g id="Node000007" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_Node000007"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="374.88,-19.25 334.88,-19.25 334.88,0 374.88,0 374.88,-19.25"/>
|
||||
<text text-anchor="middle" x="354.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="380.12,-19.25 335.62,-19.25 335.62,0 380.12,0 380.12,-19.25"/>
|
||||
<text text-anchor="middle" x="357.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -121,8 +121,8 @@
|
||||
<g id="edge6_Node000001_Node000007" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M309.71,-54.95C318.14,-46.67 328.74,-36.27 337.56,-27.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="339.86,-30.26 344.55,-20.76 334.96,-25.27 339.86,-30.26"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M333.79,-54.95C337.91,-47.36 343,-37.99 347.44,-29.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="350.52,-31.49 352.22,-21.03 344.37,-28.15 350.52,-31.49"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -130,8 +130,8 @@
|
||||
<g id="Node000008" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_Node000008"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="442.38,-19.25 393.38,-19.25 393.38,0 442.38,0 442.38,-19.25"/>
|
||||
<text text-anchor="middle" x="417.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fstream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="437.88,-19.25 397.88,-19.25 397.88,0 437.88,0 437.88,-19.25"/>
|
||||
<text text-anchor="middle" x="417.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -139,8 +139,8 @@
|
||||
<g id="edge7_Node000001_Node000008" class="edge">
|
||||
<title>Node1->Node8</title>
|
||||
<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M325.6,-54.8C344.96,-45.53 369.8,-33.63 388.84,-24.52"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="390.14,-27.78 397.65,-20.31 387.12,-21.47 390.14,-27.78"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M348.62,-54.95C362.49,-46.07 380.19,-34.74 394.23,-25.76"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="395.88,-28.86 402.42,-20.52 392.11,-22.96 395.88,-28.86"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -148,8 +148,8 @@
|
||||
<g id="Node000009" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_Node000009"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="513.62,-19.25 460.12,-19.25 460.12,0 513.62,0 513.62,-19.25"/>
|
||||
<text text-anchor="middle" x="486.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="505.38,-19.25 456.38,-19.25 456.38,0 505.38,0 505.38,-19.25"/>
|
||||
<text text-anchor="middle" x="480.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fstream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -157,8 +157,8 @@
|
||||
<g id="edge8_Node000001_Node000009" class="edge">
|
||||
<title>Node1->Node9</title>
|
||||
<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M342.83,-54.8C375.53,-44.77 418.25,-31.67 448.65,-22.35"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="449.67,-25.69 458.21,-19.42 447.62,-19 449.67,-25.69"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M364.59,-54.8C389.78,-45.23 422.34,-32.86 446.6,-23.64"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="447.58,-27.01 455.69,-20.19 445.1,-20.47 447.58,-27.01"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -166,8 +166,8 @@
|
||||
<g id="Node000010" class="node">
|
||||
<title>Node10</title>
|
||||
<g id="a_Node000010"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="582.12,-19.25 531.62,-19.25 531.62,0 582.12,0 582.12,-19.25"/>
|
||||
<text text-anchor="middle" x="556.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">valarray</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="576.62,-19.25 523.12,-19.25 523.12,0 576.62,0 576.62,-19.25"/>
|
||||
<text text-anchor="middle" x="549.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -175,8 +175,26 @@
|
||||
<g id="edge9_Node000001_Node000010" class="edge">
|
||||
<title>Node1->Node10</title>
|
||||
<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M361.84,-55.32C404.68,-46.12 461.69,-33.62 520.31,-19.81"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="520.88,-23.27 529.8,-17.56 519.27,-16.46 520.88,-23.27"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M381.82,-54.8C422.4,-44.13 476.19,-29.99 511.87,-20.61"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="512.53,-24.06 521.31,-18.13 510.75,-17.29 512.53,-24.06"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node11 -->
|
||||
<g id="Node000011" class="node">
|
||||
<title>Node11</title>
|
||||
<g id="a_Node000011"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="645.12,-19.25 594.62,-19.25 594.62,0 645.12,0 645.12,-19.25"/>
|
||||
<text text-anchor="middle" x="619.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">valarray</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node11 -->
|
||||
<g id="edge10_Node000001_Node000011" class="edge">
|
||||
<title>Node1->Node11</title>
|
||||
<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M392.62,-57.69C442.7,-48.58 513.19,-35.23 583.47,-19.69"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="583.82,-23.2 592.82,-17.61 582.29,-16.37 583.82,-23.2"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 7.7 KiB After Width: | Height: | Size: 8.4 KiB |
@@ -1,21 +1,23 @@
|
||||
<map id="cpu_scheduling_algorithms/fcfs_scheduling.cpp" name="cpu_scheduling_algorithms/fcfs_scheduling.cpp">
|
||||
<area shape="rect" id="Node000001" title="Implementation of FCFS CPU scheduling algorithm." alt="" coords="296,5,474,46"/>
|
||||
<area shape="rect" id="Node000001" title="Implementation of FCFS CPU scheduling algorithm." alt="" coords="339,5,517,46"/>
|
||||
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,80,120"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="300,49,96,96,94,91,299,44"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="339,47,95,96,94,91,338,41"/>
|
||||
<area shape="rect" id="Node000003" title=" " alt="" coords="104,94,168,120"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="324,49,183,93,182,88,322,44"/>
|
||||
<area shape="rect" id="Node000004" title=" " alt="" coords="192,94,251,120"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="345,49,261,89,259,85,343,44"/>
|
||||
<area shape="rect" id="Node000005" title=" " alt="" coords="274,94,328,120"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="366,48,327,85,323,81,363,44"/>
|
||||
<area shape="rect" id="Node000006" title=" " alt="" coords="352,94,418,120"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="388,46,388,78,382,78,382,46"/>
|
||||
<area shape="rect" id="Node000007" title=" " alt="" coords="443,94,514,120"/>
|
||||
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="410,44,454,82,451,86,407,48"/>
|
||||
<area shape="rect" id="Node000008" title=" " alt="" coords="538,94,595,120"/>
|
||||
<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="432,44,526,85,524,90,429,49"/>
|
||||
<area shape="rect" id="Node000009" title=" " alt="" coords="619,94,722,120"/>
|
||||
<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="457,44,612,87,611,92,456,49"/>
|
||||
<area shape="rect" id="Node000010" title=" " alt="" coords="746,94,803,120"/>
|
||||
<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="475,39,593,61,731,91,730,96,592,66,474,44"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="356,49,184,95,183,90,354,44"/>
|
||||
<area shape="rect" id="Node000004" title=" " alt="" coords="192,94,253,120"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="378,49,268,91,266,86,376,44"/>
|
||||
<area shape="rect" id="Node000005" title=" " alt="" coords="277,94,336,120"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="399,49,339,88,336,83,396,44"/>
|
||||
<area shape="rect" id="Node000006" title=" " alt="" coords="360,94,413,120"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="420,48,402,81,398,79,415,45"/>
|
||||
<area shape="rect" id="Node000007" title=" " alt="" coords="437,94,504,120"/>
|
||||
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="441,45,459,79,454,81,436,48"/>
|
||||
<area shape="rect" id="Node000008" title=" " alt="" coords="528,94,600,120"/>
|
||||
<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="463,44,532,84,529,88,460,49"/>
|
||||
<area shape="rect" id="Node000009" title=" " alt="" coords="624,94,680,120"/>
|
||||
<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="485,44,610,88,608,93,483,49"/>
|
||||
<area shape="rect" id="Node000010" title=" " alt="" coords="704,94,808,120"/>
|
||||
<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="510,44,691,87,690,92,509,49"/>
|
||||
<area shape="rect" id="Node000011" title=" " alt="" coords="831,94,888,120"/>
|
||||
<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="518,37,655,59,816,91,815,96,654,64,517,42"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
574160bb27e3ebdf5d382774d4a8ad38
|
||||
cca3a95fa3f0ea01ce0fcbde556d97b8
|
||||
@@ -47,7 +47,7 @@
|
||||
</g>
|
||||
</defs>
|
||||
<script type="application/ecmascript">
|
||||
var viewWidth = 606;
|
||||
var viewWidth = 670;
|
||||
var viewHeight = 94;
|
||||
var sectionId = 'dynsection-0';
|
||||
</script>
|
||||
@@ -59,9 +59,9 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Implementation of FCFS CPU scheduling algorithm.">
|
||||
<polygon fill="#999999" stroke="#666666" points="351.75,-85.75 218,-85.75 218,-55.25 351.75,-55.25 351.75,-85.75"/>
|
||||
<text text-anchor="start" x="226" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">cpu_scheduling_algorithms</text>
|
||||
<text text-anchor="middle" x="284.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/fcfs_scheduling.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="383.75,-85.75 250,-85.75 250,-55.25 383.75,-55.25 383.75,-85.75"/>
|
||||
<text text-anchor="start" x="258" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">cpu_scheduling_algorithms</text>
|
||||
<text text-anchor="middle" x="316.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/fcfs_scheduling.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -78,8 +78,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M220.36,-54.84C179.16,-45.47 124.3,-32.95 67.22,-19.78"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.16,-16.41 57.63,-17.57 66.59,-23.23 68.16,-16.41"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M249.64,-56.7C201.38,-47.38 134.54,-34.18 66.98,-19.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.13,-16.32 57.62,-17.63 66.65,-23.16 68.13,-16.32"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -96,8 +96,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M238.17,-54.8C205.55,-44.53 162.71,-31.04 132.98,-21.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.32,-18.43 123.73,-18.76 132.21,-25.11 134.32,-18.43"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M262.18,-54.8C221.88,-43.96 168.25,-29.54 133.4,-20.17"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.37,-16.81 123.81,-17.6 132.55,-23.57 134.37,-16.81"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -105,8 +105,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="184.12,-19.25 139.62,-19.25 139.62,0 184.12,0 184.12,-19.25"/>
|
||||
<text text-anchor="middle" x="161.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="185.5,-19.25 140.25,-19.25 140.25,0 185.5,0 185.5,-19.25"/>
|
||||
<text text-anchor="middle" x="162.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -114,8 +114,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M254.15,-54.8C234.79,-45.53 209.95,-33.63 190.91,-24.52"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.63,-21.47 182.1,-20.31 189.61,-27.78 192.63,-21.47"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M278.41,-54.8C253.07,-45.11 220.23,-32.55 196.04,-23.3"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="197.6,-20.15 187.01,-19.85 195.1,-26.69 197.6,-20.15"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -123,8 +123,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="241.88,-19.25 201.88,-19.25 201.88,0 241.88,0 241.88,-19.25"/>
|
||||
<text text-anchor="middle" x="221.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="248.12,-19.25 203.62,-19.25 203.62,0 248.12,0 248.12,-19.25"/>
|
||||
<text text-anchor="middle" x="225.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -132,8 +132,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge4_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M269.3,-54.95C260.36,-46.59 249.08,-36.05 239.77,-27.35"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="242.39,-25.01 232.69,-20.73 237.61,-30.12 242.39,-25.01"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M294.38,-54.95C280.66,-46.07 263.15,-34.74 249.27,-25.76"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="251.47,-23.02 241.17,-20.52 247.67,-28.89 251.47,-23.02"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -141,8 +141,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="309.75,-19.25 260,-19.25 260,0 309.75,0 309.75,-19.25"/>
|
||||
<text text-anchor="middle" x="284.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iomanip</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="305.88,-19.25 265.88,-19.25 265.88,0 305.88,0 305.88,-19.25"/>
|
||||
<text text-anchor="middle" x="285.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -150,8 +150,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge5_Node000001_Node000006" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M284.88,-54.95C284.88,-47.71 284.88,-38.84 284.88,-30.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="288.38,-31.21 284.88,-21.21 281.38,-31.21 288.38,-31.21"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M309.21,-54.95C305.22,-47.36 300.28,-37.99 295.98,-29.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="299.12,-28.26 291.36,-21.04 292.92,-31.52 299.12,-28.26"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -159,8 +159,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000007" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_Node000007"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="381.62,-19.25 328.12,-19.25 328.12,0 381.62,0 381.62,-19.25"/>
|
||||
<text text-anchor="middle" x="354.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="373.75,-19.25 324,-19.25 324,0 373.75,0 373.75,-19.25"/>
|
||||
<text text-anchor="middle" x="348.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iomanip</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -168,8 +168,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge6_Node000001_Node000007" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M302.18,-54.95C312.22,-46.5 324.9,-35.83 335.31,-27.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="337.53,-29.79 342.93,-20.68 333.02,-24.43 337.53,-29.79"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M324.79,-54.95C328.91,-47.36 334,-37.99 338.44,-29.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="341.52,-31.49 343.22,-21.03 335.37,-28.15 341.52,-31.49"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -177,8 +177,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000008" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_Node000008"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="442,-19.25 399.75,-19.25 399.75,0 442,0 442,-19.25"/>
|
||||
<text text-anchor="middle" x="420.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="445.62,-19.25 392.12,-19.25 392.12,0 445.62,0 445.62,-19.25"/>
|
||||
<text text-anchor="middle" x="418.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -186,8 +186,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge7_Node000001_Node000008" class="edge">
|
||||
<title>Node1->Node8</title>
|
||||
<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M318.84,-54.8C340.55,-45.4 368.49,-33.3 389.64,-24.14"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="390.84,-27.44 398.63,-20.26 388.06,-21.02 390.84,-27.44"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M342.35,-54.8C358.03,-45.74 378.06,-34.19 393.69,-25.16"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="395.01,-28.44 401.92,-20.41 391.51,-22.38 395.01,-28.44"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -195,8 +195,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000009" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_Node000009"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="537.62,-19.25 460.12,-19.25 460.12,0 537.62,0 537.62,-19.25"/>
|
||||
<text text-anchor="middle" x="498.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_set</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="506,-19.25 463.75,-19.25 463.75,0 506,0 506,-19.25"/>
|
||||
<text text-anchor="middle" x="484.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -204,8 +204,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge8_Node000001_Node000009" class="edge">
|
||||
<title>Node1->Node9</title>
|
||||
<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M338.32,-54.8C374.25,-44.91 421.03,-32.04 454.82,-22.75"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="455.57,-26.17 464.28,-20.14 453.71,-19.42 455.57,-26.17"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M358.84,-54.8C387.92,-44.6 426.06,-31.24 452.74,-21.89"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="453.7,-25.26 461.98,-18.65 451.39,-18.65 453.7,-25.26"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -213,8 +213,8 @@ var sectionId = 'dynsection-0';
|
||||
<g id="Node000010" class="node">
|
||||
<title>Node10</title>
|
||||
<g id="a_Node000010"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="598.38,-19.25 555.38,-19.25 555.38,0 598.38,0 598.38,-19.25"/>
|
||||
<text text-anchor="middle" x="576.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="601.62,-19.25 524.12,-19.25 524.12,0 601.62,0 601.62,-19.25"/>
|
||||
<text text-anchor="middle" x="562.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_set</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -222,8 +222,26 @@ var sectionId = 'dynsection-0';
|
||||
<g id="edge9_Node000001_Node000010" class="edge">
|
||||
<title>Node1->Node10</title>
|
||||
<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M352,-58.35C402.55,-49.56 473.74,-36.35 544.15,-19.75"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="544.59,-23.24 553.51,-17.52 542.97,-16.43 544.59,-23.24"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M378.32,-54.8C420.15,-44.78 474.79,-31.71 513.74,-22.38"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="514.4,-25.82 523.31,-20.09 512.77,-19.02 514.4,-25.82"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node11 -->
|
||||
<g id="Node000011" class="node">
|
||||
<title>Node11</title>
|
||||
<g id="a_Node000011"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="662.38,-19.25 619.38,-19.25 619.38,0 662.38,0 662.38,-19.25"/>
|
||||
<text text-anchor="middle" x="640.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node11 -->
|
||||
<g id="edge10_Node000001_Node000011" class="edge">
|
||||
<title>Node1->Node11</title>
|
||||
<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M384.14,-60.17C441.43,-51.73 526.11,-38.1 607.98,-19.72"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="608.54,-23.19 617.52,-17.55 606.99,-16.36 608.54,-23.19"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 11 KiB After Width: | Height: | Size: 12 KiB |
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: cpu_scheduling_algorithms/fcfs_scheduling.cpp Pages: 1 -->
|
||||
<svg width="606pt" height="94pt"
|
||||
viewBox="0.00 0.00 606.38 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="670pt" height="94pt"
|
||||
viewBox="0.00 0.00 670.38 93.75" 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 89.75)">
|
||||
<title>cpu_scheduling_algorithms/fcfs_scheduling.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Implementation of FCFS CPU scheduling algorithm.">
|
||||
<polygon fill="#999999" stroke="#666666" points="351.75,-85.75 218,-85.75 218,-55.25 351.75,-55.25 351.75,-85.75"/>
|
||||
<text text-anchor="start" x="226" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">cpu_scheduling_algorithms</text>
|
||||
<text text-anchor="middle" x="284.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/fcfs_scheduling.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="383.75,-85.75 250,-85.75 250,-55.25 383.75,-55.25 383.75,-85.75"/>
|
||||
<text text-anchor="start" x="258" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">cpu_scheduling_algorithms</text>
|
||||
<text text-anchor="middle" x="316.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/fcfs_scheduling.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -31,8 +31,8 @@
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M220.36,-54.84C179.16,-45.47 124.3,-32.95 67.22,-19.78"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.16,-16.41 57.63,-17.57 66.59,-23.23 68.16,-16.41"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M249.64,-56.7C201.38,-47.38 134.54,-34.18 66.98,-19.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.13,-16.32 57.62,-17.63 66.65,-23.16 68.13,-16.32"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -49,8 +49,8 @@
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M238.17,-54.8C205.55,-44.53 162.71,-31.04 132.98,-21.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.32,-18.43 123.73,-18.76 132.21,-25.11 134.32,-18.43"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M262.18,-54.8C221.88,-43.96 168.25,-29.54 133.4,-20.17"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.37,-16.81 123.81,-17.6 132.55,-23.57 134.37,-16.81"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -58,8 +58,8 @@
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="184.12,-19.25 139.62,-19.25 139.62,0 184.12,0 184.12,-19.25"/>
|
||||
<text text-anchor="middle" x="161.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="185.5,-19.25 140.25,-19.25 140.25,0 185.5,0 185.5,-19.25"/>
|
||||
<text text-anchor="middle" x="162.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -67,8 +67,8 @@
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M254.15,-54.8C234.79,-45.53 209.95,-33.63 190.91,-24.52"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.63,-21.47 182.1,-20.31 189.61,-27.78 192.63,-21.47"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M278.41,-54.8C253.07,-45.11 220.23,-32.55 196.04,-23.3"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="197.6,-20.15 187.01,-19.85 195.1,-26.69 197.6,-20.15"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -76,8 +76,8 @@
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="241.88,-19.25 201.88,-19.25 201.88,0 241.88,0 241.88,-19.25"/>
|
||||
<text text-anchor="middle" x="221.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="248.12,-19.25 203.62,-19.25 203.62,0 248.12,0 248.12,-19.25"/>
|
||||
<text text-anchor="middle" x="225.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -85,8 +85,8 @@
|
||||
<g id="edge4_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M269.3,-54.95C260.36,-46.59 249.08,-36.05 239.77,-27.35"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="242.39,-25.01 232.69,-20.73 237.61,-30.12 242.39,-25.01"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M294.38,-54.95C280.66,-46.07 263.15,-34.74 249.27,-25.76"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="251.47,-23.02 241.17,-20.52 247.67,-28.89 251.47,-23.02"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -94,8 +94,8 @@
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="309.75,-19.25 260,-19.25 260,0 309.75,0 309.75,-19.25"/>
|
||||
<text text-anchor="middle" x="284.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iomanip</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="305.88,-19.25 265.88,-19.25 265.88,0 305.88,0 305.88,-19.25"/>
|
||||
<text text-anchor="middle" x="285.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -103,8 +103,8 @@
|
||||
<g id="edge5_Node000001_Node000006" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M284.88,-54.95C284.88,-47.71 284.88,-38.84 284.88,-30.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="288.38,-31.21 284.88,-21.21 281.38,-31.21 288.38,-31.21"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M309.21,-54.95C305.22,-47.36 300.28,-37.99 295.98,-29.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="299.12,-28.26 291.36,-21.04 292.92,-31.52 299.12,-28.26"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -112,8 +112,8 @@
|
||||
<g id="Node000007" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_Node000007"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="381.62,-19.25 328.12,-19.25 328.12,0 381.62,0 381.62,-19.25"/>
|
||||
<text text-anchor="middle" x="354.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="373.75,-19.25 324,-19.25 324,0 373.75,0 373.75,-19.25"/>
|
||||
<text text-anchor="middle" x="348.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iomanip</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -121,8 +121,8 @@
|
||||
<g id="edge6_Node000001_Node000007" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M302.18,-54.95C312.22,-46.5 324.9,-35.83 335.31,-27.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="337.53,-29.79 342.93,-20.68 333.02,-24.43 337.53,-29.79"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M324.79,-54.95C328.91,-47.36 334,-37.99 338.44,-29.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="341.52,-31.49 343.22,-21.03 335.37,-28.15 341.52,-31.49"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -130,8 +130,8 @@
|
||||
<g id="Node000008" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_Node000008"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="442,-19.25 399.75,-19.25 399.75,0 442,0 442,-19.25"/>
|
||||
<text text-anchor="middle" x="420.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="445.62,-19.25 392.12,-19.25 392.12,0 445.62,0 445.62,-19.25"/>
|
||||
<text text-anchor="middle" x="418.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -139,8 +139,8 @@
|
||||
<g id="edge7_Node000001_Node000008" class="edge">
|
||||
<title>Node1->Node8</title>
|
||||
<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M318.84,-54.8C340.55,-45.4 368.49,-33.3 389.64,-24.14"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="390.84,-27.44 398.63,-20.26 388.06,-21.02 390.84,-27.44"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M342.35,-54.8C358.03,-45.74 378.06,-34.19 393.69,-25.16"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="395.01,-28.44 401.92,-20.41 391.51,-22.38 395.01,-28.44"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -148,8 +148,8 @@
|
||||
<g id="Node000009" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_Node000009"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="537.62,-19.25 460.12,-19.25 460.12,0 537.62,0 537.62,-19.25"/>
|
||||
<text text-anchor="middle" x="498.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_set</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="506,-19.25 463.75,-19.25 463.75,0 506,0 506,-19.25"/>
|
||||
<text text-anchor="middle" x="484.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -157,8 +157,8 @@
|
||||
<g id="edge8_Node000001_Node000009" class="edge">
|
||||
<title>Node1->Node9</title>
|
||||
<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M338.32,-54.8C374.25,-44.91 421.03,-32.04 454.82,-22.75"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="455.57,-26.17 464.28,-20.14 453.71,-19.42 455.57,-26.17"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M358.84,-54.8C387.92,-44.6 426.06,-31.24 452.74,-21.89"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="453.7,-25.26 461.98,-18.65 451.39,-18.65 453.7,-25.26"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -166,8 +166,8 @@
|
||||
<g id="Node000010" class="node">
|
||||
<title>Node10</title>
|
||||
<g id="a_Node000010"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="598.38,-19.25 555.38,-19.25 555.38,0 598.38,0 598.38,-19.25"/>
|
||||
<text text-anchor="middle" x="576.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="601.62,-19.25 524.12,-19.25 524.12,0 601.62,0 601.62,-19.25"/>
|
||||
<text text-anchor="middle" x="562.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_set</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -175,8 +175,26 @@
|
||||
<g id="edge9_Node000001_Node000010" class="edge">
|
||||
<title>Node1->Node10</title>
|
||||
<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M352,-58.35C402.55,-49.56 473.74,-36.35 544.15,-19.75"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="544.59,-23.24 553.51,-17.52 542.97,-16.43 544.59,-23.24"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M378.32,-54.8C420.15,-44.78 474.79,-31.71 513.74,-22.38"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="514.4,-25.82 523.31,-20.09 512.77,-19.02 514.4,-25.82"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node11 -->
|
||||
<g id="Node000011" class="node">
|
||||
<title>Node11</title>
|
||||
<g id="a_Node000011"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="662.38,-19.25 619.38,-19.25 619.38,0 662.38,0 662.38,-19.25"/>
|
||||
<text text-anchor="middle" x="640.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node11 -->
|
||||
<g id="edge10_Node000001_Node000011" class="edge">
|
||||
<title>Node1->Node11</title>
|
||||
<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M384.14,-60.17C441.43,-51.73 526.11,-38.1 607.98,-19.72"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="608.54,-23.19 617.52,-17.55 606.99,-16.36 608.54,-23.19"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 7.6 KiB After Width: | Height: | Size: 8.3 KiB |
@@ -124,7 +124,7 @@ Include dependency graph for power_of_two.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
|
||||
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft"> </td><td class="mdescRight">for IO operations <br /></td></tr>
|
||||
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft"> </td><td class="mdescRight">for assert <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
@@ -277,7 +277,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 93</span>}</div>
|
||||
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:76</div></div>
|
||||
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
|
||||
@@ -114,17 +114,18 @@ $(function(){initNavTree('d4/d48/hamming__distance_8cpp.html','../../'); initRes
|
||||
<p>Returns the <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> between two integers.
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <cstdint></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for hamming_distance.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d4b/hamming__distance_8cpp__incl.svg" width="183" 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="../../d6/d4b/hamming__distance_8cpp__incl.svg" width="255" 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>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
|
||||
<tr class="memdesc:d7/d81/namespacebit__manipulation"><td class="mdescLeft"> </td><td class="mdescRight">for IO operations <br /></td></tr>
|
||||
<tr class="memdesc:d7/d81/namespacebit__manipulation"><td class="mdescLeft"> </td><td class="mdescRight">for assert <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d1c/namespacehamming__distance.html">hamming_distance</a></td></tr>
|
||||
<tr class="memdesc:d4/d1c/namespacehamming__distance"><td class="mdescLeft"> </td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> implementation. <br /></td></tr>
|
||||
@@ -171,16 +172,16 @@ Functions</h2></td></tr>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>the number of set bits in the given number. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 34</span> {</div>
|
||||
<div class="line"><span class="lineno"> 35</span> uint64_t count = 0;</div>
|
||||
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">while</span> (value) { <span class="comment">// until all bits are zero</span></div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">if</span> (value & 1) { <span class="comment">// check lower bit</span></div>
|
||||
<div class="line"><span class="lineno"> 38</span> count++;</div>
|
||||
<div class="line"><span class="lineno"> 39</span> }</div>
|
||||
<div class="line"><span class="lineno"> 40</span> value >>= 1; <span class="comment">// shift bits, removing lower bit</span></div>
|
||||
<div class="line"><span class="lineno"> 41</span> }</div>
|
||||
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">return</span> count;</div>
|
||||
<div class="line"><span class="lineno"> 43</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 35</span> {</div>
|
||||
<div class="line"><span class="lineno"> 36</span> uint64_t count = 0;</div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">while</span> (value) { <span class="comment">// until all bits are zero</span></div>
|
||||
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">if</span> (value & 1) { <span class="comment">// check lower bit</span></div>
|
||||
<div class="line"><span class="lineno"> 39</span> count++;</div>
|
||||
<div class="line"><span class="lineno"> 40</span> }</div>
|
||||
<div class="line"><span class="lineno"> 41</span> value >>= 1; <span class="comment">// shift bits, removing lower bit</span></div>
|
||||
<div class="line"><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">return</span> count;</div>
|
||||
<div class="line"><span class="lineno"> 44</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -215,15 +216,15 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>the number of characters differing between the two strings. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
|
||||
<div class="line"><span class="lineno"> 60</span> assert(a.size() == b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keywordtype">size_t</span> n = a.size();</div>
|
||||
<div class="line"><span class="lineno"> 62</span> uint64_t count = 0;</div>
|
||||
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 64</span> count += (b[i] != a[i]);</div>
|
||||
<div class="line"><span class="lineno"> 65</span> }</div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">return</span> count;</div>
|
||||
<div class="line"><span class="lineno"> 67</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 60</span> {</div>
|
||||
<div class="line"><span class="lineno"> 61</span> assert(a.size() == b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
|
||||
<div class="line"><span class="lineno"> 62</span> <span class="keywordtype">size_t</span> n = a.size();</div>
|
||||
<div class="line"><span class="lineno"> 63</span> uint64_t count = 0;</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 65</span> count += (b[i] != a[i]);</div>
|
||||
<div class="line"><span class="lineno"> 66</span> }</div>
|
||||
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> count;</div>
|
||||
<div class="line"><span class="lineno"> 68</span>}</div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -259,8 +260,8 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>the number of bits differing between the two integers. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 51</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a65d845df3fecff7087a2126c7b72030b">bitCount</a>(a ^ b); }</div>
|
||||
<div class="ttc" id="ahamming__distance_8cpp_html_a65d845df3fecff7087a2126c7b72030b"><div class="ttname"><a href="#a65d845df3fecff7087a2126c7b72030b">bit_manipulation::hamming_distance::bitCount</a></div><div class="ttdeci">uint64_t bitCount(uint64_t value)</div><div class="ttdef"><b>Definition</b> hamming_distance.cpp:34</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 52</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a65d845df3fecff7087a2126c7b72030b">bitCount</a>(a ^ b); }</div>
|
||||
<div class="ttc" id="ahamming__distance_8cpp_html_a65d845df3fecff7087a2126c7b72030b"><div class="ttname"><a href="#a65d845df3fecff7087a2126c7b72030b">bit_manipulation::hamming_distance::bitCount</a></div><div class="ttdeci">uint64_t bitCount(uint64_t value)</div><div class="ttdef"><b>Definition</b> hamming_distance.cpp:35</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -286,19 +287,19 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 99</span> {</div>
|
||||
<div class="line"><span class="lineno"> 100</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
|
||||
<div class="line"><span class="lineno"> 101</span> uint64_t a = 11; <span class="comment">// 1011 in binary</span></div>
|
||||
<div class="line"><span class="lineno"> 102</span> uint64_t b = 2; <span class="comment">// 0010 in binary</span></div>
|
||||
<div class="line"><span class="lineno"> 103</span> </div>
|
||||
<div class="line"><span class="lineno"> 104</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Hamming distance between "</span> << a << <span class="stringliteral">" and "</span> << b << <span class="stringliteral">" is "</span></div>
|
||||
<div class="line"><span class="lineno"> 105</span> << <a class="code hl_function" href="#abfe6fbb2f3460a2623c96f283178a07a">bit_manipulation::hamming_distance::hamming_distance</a>(a, b)</div>
|
||||
<div class="line"><span class="lineno"> 106</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 107</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 100</span> {</div>
|
||||
<div class="line"><span class="lineno"> 101</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
|
||||
<div class="line"><span class="lineno"> 102</span> uint64_t a = 11; <span class="comment">// 1011 in binary</span></div>
|
||||
<div class="line"><span class="lineno"> 103</span> uint64_t b = 2; <span class="comment">// 0010 in binary</span></div>
|
||||
<div class="line"><span class="lineno"> 104</span> </div>
|
||||
<div class="line"><span class="lineno"> 105</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Hamming distance between "</span> << a << <span class="stringliteral">" and "</span> << b << <span class="stringliteral">" is "</span></div>
|
||||
<div class="line"><span class="lineno"> 106</span> << <a class="code hl_function" href="#abfe6fbb2f3460a2623c96f283178a07a">bit_manipulation::hamming_distance::hamming_distance</a>(a, b)</div>
|
||||
<div class="line"><span class="lineno"> 107</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 108</span>}</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="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
<div class="ttc" id="ahamming__distance_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to the test hamming distance.</div><div class="ttdef"><b>Definition</b> hamming_distance.cpp:75</div></div>
|
||||
<div class="ttc" id="ahamming__distance_8cpp_html_abfe6fbb2f3460a2623c96f283178a07a"><div class="ttname"><a href="#abfe6fbb2f3460a2623c96f283178a07a">bit_manipulation::hamming_distance::hamming_distance</a></div><div class="ttdeci">uint64_t hamming_distance(uint64_t a, uint64_t b)</div><div class="ttdef"><b>Definition</b> hamming_distance.cpp:51</div></div>
|
||||
<div class="ttc" id="ahamming__distance_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to the test hamming distance.</div><div class="ttdef"><b>Definition</b> hamming_distance.cpp:76</div></div>
|
||||
<div class="ttc" id="ahamming__distance_8cpp_html_abfe6fbb2f3460a2623c96f283178a07a"><div class="ttname"><a href="#abfe6fbb2f3460a2623c96f283178a07a">bit_manipulation::hamming_distance::hamming_distance</a></div><div class="ttdeci">uint64_t hamming_distance(uint64_t a, uint64_t b)</div><div class="ttdef"><b>Definition</b> hamming_distance.cpp:52</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -332,25 +333,25 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Function to the test hamming distance. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 75</span> {</div>
|
||||
<div class="line"><span class="lineno"> 76</span> assert(bit_manipulation::hamming_distance::hamming_distance(11, 2) == 2);</div>
|
||||
<div class="line"><span class="lineno"> 77</span> assert(bit_manipulation::hamming_distance::hamming_distance(2, 0) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 78</span> assert(bit_manipulation::hamming_distance::hamming_distance(11, 0) == 3);</div>
|
||||
<div class="line"><span class="lineno"> 79</span> </div>
|
||||
<div class="line"><span class="lineno"> 80</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"1101"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 81</span> <span class="stringliteral">"1111"</span>) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 82</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"1111"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <span class="stringliteral">"1111"</span>) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 84</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"0000"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 85</span> <span class="stringliteral">"1111"</span>) == 4);</div>
|
||||
<div class="line"><span class="lineno"> 86</span> </div>
|
||||
<div class="line"><span class="lineno"> 87</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"alpha"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 88</span> <span class="stringliteral">"alphb"</span>) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 89</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"abcd"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 90</span> <span class="stringliteral">"abcd"</span>) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 91</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"dcba"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 92</span> <span class="stringliteral">"abcd"</span>) == 4);</div>
|
||||
<div class="line"><span class="lineno"> 93</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 76</span> {</div>
|
||||
<div class="line"><span class="lineno"> 77</span> assert(bit_manipulation::hamming_distance::hamming_distance(11, 2) == 2);</div>
|
||||
<div class="line"><span class="lineno"> 78</span> assert(bit_manipulation::hamming_distance::hamming_distance(2, 0) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 79</span> assert(bit_manipulation::hamming_distance::hamming_distance(11, 0) == 3);</div>
|
||||
<div class="line"><span class="lineno"> 80</span> </div>
|
||||
<div class="line"><span class="lineno"> 81</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"1101"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 82</span> <span class="stringliteral">"1111"</span>) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 83</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"1111"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 84</span> <span class="stringliteral">"1111"</span>) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 85</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"0000"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 86</span> <span class="stringliteral">"1111"</span>) == 4);</div>
|
||||
<div class="line"><span class="lineno"> 87</span> </div>
|
||||
<div class="line"><span class="lineno"> 88</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"alpha"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 89</span> <span class="stringliteral">"alphb"</span>) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 90</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"abcd"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 91</span> <span class="stringliteral">"abcd"</span>) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 92</span> assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">"dcba"</span>,</div>
|
||||
<div class="line"><span class="lineno"> 93</span> <span class="stringliteral">"abcd"</span>) == 4);</div>
|
||||
<div class="line"><span class="lineno"> 94</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
@@ -133,7 +133,7 @@ Classes</h2></td></tr>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d5f/namespacegeometry.html">geometry</a></td></tr>
|
||||
<tr class="memdesc:d5/d5f/namespacegeometry"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="memdesc:d5/d5f/namespacegeometry"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da7/namespacejarvis.html">jarvis</a></td></tr>
|
||||
<tr class="memdesc:d5/da7/namespacejarvis"><td class="mdescLeft"> </td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm. <br /></td></tr>
|
||||
|
||||
@@ -115,19 +115,20 @@ $(function(){initNavTree('d4/d8f/travelling__salesman__using__bit__manipulation_
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <algorithm></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
<code>#include <cstdint></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <limits></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for travelling_salesman_using_bit_manipulation.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl.svg" width="426" 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="../../df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl.svg" width="510" 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>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
|
||||
<tr class="memdesc:d7/d81/namespacebit__manipulation"><td class="mdescLeft"> </td><td class="mdescRight">for IO operations <br /></td></tr>
|
||||
<tr class="memdesc:d7/d81/namespacebit__manipulation"><td class="mdescLeft"> </td><td class="mdescRight">for assert <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d3f/namespacetravelling_salesman__bitmanipulation.html">travellingSalesman_bitmanipulation</a></td></tr>
|
||||
<tr class="memdesc:d7/d3f/namespacetravelling_salesman__bitmanipulation"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/" target="_blank">Travelling Salesman Bitmask</a> implementation. <br /></td></tr>
|
||||
@@ -169,11 +170,11 @@ Functions</h2></td></tr>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 138</span> {</div>
|
||||
<div class="line"><span class="lineno"> 139</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 140</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 141</span>}</div>
|
||||
<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> travelling_salesman_using_bit_manipulation.cpp:99</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 139</span> {</div>
|
||||
<div class="line"><span class="lineno"> 140</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 142</span>}</div>
|
||||
<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> travelling_salesman_using_bit_manipulation.cpp:100</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -207,44 +208,44 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Self-test implementations. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 99</span> {</div>
|
||||
<div class="line"><span class="lineno"> 100</span> <span class="comment">// 1st test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 101</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dist = {</div>
|
||||
<div class="line"><span class="lineno"> 102</span> {0, 20, 42, 35}, {20, 0, 30, 34}, {42, 30, 0, 12}, {35, 34, 12, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 103</span> uint32_t V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 104</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(1 << V, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 105</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
||||
<div class="line"><span class="lineno"> 106</span> <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>) ==</div>
|
||||
<div class="line"><span class="lineno"> 107</span> 97);</div>
|
||||
<div class="line"><span class="lineno"> 108</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test-case: passed!"</span></div>
|
||||
<div class="line"><span class="lineno"> 109</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 110</span> </div>
|
||||
<div class="line"><span class="lineno"> 111</span> <span class="comment">// 2nd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 112</span> dist = {{0, 5, 10, 15}, {5, 0, 20, 30}, {10, 20, 0, 35}, {15, 30, 35, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 113</span> V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 114</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dp1(1 << V,</div>
|
||||
<div class="line"><span class="lineno"> 115</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 116</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
||||
<div class="line"><span class="lineno"> 117</span> <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, dp1) ==</div>
|
||||
<div class="line"><span class="lineno"> 118</span> 75);</div>
|
||||
<div class="line"><span class="lineno"> 119</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test-case: passed!"</span></div>
|
||||
<div class="line"><span class="lineno"> 120</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 121</span> <span class="comment">// 3rd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 122</span> dist = {{0, 10, 15, 20}, {10, 0, 35, 25}, {15, 35, 0, 30}, {20, 25, 30, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 123</span> V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dp2(1 << V,</div>
|
||||
<div class="line"><span class="lineno"> 125</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 126</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
||||
<div class="line"><span class="lineno"> 127</span> <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, dp2) ==</div>
|
||||
<div class="line"><span class="lineno"> 128</span> 80);</div>
|
||||
<div class="line"><span class="lineno"> 129</span> </div>
|
||||
<div class="line"><span class="lineno"> 130</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"3rd test-case: passed!"</span></div>
|
||||
<div class="line"><span class="lineno"> 131</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 132</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 100</span> {</div>
|
||||
<div class="line"><span class="lineno"> 101</span> <span class="comment">// 1st test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 102</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dist = {</div>
|
||||
<div class="line"><span class="lineno"> 103</span> {0, 20, 42, 35}, {20, 0, 30, 34}, {42, 30, 0, 12}, {35, 34, 12, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 104</span> uint32_t V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 105</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(1 << V, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 106</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
||||
<div class="line"><span class="lineno"> 107</span> <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>) ==</div>
|
||||
<div class="line"><span class="lineno"> 108</span> 97);</div>
|
||||
<div class="line"><span class="lineno"> 109</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test-case: passed!"</span></div>
|
||||
<div class="line"><span class="lineno"> 110</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 111</span> </div>
|
||||
<div class="line"><span class="lineno"> 112</span> <span class="comment">// 2nd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 113</span> dist = {{0, 5, 10, 15}, {5, 0, 20, 30}, {10, 20, 0, 35}, {15, 30, 35, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 114</span> V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 115</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dp1(1 << V,</div>
|
||||
<div class="line"><span class="lineno"> 116</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 117</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
||||
<div class="line"><span class="lineno"> 118</span> <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, dp1) ==</div>
|
||||
<div class="line"><span class="lineno"> 119</span> 75);</div>
|
||||
<div class="line"><span class="lineno"> 120</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test-case: passed!"</span></div>
|
||||
<div class="line"><span class="lineno"> 121</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 122</span> <span class="comment">// 3rd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 123</span> dist = {{0, 10, 15, 20}, {10, 0, 35, 25}, {15, 35, 0, 30}, {20, 25, 30, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 124</span> V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 125</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dp2(1 << V,</div>
|
||||
<div class="line"><span class="lineno"> 126</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 127</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
||||
<div class="line"><span class="lineno"> 128</span> <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, dp2) ==</div>
|
||||
<div class="line"><span class="lineno"> 129</span> 80);</div>
|
||||
<div class="line"><span class="lineno"> 130</span> </div>
|
||||
<div class="line"><span class="lineno"> 131</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"3rd test-case: passed!"</span></div>
|
||||
<div class="line"><span class="lineno"> 132</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 133</span>}</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="anamespacedp_html"><div class="ttname"><a href="../../df/d88/namespacedp.html">dp</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> partition_problem.cpp:39</div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_ad08f082be02c3437c2fe89cb035fcee1"><div class="ttname"><a href="#ad08f082be02c3437c2fe89cb035fcee1">bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation</a></div><div class="ttdeci">std::uint64_t travelling_salesman_using_bit_manipulation(std::vector< std::vector< uint32_t > > dist, std::uint64_t setOfCities, std::uint64_t city, std::uint64_t n, std::vector< std::vector< uint32_t > > &dp)</div><div class="ttdoc">The function implements travellingSalesman using bitmanipulation.</div><div class="ttdef"><b>Definition</b> travelling_salesman_using_bit_manipulation.cpp:52</div></div>
|
||||
<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_ad08f082be02c3437c2fe89cb035fcee1"><div class="ttname"><a href="#ad08f082be02c3437c2fe89cb035fcee1">bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation</a></div><div class="ttdeci">std::uint64_t travelling_salesman_using_bit_manipulation(std::vector< std::vector< uint32_t > > dist, std::uint64_t setOfCities, std::uint64_t city, std::uint64_t n, std::vector< std::vector< uint32_t > > &dp)</div><div class="ttdoc">The function implements travellingSalesman using bitmanipulation.</div><div class="ttdef"><b>Definition</b> travelling_salesman_using_bit_manipulation.cpp:53</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -300,34 +301,34 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>minimum cost of traversing whole nodes/cities from starting point back to starting point </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 64</span>{</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="comment">// base case;</span></div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">if</span> (setOfCities == (1 << n) - 1) { <span class="comment">// we have covered all the cities</span></div>
|
||||
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> dist[city][0]; <span class="comment">// return the cost from the current city to the</span></div>
|
||||
<div class="line"><span class="lineno"> 68</span> <span class="comment">// original city.</span></div>
|
||||
<div class="line"><span class="lineno"> 69</span> }</div>
|
||||
<div class="line"><span class="lineno"> 70</span> </div>
|
||||
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] != -1) {</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city];</div>
|
||||
<div class="line"><span class="lineno"> 73</span> }</div>
|
||||
<div class="line"><span class="lineno"> 74</span> <span class="comment">// otherwise try all possible options</span></div>
|
||||
<div class="line"><span class="lineno"> 75</span> uint64_t ans = 2147483647;</div>
|
||||
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> choice = 0; choice < n; choice++) {</div>
|
||||
<div class="line"><span class="lineno"> 77</span> <span class="comment">// check if the city is visited or not.</span></div>
|
||||
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">if</span> ((setOfCities & (1 << choice)) ==</div>
|
||||
<div class="line"><span class="lineno"> 79</span> 0) { <span class="comment">// this means that this perticular city is not visited.</span></div>
|
||||
<div class="line"><span class="lineno"> 80</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> subProb =</div>
|
||||
<div class="line"><span class="lineno"> 81</span> dist[city][choice] +</div>
|
||||
<div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(</div>
|
||||
<div class="line"><span class="lineno"> 83</span> dist, setOfCities | (1 << choice), choice, n, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
|
||||
<div class="line"><span class="lineno"> 84</span> <span class="comment">// Here we are doing a recursive call to tsp with the updated set of</span></div>
|
||||
<div class="line"><span class="lineno"> 85</span> <span class="comment">// city/node and choice which tells that where we are currently.</span></div>
|
||||
<div class="line"><span class="lineno"> 86</span> ans = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(ans, subProb);</div>
|
||||
<div class="line"><span class="lineno"> 87</span> }</div>
|
||||
<div class="line"><span class="lineno"> 88</span> }</div>
|
||||
<div class="line"><span class="lineno"> 89</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] = ans;</div>
|
||||
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">return</span> ans;</div>
|
||||
<div class="line"><span class="lineno"> 91</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 65</span>{</div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="comment">// base case;</span></div>
|
||||
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">if</span> (setOfCities == (1 << n) - 1) { <span class="comment">// we have covered all the cities</span></div>
|
||||
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">return</span> dist[city][0]; <span class="comment">// return the cost from the current city to the</span></div>
|
||||
<div class="line"><span class="lineno"> 69</span> <span class="comment">// original city.</span></div>
|
||||
<div class="line"><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><span class="lineno"> 71</span> </div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] != -1) {</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city];</div>
|
||||
<div class="line"><span class="lineno"> 74</span> }</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <span class="comment">// otherwise try all possible options</span></div>
|
||||
<div class="line"><span class="lineno"> 76</span> uint64_t ans = 2147483647;</div>
|
||||
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> choice = 0; choice < n; choice++) {</div>
|
||||
<div class="line"><span class="lineno"> 78</span> <span class="comment">// check if the city is visited or not.</span></div>
|
||||
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">if</span> ((setOfCities & (1 << choice)) ==</div>
|
||||
<div class="line"><span class="lineno"> 80</span> 0) { <span class="comment">// this means that this perticular city is not visited.</span></div>
|
||||
<div class="line"><span class="lineno"> 81</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> subProb =</div>
|
||||
<div class="line"><span class="lineno"> 82</span> dist[city][choice] +</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(</div>
|
||||
<div class="line"><span class="lineno"> 84</span> dist, setOfCities | (1 << choice), choice, n, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
|
||||
<div class="line"><span class="lineno"> 85</span> <span class="comment">// Here we are doing a recursive call to tsp with the updated set of</span></div>
|
||||
<div class="line"><span class="lineno"> 86</span> <span class="comment">// city/node and choice which tells that where we are currently.</span></div>
|
||||
<div class="line"><span class="lineno"> 87</span> ans = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(ans, subProb);</div>
|
||||
<div class="line"><span class="lineno"> 88</span> }</div>
|
||||
<div class="line"><span class="lineno"> 89</span> }</div>
|
||||
<div class="line"><span class="lineno"> 90</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] = ans;</div>
|
||||
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">return</span> ans;</div>
|
||||
<div class="line"><span class="lineno"> 92</span>}</div>
|
||||
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a></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><!-- fragment --><div class="dynheader">
|
||||
|
||||
@@ -114,17 +114,18 @@ $(function(){initNavTree('d4/d9d/sum__of__binomial__coefficient_8cpp.html','../.
|
||||
<p>Algorithm to find sum of binomial coefficients of a given positive integer.
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <cstdint></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for sum_of_binomial_coefficient.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d59/sum__of__binomial__coefficient_8cpp__incl.svg" width="171" 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="../../de/d59/sum__of__binomial__coefficient_8cpp__incl.svg" width="255" 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>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
|
||||
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft"> </td><td class="mdescRight">for IO operations <br /></td></tr>
|
||||
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft"> </td><td class="mdescRight">for assert <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
@@ -159,11 +160,11 @@ Functions</h2></td></tr>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 63</span> {</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 66</span>}</div>
|
||||
<div class="ttc" id="asum__of__binomial__coefficient_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> sum_of_binomial_coefficient.cpp:37</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 64</span> {</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 67</span>}</div>
|
||||
<div class="ttc" id="asum__of__binomial__coefficient_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> sum_of_binomial_coefficient.cpp:38</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -195,30 +196,30 @@ Here is the call graph for this function:</div>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Function for testing binomialCoeffSum function. test cases and assert statement. </p><dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 37</span> {</div>
|
||||
<div class="line"><span class="lineno"> 38</span> <span class="keywordtype">int</span> test_case_1 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(2);</div>
|
||||
<div class="line"><span class="lineno"> 39</span> assert(test_case_1 == 4);</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test_case_1 Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 41</span> </div>
|
||||
<div class="line"><span class="lineno"> 42</span> <span class="keywordtype">int</span> test_case_2 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(3);</div>
|
||||
<div class="line"><span class="lineno"> 43</span> assert(test_case_2 == 8);</div>
|
||||
<div class="line"><span class="lineno"> 44</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test_case_2 Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 45</span> </div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordtype">int</span> test_case_3 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(4);</div>
|
||||
<div class="line"><span class="lineno"> 47</span> assert(test_case_3 == 16);</div>
|
||||
<div class="line"><span class="lineno"> 48</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test_case_3 Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 49</span> </div>
|
||||
<div class="line"><span class="lineno"> 50</span> <span class="keywordtype">int</span> test_case_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(5);</div>
|
||||
<div class="line"><span class="lineno"> 51</span> assert(test_case_4 == 32);</div>
|
||||
<div class="line"><span class="lineno"> 52</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test_case_4 Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 53</span> </div>
|
||||
<div class="line"><span class="lineno"> 54</span> <span class="keywordtype">int</span> test_case_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(7);</div>
|
||||
<div class="line"><span class="lineno"> 55</span> assert(test_case_5 == 128);</div>
|
||||
<div class="line"><span class="lineno"> 56</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test_case_5 Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 57</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 38</span> {</div>
|
||||
<div class="line"><span class="lineno"> 39</span> <span class="keywordtype">int</span> test_case_1 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(2);</div>
|
||||
<div class="line"><span class="lineno"> 40</span> assert(test_case_1 == 4);</div>
|
||||
<div class="line"><span class="lineno"> 41</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test_case_1 Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 42</span> </div>
|
||||
<div class="line"><span class="lineno"> 43</span> <span class="keywordtype">int</span> test_case_2 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(3);</div>
|
||||
<div class="line"><span class="lineno"> 44</span> assert(test_case_2 == 8);</div>
|
||||
<div class="line"><span class="lineno"> 45</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test_case_2 Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 46</span> </div>
|
||||
<div class="line"><span class="lineno"> 47</span> <span class="keywordtype">int</span> test_case_3 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(4);</div>
|
||||
<div class="line"><span class="lineno"> 48</span> assert(test_case_3 == 16);</div>
|
||||
<div class="line"><span class="lineno"> 49</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test_case_3 Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 50</span> </div>
|
||||
<div class="line"><span class="lineno"> 51</span> <span class="keywordtype">int</span> test_case_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(5);</div>
|
||||
<div class="line"><span class="lineno"> 52</span> assert(test_case_4 == 32);</div>
|
||||
<div class="line"><span class="lineno"> 53</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test_case_4 Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 54</span> </div>
|
||||
<div class="line"><span class="lineno"> 55</span> <span class="keywordtype">int</span> test_case_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(7);</div>
|
||||
<div class="line"><span class="lineno"> 56</span> assert(test_case_5 == 128);</div>
|
||||
<div class="line"><span class="lineno"> 57</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test_case_5 Passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 58</span>}</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="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacemath_html_ae1ca505751f5a6d3977b86372cfe75ea"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a></div><div class="ttdeci">uint64_t binomialCoeffSum(uint64_t n)</div><div class="ttdef"><b>Definition</b> sum_of_binomial_coefficient.cpp:26</div></div>
|
||||
<div class="ttc" id="anamespacemath_html_ae1ca505751f5a6d3977b86372cfe75ea"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a></div><div class="ttdeci">uint64_t binomialCoeffSum(uint64_t n)</div><div class="ttdef"><b>Definition</b> sum_of_binomial_coefficient.cpp:27</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
|
||||
@@ -115,12 +115,13 @@ $(function(){initNavTree('d4/d9f/selection__sort__recursive_8cpp.html','../../')
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <algorithm></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
<code>#include <cstdint></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for selection_sort_recursive.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d44/selection__sort__recursive_8cpp__incl.svg" width="350" 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="../../d5/d44/selection__sort__recursive_8cpp__incl.svg" width="434" 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>
|
||||
@@ -193,17 +194,17 @@ template<typename T > </div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>index of the minimum element </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 56</span> {</div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">if</span> (current_position + 1 == in_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">return</span> current_position;</div>
|
||||
<div class="line"><span class="lineno"> 59</span> }</div>
|
||||
<div class="line"><span class="lineno"> 60</span> uint64_t answer = <a class="code hl_function" href="#a5454eeb691725ccac0f59df1e133f834">findMinIndex</a>(in_arr, current_position + 1);</div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">if</span> (in_arr[current_position] < in_arr[answer]) {</div>
|
||||
<div class="line"><span class="lineno"> 62</span> answer = current_position;</div>
|
||||
<div class="line"><span class="lineno"> 63</span> }</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">return</span> answer;</div>
|
||||
<div class="line"><span class="lineno"> 65</span>}</div>
|
||||
<div class="ttc" id="aselection__sort__recursive_8cpp_html_a5454eeb691725ccac0f59df1e133f834"><div class="ttname"><a href="#a5454eeb691725ccac0f59df1e133f834">sorting::selection_sort_recursive::findMinIndex</a></div><div class="ttdeci">uint64_t findMinIndex(const std::vector< T > &in_arr, uint64_t current_position=0)</div><div class="ttdoc">The main function finds the index of the minimum element.</div><div class="ttdef"><b>Definition</b> selection_sort_recursive.cpp:55</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 57</span> {</div>
|
||||
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">if</span> (current_position + 1 == in_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">return</span> current_position;</div>
|
||||
<div class="line"><span class="lineno"> 60</span> }</div>
|
||||
<div class="line"><span class="lineno"> 61</span> uint64_t answer = <a class="code hl_function" href="#a5454eeb691725ccac0f59df1e133f834">findMinIndex</a>(in_arr, current_position + 1);</div>
|
||||
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">if</span> (in_arr[current_position] < in_arr[answer]) {</div>
|
||||
<div class="line"><span class="lineno"> 63</span> answer = current_position;</div>
|
||||
<div class="line"><span class="lineno"> 64</span> }</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">return</span> answer;</div>
|
||||
<div class="line"><span class="lineno"> 66</span>}</div>
|
||||
<div class="ttc" id="aselection__sort__recursive_8cpp_html_a5454eeb691725ccac0f59df1e133f834"><div class="ttname"><a href="#a5454eeb691725ccac0f59df1e133f834">sorting::selection_sort_recursive::findMinIndex</a></div><div class="ttdeci">uint64_t findMinIndex(const std::vector< T > &in_arr, uint64_t current_position=0)</div><div class="ttdoc">The main function finds the index of the minimum element.</div><div class="ttdef"><b>Definition</b> selection_sort_recursive.cpp:56</div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -230,11 +231,11 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 129</span> {</div>
|
||||
<div class="line"><span class="lineno"> 130</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 132</span>}</div>
|
||||
<div class="ttc" id="aselection__sort__recursive_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> selection_sort_recursive.cpp:94</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 130</span> {</div>
|
||||
<div class="line"><span class="lineno"> 131</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 133</span>}</div>
|
||||
<div class="ttc" id="aselection__sort__recursive_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> selection_sort_recursive.cpp:95</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -279,18 +280,18 @@ template<typename T > </div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 76</span> {</div>
|
||||
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">if</span> (current_position == in_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 79</span> }</div>
|
||||
<div class="line"><span class="lineno"> 80</span> uint64_t min_element_idx =</div>
|
||||
<div class="line"><span class="lineno"> 81</span> selection_sort_recursive::findMinIndex(in_arr, current_position);</div>
|
||||
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">if</span> (min_element_idx != current_position) {</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(in_arr[min_element_idx], in_arr[current_position]);</div>
|
||||
<div class="line"><span class="lineno"> 84</span> }</div>
|
||||
<div class="line"><span class="lineno"> 85</span> <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">selectionSortRecursive</a>(in_arr, current_position + 1);</div>
|
||||
<div class="line"><span class="lineno"> 86</span>}</div>
|
||||
<div class="ttc" id="aselection__sort__recursive_8cpp_html_ab6f7b33a070e376e1f4374e534435e89"><div class="ttname"><a href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a></div><div class="ttdeci">void selectionSortRecursive(std::vector< T > &in_arr, uint64_t current_position=0)</div><div class="ttdoc">The main function implements Selection sort.</div><div class="ttdef"><b>Definition</b> selection_sort_recursive.cpp:75</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 77</span> {</div>
|
||||
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">if</span> (current_position == in_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 80</span> }</div>
|
||||
<div class="line"><span class="lineno"> 81</span> uint64_t min_element_idx =</div>
|
||||
<div class="line"><span class="lineno"> 82</span> selection_sort_recursive::findMinIndex(in_arr, current_position);</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">if</span> (min_element_idx != current_position) {</div>
|
||||
<div class="line"><span class="lineno"> 84</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(in_arr[min_element_idx], in_arr[current_position]);</div>
|
||||
<div class="line"><span class="lineno"> 85</span> }</div>
|
||||
<div class="line"><span class="lineno"> 86</span> <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">selectionSortRecursive</a>(in_arr, current_position + 1);</div>
|
||||
<div class="line"><span class="lineno"> 87</span>}</div>
|
||||
<div class="ttc" id="aselection__sort__recursive_8cpp_html_ab6f7b33a070e376e1f4374e534435e89"><div class="ttname"><a href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a></div><div class="ttdeci">void selectionSortRecursive(std::vector< T > &in_arr, uint64_t current_position=0)</div><div class="ttdoc">The main function implements Selection sort.</div><div class="ttdef"><b>Definition</b> selection_sort_recursive.cpp:76</div></div>
|
||||
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -325,36 +326,36 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Self-test implementations. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 94</span> {</div>
|
||||
<div class="line"><span class="lineno"> 95</span> <span class="comment">// 1st test</span></div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="comment">// [1, 0, 2, 1] return [0, 1, 1, 2]</span></div>
|
||||
<div class="line"><span class="lineno"> 97</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> array1 = {0, 1, 1, 2};</div>
|
||||
<div class="line"><span class="lineno"> 98</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test... "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array1);</div>
|
||||
<div class="line"><span class="lineno"> 100</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array1), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array1)));</div>
|
||||
<div class="line"><span class="lineno"> 101</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 102</span> <span class="comment">// 2nd test</span></div>
|
||||
<div class="line"><span class="lineno"> 103</span> <span class="comment">// [1, 0, 0, 1, 1, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2]</span></div>
|
||||
<div class="line"><span class="lineno"> 104</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> array2 = {1, 0, 0, 1, 1, 0, 2, 1};</div>
|
||||
<div class="line"><span class="lineno"> 105</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test... "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 106</span> <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array2);</div>
|
||||
<div class="line"><span class="lineno"> 107</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array2), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array2)));</div>
|
||||
<div class="line"><span class="lineno"> 108</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 109</span> <span class="comment">// 3rd test</span></div>
|
||||
<div class="line"><span class="lineno"> 110</span> <span class="comment">// [1, 1, 0, 0, 1, 2, 2, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2, 2, 2]</span></div>
|
||||
<div class="line"><span class="lineno"> 111</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> array3 = {1, 1, 0, 0, 1, 2, 2, 0, 2, 1};</div>
|
||||
<div class="line"><span class="lineno"> 112</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"3rd test... "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 113</span> <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array3);</div>
|
||||
<div class="line"><span class="lineno"> 114</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array3), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array3)));</div>
|
||||
<div class="line"><span class="lineno"> 115</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 116</span> <span class="comment">// 4th test</span></div>
|
||||
<div class="line"><span class="lineno"> 117</span> <span class="comment">// [2, 2, 2, 0, 0, 1, 1] return [0, 0, 1, 1, 2, 2, 2]</span></div>
|
||||
<div class="line"><span class="lineno"> 118</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> array4 = {2, 2, 2, 0, 0, 1, 1};</div>
|
||||
<div class="line"><span class="lineno"> 119</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"4th test... "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 120</span> <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array4);</div>
|
||||
<div class="line"><span class="lineno"> 121</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array4), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array4)));</div>
|
||||
<div class="line"><span class="lineno"> 122</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 123</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 95</span> {</div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="comment">// 1st test</span></div>
|
||||
<div class="line"><span class="lineno"> 97</span> <span class="comment">// [1, 0, 2, 1] return [0, 1, 1, 2]</span></div>
|
||||
<div class="line"><span class="lineno"> 98</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> array1 = {0, 1, 1, 2};</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test... "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 100</span> <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array1);</div>
|
||||
<div class="line"><span class="lineno"> 101</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array1), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array1)));</div>
|
||||
<div class="line"><span class="lineno"> 102</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 103</span> <span class="comment">// 2nd test</span></div>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="comment">// [1, 0, 0, 1, 1, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2]</span></div>
|
||||
<div class="line"><span class="lineno"> 105</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> array2 = {1, 0, 0, 1, 1, 0, 2, 1};</div>
|
||||
<div class="line"><span class="lineno"> 106</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test... "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 107</span> <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array2);</div>
|
||||
<div class="line"><span class="lineno"> 108</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array2), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array2)));</div>
|
||||
<div class="line"><span class="lineno"> 109</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 110</span> <span class="comment">// 3rd test</span></div>
|
||||
<div class="line"><span class="lineno"> 111</span> <span class="comment">// [1, 1, 0, 0, 1, 2, 2, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2, 2, 2]</span></div>
|
||||
<div class="line"><span class="lineno"> 112</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> array3 = {1, 1, 0, 0, 1, 2, 2, 0, 2, 1};</div>
|
||||
<div class="line"><span class="lineno"> 113</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"3rd test... "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 114</span> <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array3);</div>
|
||||
<div class="line"><span class="lineno"> 115</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array3), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array3)));</div>
|
||||
<div class="line"><span class="lineno"> 116</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 117</span> <span class="comment">// 4th test</span></div>
|
||||
<div class="line"><span class="lineno"> 118</span> <span class="comment">// [2, 2, 2, 0, 0, 1, 1] return [0, 0, 1, 1, 2, 2, 2]</span></div>
|
||||
<div class="line"><span class="lineno"> 119</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> array4 = {2, 2, 2, 0, 0, 1, 1};</div>
|
||||
<div class="line"><span class="lineno"> 120</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"4th test... "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 121</span> <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array4);</div>
|
||||
<div class="line"><span class="lineno"> 122</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array4), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array4)));</div>
|
||||
<div class="line"><span class="lineno"> 123</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"passed"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 124</span>}</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
|
||||
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
|
||||
|
||||
@@ -239,7 +239,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 217</span>}</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="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &first, const std::string &second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:37</div></div>
|
||||
<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &first, const std::string &second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:38</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -459,7 +459,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 96</span> } <span class="keywordflow">while</span> (entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> != notPresent);</div>
|
||||
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">return</span> notPresent;</div>
|
||||
<div class="line"><span class="lineno"> 98</span>}</div>
|
||||
<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> md5.cpp:287</div></div>
|
||||
<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> md5.cpp:288</div></div>
|
||||
<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &entry, int key)</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:120</div></div>
|
||||
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
|
||||
<div class="ttc" id="around_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a></div><div class="ttdeci">T round(T... args)</div></div>
|
||||
|
||||
@@ -335,7 +335,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 399</span> save_u_matrix(<span class="stringliteral">"w12.csv"</span>, W); <span class="comment">// save the resultant weights</span></div>
|
||||
<div class="line"><span class="lineno"> 400</span>}</div>
|
||||
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
|
||||
<div class="ttc" id="adata__structures_2sparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:47</div></div>
|
||||
<div class="ttc" id="adata__structures_2sparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
|
||||
<div class="ttc" id="agroup__machine__learning_html_gabc90175770bf0d5853c466e14993a08c"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, const std::vector< std::valarray< double > > &X)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:65</div></div>
|
||||
<div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:53</div></div>
|
||||
<div class="ttc" id="akohonen__som__topology_8cpp_html_a48efb079040c7aaa3a4917a0e486cba9"><div class="ttname"><a href="#a48efb079040c7aaa3a4917a0e486cba9">test_2d_classes</a></div><div class="ttdeci">void test_2d_classes(std::vector< std::valarray< double > > *data)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:330</div></div>
|
||||
|
||||
Reference in New Issue
Block a user