backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 14:23:03 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 0d766b0f8a

Browse Source
This commit is contained in:
realstealthninja
2024-11-04 12:32:06 +00:00
parent fb1d00ead7
commit 4fb6e622e9
280 changed files with 2978 additions and 4001 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
df/d11/midpoint__integral__method_8cpp.html
View File

@@ -332,7 +332,7 @@ Here is the call graph for this function:</div>
<p>the real axis</p>
<p>Step, calculated by a, b and N</p>
<div class="fragment"><div class="line"><span class="lineno"> 162</span> {</div>
<div class="line"><span class="lineno"> 163</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> =</div>
<div class="line"><span class="lineno"> 163</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> =</div>
<div class="line"><span class="lineno"> 164</span> 16; <span class="comment">/// Number of intervals to divide the integration interval.</span><span class="comment"></span></div>
<div class="line"><span class="lineno"> 165</span><span class="comment"> /// MUST BE EVEN</span></div>
<div class="line"><span class="lineno"> 166</span><span class="comment"></span> <span class="keywordtype">double</span> a = 1, b = 3; <span class="comment">/// Starting and ending point of the integration in</span><span class="comment"></span></div>
@@ -346,7 +346,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 174</span> <span class="comment">// Get user input (by the command line parameters or the console after</span></div>
<div class="line"><span class="lineno"> 175</span> <span class="comment">// displaying messages)</span></div>
<div class="line"><span class="lineno"> 176</span> <span class="keywordflow">if</span> (argc == 4) {</div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a>(argv[1]);</div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a>(argv[1]);</div>
<div class="line"><span class="lineno"> 178</span> a = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[2]);</div>
<div class="line"><span class="lineno"> 179</span> b = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[3]);</div>
<div class="line"><span class="lineno"> 180</span> <span class="comment">// Check if a&lt;b else abort</span></div>
@@ -355,10 +355,10 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 183</span> <span class="keywordflow">if</span> (N &lt; 4 || a != 1 || b != 3) {</div>
<div class="line"><span class="lineno"> 184</span> used_argv_parameters = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 185</span> }</div>
<div class="line"><span class="lineno"> 186</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;You selected N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
<div class="line"><span class="lineno"> 186</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;You selected N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
<div class="line"><span class="lineno"> 187</span> &lt;&lt; <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"> 188</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 189</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Default N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
<div class="line"><span class="lineno"> 189</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Default N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
<div class="line"><span class="lineno"> 190</span> &lt;&lt; <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"> 191</span> }</div>
<div class="line"><span class="lineno"> 192</span> </div>
@@ -372,11 +372,11 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aatof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a></div><div class="ttdeci">T atof(T... args)</div></div>
<div class="ttc" id="aatoi_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a></div><div class="ttdeci">T atoi(T... args)</div></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="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="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="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> generate_parentheses.cpp:82</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="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a></div></div>
<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__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><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -433,7 +433,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 58</span> <span class="comment">// Create the data table</span></div>
<div class="line"><span class="lineno"> 59</span> <span class="comment">// Loop from x0 to xN-1</span></div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordtype">double</span> temp = NAN;</div>
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt; <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
<div class="line"><span class="lineno"> 62</span> temp = func(xi + <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> / 2); <span class="comment">// find f(xi+h/2)</span></div>
<div class="line"><span class="lineno"> 63</span> data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(</div>
<div class="line"><span class="lineno"> 64</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;std::int32_t, double&gt;</a>(i, temp)); <span class="comment">// add i and f(xi)</span></div>
@@ -443,7 +443,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 68</span> <span class="comment">// Evaluate the integral.</span></div>
<div class="line"><span class="lineno"> 69</span> <span class="comment">// Remember: {f(x0+h/2) + f(x1+h/2) + ... + f(xN-1+h/2)}</span></div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordtype">double</span> evaluate_integral = 0;</div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt; <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) evaluate_integral += data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) evaluate_integral += data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div>
<div class="line"><span class="lineno"> 72</span> </div>
<div class="line"><span class="lineno"> 73</span> <span class="comment">// Multiply by the coefficient h</span></div>
<div class="line"><span class="lineno"> 74</span> evaluate_integral *= <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;</div>

11
df/d1f/subset__sum__dynamic_8cpp__incl.map Normal file
View File

