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

Documentation for f1eddf4d65

Browse Source
This commit is contained in:
realstealthninja
2025-07-09 10:53:16 +00:00
parent e7edde96ab
commit b41207008f
2497 changed files with 31270 additions and 40283 deletions
Download Patch File Download Diff File Expand all files Collapse all files

64
d7/d07/bidirectional__dijkstra_8cpp.html
View File

@@ -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.13.2"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<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" />
@@ -19,7 +19,6 @@
<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>
@@ -60,26 +59,20 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<!-- Generated by Doxygen 1.14.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 */
$(function() { codefold.init(); });
</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 -->
@@ -94,10 +87,9 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d7/d07/bidirectional__dijkstra_8cpp.html','../../'); initResizable(true); });
/* @license-end */
$(function(){initNavTree('d7/d07/bidirectional__dijkstra_8cpp.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
@@ -121,10 +113,6 @@ $(function(){initNavTree('d7/d07/bidirectional__dijkstra_8cpp.html','../../'); i
</div>
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> &#124;
<a href="#var-members">Variables</a> </div>
<div class="headertitle"><div class="title">bidirectional_dijkstra.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
@@ -141,51 +129,43 @@ $(function(){initNavTree('d7/d07/bidirectional__dijkstra_8cpp.html','../../'); i
</div><div class="textblock"><div class="dynheader">
Include dependency graph for bidirectional_dijkstra.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/df6/bidirectional__dijkstra_8cpp__incl.svg" width="570" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../d1/df6/bidirectional__dijkstra_8cpp__incl.svg" width="570" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
<p><a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" 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="../../df/dce/namespacegraph.html">graph</a></td></tr>
<tr class="memitem:graph" id="r_graph"><td class="memItemLeft" align="right" valign="top">namespace &#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="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="../../d4/d13/namespacebidirectional__dijkstra.html">bidirectional_dijkstra</a></td></tr>
<tr class="memitem:bidirectional_5Fdijkstra" id="r_bidirectional_5Fdijkstra"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d13/namespacebidirectional__dijkstra.html">bidirectional_dijkstra</a></td></tr>
<tr class="memdesc:d4/d13/namespacebidirectional__dijkstra"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for [Bidirectional Dijkstra Shortest Path] (<a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra</a>) algorithm. <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>
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a69172365aebde9be1997157f6f80e0cf" id="r_a69172365aebde9be1997157f6f80e0cf"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a> (std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t u, uint64_t v, uint64_t w)</td></tr>
<tr class="memdesc:a69172365aebde9be1997157f6f80e0cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph. <br /></td></tr>
<tr class="separator:a69172365aebde9be1997157f6f80e0cf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a22f1b7277e1dd4190f25014b48487ce6" id="r_a22f1b7277e1dd4190f25014b48487ce6"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a22f1b7277e1dd4190f25014b48487ce6">graph::bidirectional_dijkstra::Shortest_Path_Distance</a> (const std::vector&lt; uint64_t &gt; &amp;workset_, const std::vector&lt; std::vector&lt; uint64_t &gt; &gt; &amp;distance_)</td></tr>
<tr class="memdesc:a22f1b7277e1dd4190f25014b48487ce6"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function returns the shortest distance from the source to the target if there is path between vertices 's' and 't'. <br /></td></tr>
<tr class="separator:a22f1b7277e1dd4190f25014b48487ce6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1b2df3d52a403ad46523ab90d3a723c1" id="r_a1b2df3d52a403ad46523ab90d3a723c1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a> (std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t s, uint64_t t)</td></tr>
<tr class="memdesc:a1b2df3d52a403ad46523ab90d3a723c1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source. <br /></td></tr>
<tr class="separator:a1b2df3d52a403ad46523ab90d3a723c1"><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">Function to test the provided algorithm above. <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><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
<tr class="heading"><td colspan="2"><h2 id="header-var-members" class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top">constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = std::numeric_limits&lt;int64_t&gt;::max()</td></tr>
<tr class="memdesc:a330a2b0a904f01802ada1f8f3b28e76c"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert <br /></td></tr>
<tr class="separator:a330a2b0a904f01802ada1f8f3b28e76c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>[Bidirectional Dijkstra Shortest Path Algorithm] (<a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra</a>) </p>
<dl class="section author"><dt>Author</dt><dd><a href="http://github.com/Marinovsky" target="_blank">Marinovksy</a></dd></dl>
<p>This is basically the same Dijkstra Algorithm but faster because it goes from the source to the target and from target to the source and stops when finding a vertex visited already by the direct search or the reverse one. Here some simulations of it: <a href="https://www.youtube.com/watch?v=DINCL5cd_w0&t=24s">https://www.youtube.com/watch?v=DINCL5cd_w0&amp;t=24s</a> </p>
<p>This is basically the same Dijkstra Algorithm but faster because it goes from the source to the target and from target to the source and stops when finding a vertex visited already by the direct search or the reverse one. Here some simulations of it: <a href="https://www.youtube.com/watch?v=DINCL5cd_w0&amp;t=24s">https://www.youtube.com/watch?v=DINCL5cd_w0&amp;t=24s</a> </p>
<p class="definition">Definition in file <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">bidirectional_dijkstra.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="a69172365aebde9be1997157f6f80e0cf" name="a69172365aebde9be1997157f6f80e0cf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a69172365aebde9be1997157f6f80e0cf">&#9670;&#160;</a></span>addEdge()</h2>
@@ -507,7 +487,7 @@ Variables</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void tests </td>
<td class="memname">void tests </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -571,7 +551,7 @@ Variables</h2></td></tr>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Variable Documentation</h2>
<a name="doc-var-members" id="doc-var-members"></a><h2 id="header-doc-var-members" class="groupheader">Variable Documentation</h2>
<a id="a330a2b0a904f01802ada1f8f3b28e76c" name="a330a2b0a904f01802ada1f8f3b28e76c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a330a2b0a904f01802ada1f8f3b28e76c">&#9670;&#160;</a></span>INF</h2>
@@ -601,11 +581,19 @@ Variables</h2></td></tr>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<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.13.2 </li>
<li class="navelem"><a href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a 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.14.0 </li>
</ul>
</div>
</body>