mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-31 17:22:27 +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++: graph/bidirectional_dijkstra.cpp File Reference</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');
|
||||
@@ -306,10 +306,10 @@ Variables</h2></td></tr>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">bidirectional_dijkstra.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 89</span> {</div>
|
||||
<div class="line"><span class="lineno"> 91</span> uint64_t n = adj1->size();</div>
|
||||
<div class="line"><span class="lineno"> 92</span> </div>
|
||||
<div class="line"><span class="lineno"> 92</span></div>
|
||||
<div class="line"><span class="lineno"> 94</span> std::vector<std::vector<uint64_t>> dist(2, std::vector<uint64_t>(n, <a class="code hl_variable" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>));</div>
|
||||
<div class="line"><span class="lineno"> 95</span> </div>
|
||||
<div class="line"><span class="lineno"> 99</span> </div>
|
||||
<div class="line"><span class="lineno"> 95</span></div>
|
||||
<div class="line"><span class="lineno"> 99</span></div>
|
||||
<div class="line"><span class="lineno"> 102</span> std::vector<</div>
|
||||
<div class="line"><span class="lineno"> 103</span> std::priority_queue<std::pair<uint64_t, uint64_t>,</div>
|
||||
<div class="line"><span class="lineno"> 104</span> std::vector<std::pair<uint64_t, uint64_t>>,</div>
|
||||
@@ -317,13 +317,13 @@ Variables</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 106</span> pq(2);</div>
|
||||
<div class="line"><span class="lineno"> 108</span> std::vector<uint64_t> workset(n);</div>
|
||||
<div class="line"><span class="lineno"> 110</span> std::vector<bool> visited(n);</div>
|
||||
<div class="line"><span class="lineno"> 111</span> </div>
|
||||
<div class="line"><span class="lineno"> 111</span></div>
|
||||
<div class="line"><span class="lineno"> 113</span> pq[0].push(std::make_pair(0, s));</div>
|
||||
<div class="line"><span class="lineno"> 114</span> </div>
|
||||
<div class="line"><span class="lineno"> 114</span></div>
|
||||
<div class="line"><span class="lineno"> 116</span> dist[0][s] = 0;</div>
|
||||
<div class="line"><span class="lineno"> 117</span> </div>
|
||||
<div class="line"><span class="lineno"> 117</span></div>
|
||||
<div class="line"><span class="lineno"> 119</span> pq[1].push(std::make_pair(0, t));</div>
|
||||
<div class="line"><span class="lineno"> 120</span> </div>
|
||||
<div class="line"><span class="lineno"> 120</span></div>
|
||||
<div class="line"><span class="lineno"> 122</span> dist[1][t] = 0;</div>
|
||||
<div class="line"><span class="lineno"> 123</span> </div>
|
||||
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
||||
@@ -334,11 +334,11 @@ Variables</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 130</span> <span class="keywordflow">break</span>;</div>
|
||||
<div class="line"><span class="lineno"> 131</span> }</div>
|
||||
<div class="line"><span class="lineno"> 133</span> uint64_t currentNode = pq[0].top().second;</div>
|
||||
<div class="line"><span class="lineno"> 134</span> </div>
|
||||
<div class="line"><span class="lineno"> 134</span></div>
|
||||
<div class="line"><span class="lineno"> 136</span> uint64_t currentDist = pq[0].top().first;</div>
|
||||
<div class="line"><span class="lineno"> 137</span> </div>
|
||||
<div class="line"><span class="lineno"> 138</span> pq[0].pop();</div>
|
||||
<div class="line"><span class="lineno"> 139</span> </div>
|
||||
<div class="line"><span class="lineno"> 139</span></div>
|
||||
<div class="line"><span class="lineno"> 142</span> <span class="keywordflow">for</span> (std::pair<int, int> edge : (*adj1)[currentNode]) {</div>
|
||||
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">if</span> (currentDist + edge.second < dist[0][edge.first]) {</div>
|
||||
<div class="line"><span class="lineno"> 145</span> dist[0][edge.first] = currentDist + edge.second;</div>
|
||||
@@ -347,7 +347,7 @@ Variables</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 148</span> }</div>
|
||||
<div class="line"><span class="lineno"> 149</span> <span class="comment">// store the processed node/ vertex</span></div>
|
||||
<div class="line"><span class="lineno"> 150</span> workset.push_back(currentNode);</div>
|
||||
<div class="line"><span class="lineno"> 151</span> </div>
|
||||
<div class="line"><span class="lineno"> 151</span></div>
|
||||
<div class="line"><span class="lineno"> 153</span> <span class="keywordflow">if</span> (visited[currentNode] == 1) {</div>
|
||||
<div class="line"><span class="lineno"> 154</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a22f1b7277e1dd4190f25014b48487ce6">Shortest_Path_Distance</a>(workset, dist);</div>
|
||||
<div class="line"><span class="lineno"> 155</span> }</div>
|
||||
@@ -359,11 +359,11 @@ Variables</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 162</span> <span class="keywordflow">break</span>;</div>
|
||||
<div class="line"><span class="lineno"> 163</span> }</div>
|
||||
<div class="line"><span class="lineno"> 165</span> currentNode = pq[1].top().second;</div>
|
||||
<div class="line"><span class="lineno"> 166</span> </div>
|
||||
<div class="line"><span class="lineno"> 166</span></div>
|
||||
<div class="line"><span class="lineno"> 168</span> currentDist = pq[1].top().first;</div>
|
||||
<div class="line"><span class="lineno"> 169</span> </div>
|
||||
<div class="line"><span class="lineno"> 170</span> pq[1].pop();</div>
|
||||
<div class="line"><span class="lineno"> 171</span> </div>
|
||||
<div class="line"><span class="lineno"> 171</span></div>
|
||||
<div class="line"><span class="lineno"> 174</span> <span class="keywordflow">for</span> (std::pair<int, int> edge : (*adj2)[currentNode]) {</div>
|
||||
<div class="line"><span class="lineno"> 176</span> <span class="keywordflow">if</span> (currentDist + edge.second < dist[1][edge.first]) {</div>
|
||||
<div class="line"><span class="lineno"> 177</span> dist[1][edge.first] = currentDist + edge.second;</div>
|
||||
@@ -372,7 +372,7 @@ Variables</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 180</span> }</div>
|
||||
<div class="line"><span class="lineno"> 181</span> <span class="comment">// store the processed node/ vertex</span></div>
|
||||
<div class="line"><span class="lineno"> 182</span> workset.push_back(currentNode);</div>
|
||||
<div class="line"><span class="lineno"> 183</span> </div>
|
||||
<div class="line"><span class="lineno"> 183</span></div>
|
||||
<div class="line"><span class="lineno"> 185</span> <span class="keywordflow">if</span> (visited[currentNode] == 1) {</div>
|
||||
<div class="line"><span class="lineno"> 186</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a22f1b7277e1dd4190f25014b48487ce6">Shortest_Path_Distance</a>(workset, dist);</div>
|
||||
<div class="line"><span class="lineno"> 187</span> }</div>
|
||||
@@ -515,7 +515,7 @@ Variables</h2></td></tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -537,13 +537,13 @@ Variables</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 210</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj1_1, &adj1_2, 1, 3, 5);</div>
|
||||
<div class="line"><span class="lineno"> 211</span> </div>
|
||||
<div class="line"><span class="lineno"> 212</span> uint64_t s = 1, t = 3;</div>
|
||||
<div class="line"><span class="lineno"> 213</span> assert(graph::bidirectional_dijkstra::Bidijkstra(&adj1_1, &adj1_2, s - 1,</div>
|
||||
<div class="line"><span class="lineno"> 213</span> assert(<a class="code hl_function" href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a>(&adj1_1, &adj1_2, s - 1,</div>
|
||||
<div class="line"><span class="lineno"> 214</span> t - 1) == 3);</div>
|
||||
<div class="line"><span class="lineno"> 215</span> std::cout << <span class="stringliteral">"Test 1 Passed..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 216</span> </div>
|
||||
<div class="line"><span class="lineno"> 217</span> s = 4, t = 3;</div>
|
||||
<div class="line"><span class="lineno"> 218</span> std::cout << <span class="stringliteral">"Initiating Test 2..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 219</span> assert(graph::bidirectional_dijkstra::Bidijkstra(&adj1_1, &adj1_2, s - 1,</div>
|
||||
<div class="line"><span class="lineno"> 219</span> assert(<a class="code hl_function" href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a>(&adj1_1, &adj1_2, s - 1,</div>
|
||||
<div class="line"><span class="lineno"> 220</span> t - 1) == 5);</div>
|
||||
<div class="line"><span class="lineno"> 221</span> std::cout << <span class="stringliteral">"Test 2 Passed..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 222</span> </div>
|
||||
@@ -563,7 +563,7 @@ Variables</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 236</span> </div>
|
||||
<div class="line"><span class="lineno"> 237</span> s = 1, t = 5;</div>
|
||||
<div class="line"><span class="lineno"> 238</span> std::cout << <span class="stringliteral">"Initiating Test 3..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 239</span> assert(graph::bidirectional_dijkstra::Bidijkstra(&adj2_1, &adj2_2, s - 1,</div>
|
||||
<div class="line"><span class="lineno"> 239</span> assert(<a class="code hl_function" href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a>(&adj2_1, &adj2_2, s - 1,</div>
|
||||
<div class="line"><span class="lineno"> 240</span> t - 1) == 6);</div>
|
||||
<div class="line"><span class="lineno"> 241</span> std::cout << <span class="stringliteral">"Test 3 Passed..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 242</span> std::cout << <span class="stringliteral">"All Test Passed..."</span> << std::endl << std::endl;</div>
|
||||
@@ -587,13 +587,13 @@ Variables</h2></td></tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">constexpr</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel constexpr">constexpr</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>for assert </p>
|
||||
<p>for io operations for variable INF for the priority_queue of distances for make_pair function for store the graph, the distances, and the path </p>
|
||||
<p>for io operations for variable INF for the <a class="el" href="../../d1/d1b/classpriority__queue.html" title="STL class.">priority_queue</a> of distances for make_pair function for store the graph, the distances, and the path </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">bidirectional_dijkstra.cpp</a>.</p>
|
||||
|
||||
@@ -605,7 +605,7 @@ Variables</h2></td></tr>
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html">bidirectional_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>
|
||||
<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