@@ -0,0 +1,11 @@
<map id="dynamic_programming/subset_sum_dynamic.cpp" name="dynamic_programming/subset_sum_dynamic.cpp">
<area shape="rect" id="Node000001" title="Implements [Sub&#45;set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm,..." alt="" coords="98,5,276,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,70,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,49,75,89,72,84,148,44"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="94,94,165,120"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="175,48,150,83,145,79,171,45"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="189,94,299,120"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="203,45,228,79,224,83,199,48"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="324,94,381,120"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="229,44,314,85,312,89,227,49"/>
</map>

1
df/d1f/subset__sum__dynamic_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
724e895b7e1fb10729c324df1c617bf5

48
df/d88/data__structures_2sparse__table_8cpp__incl.svg → df/d1f/subset__sum__dynamic_8cpp__incl.svg
View File

@@ -3,9 +3,9 @@
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: data_structures/sparse_table.cpp Pages: 1 -->
<svg width="247pt" height="94pt"
viewBox="0.00 0.00 246.62 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<!-- Title: dynamic_programming/subset_sum_dynamic.cpp Pages: 1 -->
<svg width="290pt" height="94pt"
viewBox="0.00 0.00 289.62 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
@@ -18,14 +18,14 @@
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.75)">
<title>data_structures/sparse_table.cpp</title>
<title>dynamic_programming/subset_sum_dynamic.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implementation of Sparse Table for min() function.">
<polygon fill="#999999" stroke="#666666" points="169.75,-85.75 54,-85.75 54,-55.25 169.75,-55.25 169.75,-85.75"/>
<text text-anchor="start" x="62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/sparse</text>
<text text-anchor="middle" x="111.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_table.cpp</text>
<g id="a_Node000001"><a xlink:title="Implements [Sub&#45;set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm,...">
<polygon fill="#999999" stroke="#666666" points="202.62,-85.75 69.62,-85.75 69.62,-55.25 202.62,-55.25 202.62,-85.75"/>
<text text-anchor="start" x="77.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
<text text-anchor="middle" x="136.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/subset_sum_dynamic.cpp</text>
</a>
</g>
</g>
@@ -33,8 +33,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
@@ -42,8 +42,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M88.89,-54.95C74.86,-46.07 56.97,-34.74 42.78,-25.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="44.81,-22.9 34.49,-20.51 41.07,-28.82 44.81,-22.9"/>
<path fill="none" stroke="#63b8ff" d="M108.15,-54.8C90.77,-45.66 68.53,-33.97 51.3,-24.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="53.12,-21.91 42.64,-20.36 49.86,-28.11 53.12,-21.91"/>
</a>
</g>
</g>
@@ -51,8 +51,8 @@
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="104,-19.25 55.75,-19.25 55.75,0 104,0 104,-19.25"/>
<text text-anchor="middle" x="79.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 66.38,-19.25 66.38,0 119.88,0 119.88,-19.25"/>
<text text-anchor="middle" x="93.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
@@ -60,8 +60,8 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M103.96,-54.95C99.84,-47.36 94.75,-37.99 90.31,-29.82"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="93.38,-28.15 85.53,-21.03 87.23,-31.49 93.38,-28.15"/>
<path fill="none" stroke="#63b8ff" d="M125.5,-54.95C119.77,-47.1 112.64,-37.35 106.53,-28.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="109.37,-26.93 100.65,-20.92 103.72,-31.06 109.37,-26.93"/>
</a>
</g>
</g>
@@ -69,8 +69,8 @@
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="167.5,-19.25 122.25,-19.25 122.25,0 167.5,0 167.5,-19.25"/>
<text text-anchor="middle" x="144.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
<polygon fill="#e0e0e0" stroke="#999999" points="220.5,-19.25 137.75,-19.25 137.75,0 220.5,0 220.5,-19.25"/>
<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_map</text>
</a>
</g>
</g>
@@ -78,8 +78,8 @@
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.03,-54.95C124.33,-47.28 129.66,-37.77 134.27,-29.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="137.21,-31.46 139.05,-21.02 131.11,-28.03 137.21,-31.46"/>
<path fill="none" stroke="#63b8ff" d="M146.75,-54.95C152.48,-47.1 159.61,-37.35 165.72,-28.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.53,-31.06 171.6,-20.92 162.88,-26.93 168.53,-31.06"/>
</a>
</g>
</g>
@@ -87,8 +87,8 @@
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="238.62,-19.25 185.12,-19.25 185.12,0 238.62,0 238.62,-19.25"/>
<text text-anchor="middle" x="211.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
<polygon fill="#e0e0e0" stroke="#999999" points="281.62,-19.25 238.62,-19.25 238.62,0 281.62,0 281.62,-19.25"/>
<text text-anchor="middle" x="260.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
@@ -96,8 +96,8 @@
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M136.85,-54.8C152.08,-45.83 171.48,-34.41 186.74,-25.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="188.39,-28.51 195.23,-20.42 184.84,-22.48 188.39,-28.51"/>
<path fill="none" stroke="#63b8ff" d="M167.1,-54.8C186.62,-45.53 211.66,-33.63 230.85,-24.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="232.21,-27.75 239.74,-20.3 229.21,-21.43 232.21,-27.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.7 KiB

