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

Documentation for c8ce6f404c

Browse Source
This commit is contained in:
github-actions
2020-11-20 19:01:05 +00:00
parent 28a36dbd0c
commit a3bea7d7bd
234 changed files with 6454 additions and 5029 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
df/d82/breadth__first__search_8cpp.html
View File

@@ -124,7 +124,7 @@ Classes</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:df/dce/namespacegraph"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms. <br /></td></tr>
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. <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 name="func-members"></a>

13
df/dce/namespacegraph.html
View File

@@ -98,7 +98,7 @@ $(document).ready(function(){initNavTree('df/dce/namespacegraph.html','../../');
</div><!--header-->
<div class="contents">
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms.
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms.
<a href="../../df/dce/namespacegraph.html#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
@@ -141,8 +141,8 @@ Functions</h2></td></tr>
<tr class="separator:a868530bfaed30e57290a76d5b4402d50"><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 class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms. </p>
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. </p>
<div class="textblock"><p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. </p>
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a372ff051a7bc6c91d34a7b58edf8dfce"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a372ff051a7bc6c91d34a7b58edf8dfce">&#9670;&nbsp;</a></span>addEdge() <span class="overload">[1/3]</span></h2>
@@ -411,7 +411,7 @@ Here is the call graph for this function:</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160;<span class="comment"></span> <span class="keywordtype">int</span> n = adj-&gt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160;<span class="comment"> /// setting all the distances initially to INF</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> dist(n, INF);</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> dist(n, <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>);</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160;<span class="comment"> /// creating a min heap using priority queue</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160;<span class="comment"> /// first element of pair contains the distance</span></div>
@@ -445,7 +445,7 @@ Here is the call graph for this function:</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; }</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; }</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; }</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keywordflow">if</span> (dist[t] != INF) {</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keywordflow">if</span> (dist[t] != <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>) {</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <span class="keywordflow">return</span> dist[t];</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; }</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="keywordflow">return</span> -1;</div>
@@ -453,7 +453,7 @@ Here is the call graph for this function:</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/dce/namespacegraph_a868530bfaed30e57290a76d5b4402d50_cgraph.svg" width="279" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a868530bfaed30e57290a76d5b4402d50_cgraph.svg" width="322" height="323"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
@@ -631,6 +631,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html">std::priority_queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">std::priority_queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a330a2b0a904f01802ada1f8f3b28e76c"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a></div><div class="ttdeci">constexpr int64_t INF</div><div class="ttdoc">for store the graph, the distances, and the path</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:23</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>

9
df/dce/namespacegraph_a868530bfaed30e57290a76d5b4402d50_cgraph.map
View File

@@ -1,4 +1,9 @@
<map id="graph::dijkstra" name="graph::dijkstra">
<area shape="rect" id="node1" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="5,5,109,32"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="157,5,273,32"/>
<area shape="rect" id="node1" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="5,151,109,178"/>
<area shape="rect" id="node2" 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="172,5,301,47"/>
<area shape="rect" id="node3" 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="183,71,291,98"/>
<area shape="rect" id="node4" 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="157,122,316,149"/>
<area shape="rect" id="node5" 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="172,173,301,215"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="179,239,295,266"/>
<area shape="rect" id="node7" 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="159,290,314,317"/>
</map>

2
df/dce/namespacegraph_a868530bfaed30e57290a76d5b4402d50_cgraph.md5
View File

@@ -1 +1 @@
d37dcc0db19130368c0b23b1e4783053
729f7975d6f04189100f29a9eddf81b5

99
df/dce/namespacegraph_a868530bfaed30e57290a76d5b4402d50_cgraph.svg
View File

@@ -4,34 +4,111 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: graph::dijkstra Pages: 1 -->
<svg width="209pt" height="28pt"
viewBox="0.00 0.00 209.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<svg width="241pt" height="242pt"
viewBox="0.00 0.00 241.00 241.50" 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 237.5)">
<title>graph::dijkstra</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 205,-24 205,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-237.5 237,-237.5 237,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 78,-19.5 78,-0.5 0,-0.5"/>
<text text-anchor="middle" x="39" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
<polygon fill="#bfbfbf" stroke="black" points="0,-104.5 0,-123.5 78,-123.5 78,-104.5 0,-104.5"/>
<text text-anchor="middle" x="39" y="-111.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="114,-0.5 114,-19.5 201,-19.5 201,-0.5 114,-0.5"/>
<text text-anchor="middle" x="157.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="125,-203 125,-233 222,-233 222,-203 125,-203"/>
<text text-anchor="start" x="133" y="-221" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
<text text-anchor="middle" x="173.5" y="-210" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M78.15,-10C86.35,-10 95.16,-10 103.81,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="103.83,-13.5 113.83,-10 103.83,-6.5 103.83,-13.5"/>
<path fill="none" stroke="midnightblue" d="M46.96,-123.73C59,-139.98 85.22,-172.84 114,-193 116.54,-194.78 119.23,-196.47 122,-198.07"/>
<polygon fill="midnightblue" stroke="midnightblue" points="120.59,-201.28 131.06,-202.86 123.86,-195.09 120.59,-201.28"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="133,-164.5 133,-183.5 214,-183.5 214,-164.5 133,-164.5"/>
<text text-anchor="middle" x="173.5" y="-171.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M55.15,-123.53C69.81,-132.47 92.85,-145.81 114,-155 119.02,-157.18 124.37,-159.25 129.73,-161.17"/>
<polygon fill="midnightblue" stroke="midnightblue" points="128.7,-164.51 139.29,-164.44 130.96,-157.89 128.7,-164.51"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="114,-126.5 114,-145.5 233,-145.5 233,-126.5 114,-126.5"/>
<text text-anchor="middle" x="173.5" y="-133.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M78.32,-120.36C86.74,-121.76 95.9,-123.28 105.09,-124.81"/>
<polygon fill="midnightblue" stroke="midnightblue" points="104.59,-128.27 115.03,-126.46 105.74,-121.37 104.59,-128.27"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="125,-77 125,-107 222,-107 222,-77 125,-77"/>
<text text-anchor="start" x="133" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
<text text-anchor="middle" x="173.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M78.32,-107.64C89.67,-105.75 102.35,-103.65 114.64,-101.61"/>
<polygon fill="midnightblue" stroke="midnightblue" points="115.55,-105 124.84,-99.91 114.4,-98.1 115.55,-105"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="130,-38.5 130,-57.5 217,-57.5 217,-38.5 130,-38.5"/>
<text text-anchor="middle" x="173.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M53.38,-104.38C67.81,-94.32 91.72,-78.56 114,-68 119.34,-65.47 125.1,-63.1 130.83,-60.94"/>
<polygon fill="midnightblue" stroke="midnightblue" points="132.17,-64.18 140.4,-57.51 129.81,-57.59 132.17,-64.18"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="115.5,-0.5 115.5,-19.5 231.5,-19.5 231.5,-0.5 115.5,-0.5"/>
<text text-anchor="middle" x="173.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M45.86,-104.33C56.98,-86.78 82.83,-49.61 114,-29 117.08,-26.97 120.39,-25.14 123.81,-23.49"/>
<polygon fill="midnightblue" stroke="midnightblue" points="125.23,-26.69 133.07,-19.55 122.5,-20.25 125.23,-26.69"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 5.9 KiB

2
df/ddd/connected__components_8cpp.html
View File

@@ -114,7 +114,7 @@ Include dependency graph for connected_components.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:df/dce/namespacegraph"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms. <br /></td></tr>
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. <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 name="func-members"></a>