mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-24 22:02:20 +08:00
Documentation for c26eea874d
This commit is contained in:
realstealthninja
@@ -4,7 +4,7 @@
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.12.0"/>
|
||||
<meta name="generator" content="Doxygen 1.13.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: greedy_algorithms/dijkstra_greedy.cpp Source File</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -124,21 +124,22 @@ $(function(){initNavTree('da/de8/dijkstra__greedy_8cpp_source.html','../../'); i
|
||||
<div class="headertitle"><div class="title">dijkstra_greedy.cpp</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<a href="../../da/de8/dijkstra__greedy_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
|
||||
<a href="../../da/de8/dijkstra__greedy_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
||||
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
|
||||
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cassert></span> </div>
|
||||
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <climits></span> </div>
|
||||
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <iostream></span> </div>
|
||||
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <vector></span> </div>
|
||||
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> </div>
|
||||
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span></div>
|
||||
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a> {</div>
|
||||
<div class="foldopen" id="foldopen00031" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html"> 31</a></span><span class="keyword">namespace </span>dijkstra {</div>
|
||||
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html"> 31</a></span><span class="keyword">namespace </span><a class="code hl_function" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd">dijkstra</a> {</div>
|
||||
<div class="foldopen" id="foldopen00035" data-start="{" data-end="};">
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html"> 35</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">Graph</a> {</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html"> 35</a></span><span class="keyword">class </span><a class="code hl_function" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc">Graph</a> {</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">public</span>:</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <span class="keywordtype">int</span> vertexNum = 0;</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> std::vector<std::vector<int>> edges{};</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> </div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span></div>
|
||||
<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc"> 44</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc">Graph</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> V) {</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// Initialize the array edges</span></div>
|
||||
@@ -157,7 +158,7 @@ $(function(){initNavTree('da/de8/dijkstra__greedy_8cpp_source.html','../../'); i
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> this->vertexNum = V;</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> </div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span></div>
|
||||
<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79"> 68</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79">add_edge</a>(<span class="keywordtype">int</span> src, <span class="keywordtype">int</span> dst, <span class="keywordtype">int</span> weight) {</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> this->edges[src][dst] = weight;</div>
|
||||
@@ -165,7 +166,7 @@ $(function(){initNavTree('da/de8/dijkstra__greedy_8cpp_source.html','../../'); i
|
||||
</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span>};</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span></div>
|
||||
<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71"> 82</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71">minimum_distance</a>(std::vector<int> mdist, std::vector<bool> vset, <span class="keywordtype">int</span> V) {</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordtype">int</span> minVal = INT_MAX, minInd = 0;</div>
|
||||
@@ -179,7 +180,7 @@ $(function(){initNavTree('da/de8/dijkstra__greedy_8cpp_source.html','../../'); i
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">return</span> minInd;</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> </div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span></div>
|
||||
<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8"> 104</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8">print</a>(std::vector<int> dist, <span class="keywordtype">int</span> V) {</div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> std::cout << <span class="stringliteral">"\nVertex Distance\n"</span>;</div>
|
||||
@@ -193,9 +194,9 @@ $(function(){initNavTree('da/de8/dijkstra__greedy_8cpp_source.html','../../'); i
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> }</div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span></div>
|
||||
<div class="foldopen" id="foldopen00124" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd"> 124</a></span><span class="keywordtype">void</span> dijkstra(<a class="code hl_class" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, <span class="keywordtype">int</span> src) {</div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd"> 124</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd">dijkstra</a>(<a class="code hl_class" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, <span class="keywordtype">int</span> src) {</div>
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordtype">int</span> V = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.vertexNum;</div>
|
||||
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> std::vector<int> mdist{}; <span class="comment">// Stores updated distances to the vertex</span></div>
|
||||
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> std::vector<bool> vset{}; <span class="comment">// `vset[i]` is true if the vertex `i` is included in the shortest path tree</span></div>
|
||||
@@ -228,7 +229,7 @@ $(function(){initNavTree('da/de8/dijkstra__greedy_8cpp_source.html','../../'); i
|
||||
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span>} <span class="comment">// namespace dijkstra</span></div>
|
||||
</div>
|
||||
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span>} <span class="comment">// namespace greedy_algorithms</span></div>
|
||||
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> </div>
|
||||
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span></div>
|
||||
<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"> 160</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
|
||||
<div class="line"><a id="l00161" name="l00161"></a><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>
|
||||
@@ -265,7 +266,7 @@ $(function(){initNavTree('da/de8/dijkstra__greedy_8cpp_source.html','../../'); i
|
||||
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> std::cout << <span class="stringliteral">"All tests have successfully passed!\n"</span>;</div>
|
||||
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> </div>
|
||||
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span></div>
|
||||
<div class="foldopen" id="foldopen00199" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"><a class="line" href="../../da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 199</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
||||
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <a class="code hl_function" href="../../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
@@ -280,6 +281,7 @@ $(function(){initNavTree('da/de8/dijkstra__greedy_8cpp_source.html','../../'); i
|
||||
<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 class="ttc" id="anamespacegreedy__algorithms_1_1dijkstra_html_a7341d7c76a6145e991cdd231f689fca8"><div class="ttname"><a href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8">greedy_algorithms::dijkstra::print</a></div><div class="ttdeci">void print(std::vector< int > dist, int V)</div><div class="ttdoc">Utility function to print the distances to vertices.</div><div class="ttdef"><b>Definition</b> <a href="#l00104">dijkstra_greedy.cpp:104</a></div></div>
|
||||
<div class="ttc" id="anamespacegreedy__algorithms_1_1dijkstra_html_af6cb29ca6dc5771439f6ea7262058a71"><div class="ttname"><a href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71">greedy_algorithms::dijkstra::minimum_distance</a></div><div class="ttdeci">int minimum_distance(std::vector< int > mdist, std::vector< bool > vset, int V)</div><div class="ttdoc">Utility function that finds the vertex with the minimum distance in mdist.</div><div class="ttdef"><b>Definition</b> <a href="#l00082">dijkstra_greedy.cpp:82</a></div></div>
|
||||
<div class="ttc" id="anamespacegreedy__algorithms_1_1dijkstra_html_af915876d0ca33cc71a6a6191a8cd3ccd"><div class="ttname"><a href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd">greedy_algorithms::dijkstra::dijkstra</a></div><div class="ttdeci">void dijkstra(Graph graph, int src)</div><div class="ttdoc">The main function that finds the shortest path from a given source to all other vertices using Dijkst...</div><div class="ttdef"><b>Definition</b> <a href="#l00124">dijkstra_greedy.cpp:124</a></div></div>
|
||||
<div class="ttc" id="anamespacegreedy__algorithms_html"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></div><div class="ttdoc">for string class</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00027">binary_addition.cpp:27</a></div></div>
|
||||
</div><!-- fragment --></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
@@ -287,7 +289,7 @@ $(function(){initNavTree('da/de8/dijkstra__greedy_8cpp_source.html','../../'); i
|
||||
<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="../../da/de8/dijkstra__greedy_8cpp.html">dijkstra_greedy.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>
|
||||
<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.13.2 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
Reference in New Issue
Block a user