After

Width:  |  Height:  |  Size: 4.8 KiB

94
df/d1f/subset__sum__dynamic_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,94 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: dynamic_programming/subset_sum_dynamic.cpp Pages: 1 -->
<svg width="290pt" height="94pt"
viewBox="0.00 0.00 289.62 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>dynamic_programming/subset_sum_dynamic.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implements [Sub&#45;set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm,...">
<polygon fill="#999999" stroke="#666666" points="202.62,-85.75 69.62,-85.75 69.62,-55.25 202.62,-55.25 202.62,-85.75"/>
<text text-anchor="start" x="77.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
<text text-anchor="middle" x="136.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/subset_sum_dynamic.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M108.15,-54.8C90.77,-45.66 68.53,-33.97 51.3,-24.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="53.12,-21.91 42.64,-20.36 49.86,-28.11 53.12,-21.91"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 66.38,-19.25 66.38,0 119.88,0 119.88,-19.25"/>
<text text-anchor="middle" x="93.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M125.5,-54.95C119.77,-47.1 112.64,-37.35 106.53,-28.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="109.37,-26.93 100.65,-20.92 103.72,-31.06 109.37,-26.93"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="220.5,-19.25 137.75,-19.25 137.75,0 220.5,0 220.5,-19.25"/>
<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_map</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M146.75,-54.95C152.48,-47.1 159.61,-37.35 165.72,-28.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.53,-31.06 171.6,-20.92 162.88,-26.93 168.53,-31.06"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="281.62,-19.25 238.62,-19.25 238.62,0 281.62,0 281.62,-19.25"/>
<text text-anchor="middle" x="260.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M167.1,-54.8C186.62,-45.53 211.66,-33.63 230.85,-24.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="232.21,-27.75 239.74,-20.3 229.21,-21.43 232.21,-27.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.0 KiB

4
df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html
View File

@@ -377,13 +377,13 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 181</span> }</div>
<div class="line"><span class="lineno"> 182</span> p &gt;&gt;= 1;</div>
<div class="line"><span class="lineno"> 183</span> <span class="keywordflow">if</span> (p) {</div>
<div class="line"><span class="lineno"> 184</span> <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_function" href="#acc5fe9c2032fb7582c38a20d1fa69bcf">addition</a>(N, N, curve_a_coeff, mod);</div>
<div class="line"><span class="lineno"> 184</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_function" href="#acc5fe9c2032fb7582c38a20d1fa69bcf">addition</a>(N, N, curve_a_coeff, mod);</div>
<div class="line"><span class="lineno"> 185</span> }</div>
<div class="line"><span class="lineno"> 186</span> }</div>
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">return</span> Q;</div>
<div class="line"><span class="lineno"> 188</span>}</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="anamespaceciphers_1_1elliptic__curve__key__exchange_html_acc5fe9c2032fb7582c38a20d1fa69bcf"><div class="ttname"><a href="#acc5fe9c2032fb7582c38a20d1fa69bcf">ciphers::elliptic_curve_key_exchange::addition</a></div><div class="ttdeci">Point addition(Point a, Point b, const uint256_t &amp;curve_a_coeff, uint256_t mod)</div><div class="ttdoc">Addition of points.</div><div class="ttdef"><b>Definition</b> elliptic_curve_key_exchange.cpp:110</div></div>
<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__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="astructciphers_1_1elliptic__curve__key__exchange_1_1_point_html"><div class="ttname"><a href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a></div><div class="ttdoc">Definition of struct Point.</div><div class="ttdef"><b>Definition</b> elliptic_curve_key_exchange.cpp:46</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>

11
df/d88/data__structures_2sparse__table_8cpp__incl.map
View File

@@ -1,11 +0,0 @@
<map id="data_structures/sparse_table.cpp" name="data_structures/sparse_table.cpp">
<area shape="rect" id="Node000001" title="Implementation of Sparse Table for min() function." alt="" coords="77,5,232,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,56,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="125,49,64,88,61,83,122,44"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="80,94,144,120"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="146,48,128,81,123,79,142,45"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="168,94,229,120"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="168,45,187,79,182,82,163,48"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="252,94,324,120"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="189,44,256,83,253,88,186,49"/>
</map>

1
df/d88/data__structures_2sparse__table_8cpp__incl.md5
View File

@@ -1 +0,0 @@
5562a19c49f950b27a8fb95aed41a164

94
df/d88/data__structures_2sparse__table_8cpp__incl_org.svg
View File

@@ -1,94 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: data_structures/sparse_table.cpp Pages: 1 -->
<svg width="247pt" height="94pt"
viewBox="0.00 0.00 246.62 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>data_structures/sparse_table.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implementation of Sparse Table for min() function.">
<polygon fill="#999999" stroke="#666666" points="169.75,-85.75 54,-85.75 54,-55.25 169.75,-55.25 169.75,-85.75"/>
<text text-anchor="start" x="62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/sparse</text>
<text text-anchor="middle" x="111.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_table.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M88.89,-54.95C74.86,-46.07 56.97,-34.74 42.78,-25.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="44.81,-22.9 34.49,-20.51 41.07,-28.82 44.81,-22.9"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="104,-19.25 55.75,-19.25 55.75,0 104,0 104,-19.25"/>
<text text-anchor="middle" x="79.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M103.96,-54.95C99.84,-47.36 94.75,-37.99 90.31,-29.82"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="93.38,-28.15 85.53,-21.03 87.23,-31.49 93.38,-28.15"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="167.5,-19.25 122.25,-19.25 122.25,0 167.5,0 167.5,-19.25"/>
<text text-anchor="middle" x="144.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.03,-54.95C124.33,-47.28 129.66,-37.77 134.27,-29.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="137.21,-31.46 139.05,-21.02 131.11,-28.03 137.21,-31.46"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="238.62,-19.25 185.12,-19.25 185.12,0 238.62,0 238.62,-19.25"/>
<text text-anchor="middle" x="211.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M136.85,-54.8C152.08,-45.83 171.48,-34.41 186.74,-25.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="188.39,-28.51 195.23,-20.42 184.84,-22.48 188.39,-28.51"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 3.9 KiB

2
df/d88/namespacedp.html
View File

@@ -112,7 +112,7 @@ $(function(){initNavTree('df/d88/namespacedp.html','../../'); initResizable(true
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
<p>for assert for IO Operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a> </p>
<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> for IO Operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a> </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->

273
df/dcb/greedy__algorithms_2dijkstra_8cpp.html
View File

@@ -1,273 +0,0 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: greedy_algorithms/dijkstra.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('df/dcb/greedy__algorithms_2dijkstra_8cpp.html','../../'); initResizable(true); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">dijkstra.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;climits&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for dijkstra.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.svg" width="335" height="111"><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="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">greedy_algorithms::dijkstra::Graph</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Wrapper class for storing a graph. <a href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><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 &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for string class <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html">greedy_algorithms::dijkstra</a></td></tr>
<tr class="memdesc:d2/d2f/namespacegreedy__algorithms_1_1dijkstra"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:af6cb29ca6dc5771439f6ea7262058a71" id="r_af6cb29ca6dc5771439f6ea7262058a71"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71">greedy_algorithms::dijkstra::minimum_distance</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; mdist, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; vset, int V)</td></tr>
<tr class="memdesc:af6cb29ca6dc5771439f6ea7262058a71"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function that finds the vertex with the minimum distance in <code>mdist</code>. <br /></td></tr>
<tr class="separator:af6cb29ca6dc5771439f6ea7262058a71"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7341d7c76a6145e991cdd231f689fca8" id="r_a7341d7c76a6145e991cdd231f689fca8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8">greedy_algorithms::dijkstra::print</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; dist, int V)</td></tr>
<tr class="memdesc:a7341d7c76a6145e991cdd231f689fca8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print the distances to vertices. <br /></td></tr>
<tr class="separator:a7341d7c76a6145e991cdd231f689fca8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af915876d0ca33cc71a6a6191a8cd3ccd" id="r_af915876d0ca33cc71a6a6191a8cd3ccd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd">greedy_algorithms::dijkstra::dijkstra</a> (<a class="el" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">Graph</a> graph, int src)</td></tr>
<tr class="memdesc:af915876d0ca33cc71a6a6191a8cd3ccd"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function that finds the shortest path from a given source to all other vertices using Dijkstra's Algorithm. <br /></td></tr>
<tr class="separator:af915876d0ca33cc71a6a6191a8cd3ccd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation </p>
<p><em>Quote from Wikipedia.</em></p>
<p><b>Dijkstra's algorithm</b> is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd>
<dd>
<a href="https://github.com/arpanjain97" target="_blank">Arpan Jain</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<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"> 199</span> {</div>
<div class="line"><span class="lineno"> 200</span> <a class="code hl_function" href="../../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 201</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 202</span>}</div>
<div class="ttc" id="agraph_2dijkstra_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> dijkstra.cpp:113</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="524" height="315"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">&#9670;&#160;</a></span>tests()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void tests </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<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"> 160</span> {</div>
<div class="line"><span class="lineno"> 161</span> <a class="code hl_class" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">greedy_algorithms::dijkstra::Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>(8);</div>
<div class="line"><span class="lineno"> 162</span> </div>
<div class="line"><span class="lineno"> 163</span> <span class="comment">// 1st test.</span></div>
<div class="line"><span class="lineno"> 164</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(6, 2, 4);</div>
<div class="line"><span class="lineno"> 165</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(2, 6, 4);</div>
<div class="line"><span class="lineno"> 166</span> </div>
<div class="line"><span class="lineno"> 167</span> assert(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[6][2] == 4);</div>
<div class="line"><span class="lineno"> 168</span> </div>
<div class="line"><span class="lineno"> 169</span> <span class="comment">// 2nd test.</span></div>
<div class="line"><span class="lineno"> 170</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(0, 1, 1);</div>
<div class="line"><span class="lineno"> 171</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(1, 0, 1);</div>
<div class="line"><span class="lineno"> 172</span> </div>
<div class="line"><span class="lineno"> 173</span> assert(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[0][1] == 1);</div>
<div class="line"><span class="lineno"> 174</span> </div>
<div class="line"><span class="lineno"> 175</span> <span class="comment">// 3rd test.</span></div>
<div class="line"><span class="lineno"> 176</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(0, 2, 7);</div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(2, 0, 7);</div>
<div class="line"><span class="lineno"> 178</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(1, 2, 1);</div>
<div class="line"><span class="lineno"> 179</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(2, 1, 1);</div>
<div class="line"><span class="lineno"> 180</span> </div>
<div class="line"><span class="lineno"> 181</span> assert(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[0][2] == 7);</div>
<div class="line"><span class="lineno"> 182</span> </div>
<div class="line"><span class="lineno"> 183</span> <span class="comment">// 4th test.</span></div>
<div class="line"><span class="lineno"> 184</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(1, 3, 3);</div>
<div class="line"><span class="lineno"> 185</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(3, 1, 3);</div>
<div class="line"><span class="lineno"> 186</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(1, 4, 2);</div>
<div class="line"><span class="lineno"> 187</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(4, 1, 2);</div>
<div class="line"><span class="lineno"> 188</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(2, 3, 2);</div>
<div class="line"><span class="lineno"> 189</span> </div>
<div class="line"><span class="lineno"> 190</span> assert(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[1][3] == 3);</div>
<div class="line"><span class="lineno"> 191</span> </div>
<div class="line"><span class="lineno"> 192</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 193</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="aclassgreedy__algorithms_1_1dijkstra_1_1_graph_html"><div class="ttname"><a href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">greedy_algorithms::dijkstra::Graph</a></div><div class="ttdoc">Wrapper class for storing a graph.</div><div class="ttdef"><b>Definition</b> dijkstra.cpp:35</div></div>
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../df/dcb/greedy__algorithms_2dijkstra_8cpp.html">dijkstra.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
</ul>
</div>
</body>
</html>

9
df/dcb/greedy__algorithms_2dijkstra_8cpp.js
View File

@@ -1,9 +0,0 @@
var greedy__algorithms_2dijkstra_8cpp =
[
[ "greedy_algorithms::dijkstra::Graph", "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html", "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph" ],
[ "dijkstra", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd", null ],
[ "main", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "minimum_distance", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71", null ],
[ "print", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a7341d7c76a6145e991cdd231f689fca8", null ],
[ "tests", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
];

23
df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,23 +0,0 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,149,55,174"/>
<area shape="rect" id="Node000002" href="$d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,149,153,174"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,159,88,159,88,164,55,164"/>
<area shape="rect" id="Node000003" href="$df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" title="Function that add edge between two nodes or vertices of graph." alt="" coords="201,100,313,125"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,150,206,129,208,134,155,155"/>
<area shape="rect" id="Node000004" href="$df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="206,149,309,174"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="154,159,190,159,190,164,154,164"/>
<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="222,198,293,224"/>
<area shape="poly" id="edge10_Node000002_Node000011" title=" " alt="" coords="155,169,208,190,206,195,153,174"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/empty.html#" title=" " alt="" coords="376,5,504,46"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="296,146,312,136,327,116,335,97,343,76,359,56,363,53,366,57,363,60,347,79,340,99,332,119,315,140,299,150"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="386,70,494,96"/>
<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="290,146,312,135,336,120,360,105,373,99,375,104,363,109,339,124,315,140,293,151"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/pop.html#" title=" " alt="" coords="361,120,519,145"/>
<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="309,151,346,145,346,150,310,156"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/push.html#" title=" " alt="" coords="376,169,504,210"/>
<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="310,167,361,175,360,180,309,172"/>
<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="382,234,498,260"/>
<area shape="poly" id="edge8_Node000004_Node000009" title=" " alt="" coords="293,173,315,183,339,202,363,219,376,226,374,230,360,224,336,206,312,188,291,177"/>
<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/top.html#" title=" " alt="" coords="363,284,517,309"/>
<area shape="poly" id="edge9_Node000004_Node000010" title=" " alt="" coords="299,173,315,184,332,207,339,229,346,250,363,270,368,274,364,278,359,274,342,253,334,231,327,209,311,188,296,177"/>
</map>

1
df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +0,0 @@
1edcd48bfe806bcce7094807255da485

229
df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,229 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="393pt" height="236pt"
viewBox="0.00 0.00 393.00 235.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 231.88)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-120.25 0,-120.25 0,-101 37,-101 37,-120.25"/>
<text text-anchor="middle" x="18.5" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="110.75,-120.25 73,-120.25 73,-101 110.75,-101 110.75,-120.25"/>
<text text-anchor="middle" x="91.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-110.62C44.55,-110.62 53.37,-110.62 61.69,-110.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-114.13 71.43,-110.63 61.43,-107.13 61.43,-114.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
<polygon fill="white" stroke="#666666" points="231,-157.25 146.75,-157.25 146.75,-138 231,-138 231,-157.25"/>
<text text-anchor="middle" x="188.88" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.19,-117.76C122.59,-122.2 137.66,-128.07 151.42,-133.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.07,-136.66 160.66,-137.03 152.61,-130.14 150.07,-136.66"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84" target="_top" xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
<polygon fill="white" stroke="#666666" points="227.62,-120.25 150.12,-120.25 150.12,-101 227.62,-101 227.62,-120.25"/>
<text text-anchor="middle" x="188.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.19,-110.62C119.1,-110.62 128.76,-110.62 138.53,-110.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="138.44,-114.13 148.44,-110.63 138.44,-107.13 138.44,-114.13"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="215.62,-83.25 162.12,-83.25 162.12,-64 215.62,-64 215.62,-83.25"/>
<text text-anchor="middle" x="188.88" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node11 -->
<g id="edge10_Node000002_Node000011" class="edge">
<title>Node2&#45;&gt;Node11</title>
<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.19,-103.49C122.59,-99.05 137.66,-93.18 151.42,-87.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.61,-91.11 160.66,-84.22 150.07,-84.59 152.61,-91.11"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="374.12,-227.88 277.88,-227.88 277.88,-197.38 374.12,-197.38 374.12,-227.88"/>
<text text-anchor="start" x="285.88" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
<text text-anchor="middle" x="326" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M219.11,-120.69C223.36,-122.91 227.49,-125.54 231,-128.62 254.35,-149.17 243.44,-168.32 267,-188.62 267.79,-189.31 268.61,-189.98 269.45,-190.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.49,-193.53 277.76,-196.11 271.34,-187.68 267.49,-193.53"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="366.25,-179.25 285.75,-179.25 285.75,-160 366.25,-160 366.25,-179.25"/>
<text text-anchor="middle" x="326" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge5_Node000004_Node000006" class="edge">
<title>Node4&#45;&gt;Node6</title>
<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M214.53,-120.67C220.03,-123.11 225.78,-125.83 231,-128.62 247.75,-137.57 249.78,-143.63 267,-151.62 270.1,-153.07 273.35,-154.43 276.66,-155.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="275.3,-158.95 285.89,-159.03 277.66,-152.36 275.3,-158.95"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="385,-142.25 267,-142.25 267,-123 385,-123 385,-142.25"/>
<text text-anchor="middle" x="326" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge6_Node000004_Node000007" class="edge">
<title>Node4&#45;&gt;Node7</title>
<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M227.87,-116.81C236.51,-118.22 245.96,-119.76 255.45,-121.3"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="254.65,-124.72 265.09,-122.87 255.78,-117.81 254.65,-124.72"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="374.12,-104.88 277.88,-104.88 277.88,-74.38 374.12,-74.38 374.12,-104.88"/>
<text text-anchor="start" x="285.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
<text text-anchor="middle" x="326" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node8 -->
<g id="edge7_Node000004_Node000008" class="edge">
<title>Node4&#45;&gt;Node8</title>
<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M227.87,-104.72C239.83,-102.86 253.32,-100.76 266.36,-98.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="266.82,-102.21 276.16,-97.22 265.74,-95.29 266.82,-102.21"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="369.25,-56.25 282.75,-56.25 282.75,-37 369.25,-37 369.25,-56.25"/>
<text text-anchor="middle" x="326" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node9 -->
<g id="edge8_Node000004_Node000009" class="edge">
<title>Node4&#45;&gt;Node9</title>
<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M215.12,-100.67C220.48,-98.26 226.02,-95.53 231,-92.62 248.28,-82.55 249.26,-74.86 267,-65.62 270.29,-63.91 273.76,-62.31 277.31,-60.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="278.55,-64.1 286.64,-57.26 276.05,-57.56 278.55,-64.1"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="383.88,-19.25 268.12,-19.25 268.12,0 383.88,0 383.88,-19.25"/>
<text text-anchor="middle" x="326" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node10 -->
<g id="edge9_Node000004_Node000010" class="edge">
<title>Node4&#45;&gt;Node10</title>
<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M219.2,-100.67C223.45,-98.44 227.54,-95.77 231,-92.62 255.41,-70.39 241.38,-48.47 267,-27.62 268.1,-26.73 269.25,-25.87 270.44,-25.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="271.79,-28.32 278.81,-20.38 268.37,-22.21 271.79,-28.32"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 11 KiB

203
df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -1,203 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="393pt" height="236pt"
viewBox="0.00 0.00 393.00 235.88" 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 231.88)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-120.25 0,-120.25 0,-101 37,-101 37,-120.25"/>
<text text-anchor="middle" x="18.5" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="110.75,-120.25 73,-120.25 73,-101 110.75,-101 110.75,-120.25"/>
<text text-anchor="middle" x="91.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-110.62C44.55,-110.62 53.37,-110.62 61.69,-110.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-114.13 71.43,-110.63 61.43,-107.13 61.43,-114.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
<polygon fill="white" stroke="#666666" points="231,-157.25 146.75,-157.25 146.75,-138 231,-138 231,-157.25"/>
<text text-anchor="middle" x="188.88" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.19,-117.76C122.59,-122.2 137.66,-128.07 151.42,-133.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.07,-136.66 160.66,-137.03 152.61,-130.14 150.07,-136.66"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84" target="_top" xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
<polygon fill="white" stroke="#666666" points="227.62,-120.25 150.12,-120.25 150.12,-101 227.62,-101 227.62,-120.25"/>
<text text-anchor="middle" x="188.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.19,-110.62C119.1,-110.62 128.76,-110.62 138.53,-110.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="138.44,-114.13 148.44,-110.63 138.44,-107.13 138.44,-114.13"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="215.62,-83.25 162.12,-83.25 162.12,-64 215.62,-64 215.62,-83.25"/>
<text text-anchor="middle" x="188.88" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node11 -->
<g id="edge10_Node000002_Node000011" class="edge">
<title>Node2&#45;&gt;Node11</title>
<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.19,-103.49C122.59,-99.05 137.66,-93.18 151.42,-87.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.61,-91.11 160.66,-84.22 150.07,-84.59 152.61,-91.11"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="374.12,-227.88 277.88,-227.88 277.88,-197.38 374.12,-197.38 374.12,-227.88"/>
<text text-anchor="start" x="285.88" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
<text text-anchor="middle" x="326" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M219.11,-120.69C223.36,-122.91 227.49,-125.54 231,-128.62 254.35,-149.17 243.44,-168.32 267,-188.62 267.79,-189.31 268.61,-189.98 269.45,-190.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.49,-193.53 277.76,-196.11 271.34,-187.68 267.49,-193.53"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="366.25,-179.25 285.75,-179.25 285.75,-160 366.25,-160 366.25,-179.25"/>
<text text-anchor="middle" x="326" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge5_Node000004_Node000006" class="edge">
<title>Node4&#45;&gt;Node6</title>
<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M214.53,-120.67C220.03,-123.11 225.78,-125.83 231,-128.62 247.75,-137.57 249.78,-143.63 267,-151.62 270.1,-153.07 273.35,-154.43 276.66,-155.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="275.3,-158.95 285.89,-159.03 277.66,-152.36 275.3,-158.95"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="385,-142.25 267,-142.25 267,-123 385,-123 385,-142.25"/>
<text text-anchor="middle" x="326" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge6_Node000004_Node000007" class="edge">
<title>Node4&#45;&gt;Node7</title>
<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M227.87,-116.81C236.51,-118.22 245.96,-119.76 255.45,-121.3"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="254.65,-124.72 265.09,-122.87 255.78,-117.81 254.65,-124.72"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="374.12,-104.88 277.88,-104.88 277.88,-74.38 374.12,-74.38 374.12,-104.88"/>
<text text-anchor="start" x="285.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
<text text-anchor="middle" x="326" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node8 -->
<g id="edge7_Node000004_Node000008" class="edge">
<title>Node4&#45;&gt;Node8</title>
<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M227.87,-104.72C239.83,-102.86 253.32,-100.76 266.36,-98.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="266.82,-102.21 276.16,-97.22 265.74,-95.29 266.82,-102.21"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="369.25,-56.25 282.75,-56.25 282.75,-37 369.25,-37 369.25,-56.25"/>
<text text-anchor="middle" x="326" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node9 -->
<g id="edge8_Node000004_Node000009" class="edge">
<title>Node4&#45;&gt;Node9</title>
<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M215.12,-100.67C220.48,-98.26 226.02,-95.53 231,-92.62 248.28,-82.55 249.26,-74.86 267,-65.62 270.29,-63.91 273.76,-62.31 277.31,-60.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="278.55,-64.1 286.64,-57.26 276.05,-57.56 278.55,-64.1"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="383.88,-19.25 268.12,-19.25 268.12,0 383.88,0 383.88,-19.25"/>
<text text-anchor="middle" x="326" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node10 -->
<g id="edge9_Node000004_Node000010" class="edge">
<title>Node4&#45;&gt;Node10</title>
<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M219.2,-100.67C223.45,-98.44 227.54,-95.77 231,-92.62 255.41,-70.39 241.38,-48.47 267,-27.62 268.1,-26.73 269.25,-25.87 270.44,-25.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="271.79,-28.32 278.81,-20.38 268.37,-22.21 271.79,-28.32"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 9.9 KiB