mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 04:42:10 +08:00
601 lines
47 KiB
HTML
601 lines
47 KiB
HTML
<!-- HTML header for doxygen 1.12.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.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" />
|
|
<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="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
|
<script type="text/javascript">
|
|
DoxygenAwesomeDarkModeToggle.init()
|
|
</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="../../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/javascript">
|
|
window.MathJax = {
|
|
options: {
|
|
ignoreHtmlClass: 'tex2jax_ignore',
|
|
processHtmlClass: 'tex2jax_process'
|
|
},
|
|
loader: {
|
|
load: ['[tex]/ams']
|
|
},
|
|
tex: {
|
|
macros: {},
|
|
packages: ['base','configmacros','ams']
|
|
}
|
|
};
|
|
</script>
|
|
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
|
<td id="projectalign">
|
|
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">All the algorithms implemented in C++</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</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">
|
|
$(function(){initNavTree('d7/d07/bidirectional__dijkstra_8cpp.html','../../',''); });
|
|
</script>
|
|
<div id="container">
|
|
<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="headertitle"><div class="title">bidirectional_dijkstra.cpp File Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<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>)
|
|
<a href="#details">More...</a></p>
|
|
<div class="textblock"><code>#include <cassert></code><br />
|
|
<code>#include <cstdint></code><br />
|
|
<code>#include <iostream></code><br />
|
|
<code>#include <limits></code><br />
|
|
<code>#include <queue></code><br />
|
|
<code>#include <utility></code><br />
|
|
<code>#include <vector></code><br />
|
|
</div><div class="textblock"><div class="dynheader">
|
|
Include dependency graph for bidirectional_dijkstra.cpp:</div>
|
|
<div class="dyncontent">
|
|
<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 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
|
|
Namespaces</h2></td></tr>
|
|
<tr class="memitem:graph" id="r_graph"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. <br /></td></tr>
|
|
<tr class="memitem:bidirectional_5Fdijkstra" id="r_bidirectional_5Fdijkstra"><td class="memItemLeft" align="right" valign="top">namespace  </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"> </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>
|
|
</table><table class="memberdecls">
|
|
<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 </td><td class="memItemRight" valign="bottom"><a class="el" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a> (std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t u, uint64_t v, uint64_t w)</td></tr>
|
|
<tr class="memdesc:a69172365aebde9be1997157f6f80e0cf"><td class="mdescLeft"> </td><td class="mdescRight">Function that add edge between two nodes or vertices of graph. <br /></td></tr>
|
|
<tr class="memitem:a22f1b7277e1dd4190f25014b48487ce6" id="r_a22f1b7277e1dd4190f25014b48487ce6"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="#a22f1b7277e1dd4190f25014b48487ce6">graph::bidirectional_dijkstra::Shortest_Path_Distance</a> (const std::vector< uint64_t > &workset_, const std::vector< std::vector< uint64_t > > &distance_)</td></tr>
|
|
<tr class="memdesc:a22f1b7277e1dd4190f25014b48487ce6"><td class="mdescLeft"> </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="memitem:a1b2df3d52a403ad46523ab90d3a723c1" id="r_a1b2df3d52a403ad46523ab90d3a723c1"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a> (std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t s, uint64_t t)</td></tr>
|
|
<tr class="memdesc:a1b2df3d52a403ad46523ab90d3a723c1"><td class="mdescLeft"> </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="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
|
|
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft"> </td><td class="mdescRight">Function to test the provided algorithm above. <br /></td></tr>
|
|
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
|
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <br /></td></tr>
|
|
</table><table class="memberdecls">
|
|
<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 </td><td class="memItemRight" valign="bottom"><a class="el" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = std::numeric_limits<int64_t>::max()</td></tr>
|
|
<tr class="memdesc:a330a2b0a904f01802ada1f8f3b28e76c"><td class="mdescLeft"> </td><td class="mdescRight">for assert <br /></td></tr>
|
|
</table>
|
|
<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&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><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">◆ </a></span>addEdge()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void graph::bidirectional_dijkstra::addEdge </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *</td> <td class="paramname"><span class="paramname"><em>adj1</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *</td> <td class="paramname"><span class="paramname"><em>adj2</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>u</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>v</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>w</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Function that add edge between two nodes or vertices of graph. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj1</td><td>adjacency list for the direct search </td></tr>
|
|
<tr><td class="paramname">adj2</td><td>adjacency list for the reverse search </td></tr>
|
|
<tr><td class="paramname">u</td><td>any node or vertex of graph </td></tr>
|
|
<tr><td class="paramname">v</td><td>any node or vertex of graph </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00046">46</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"> 48</span> {</div>
|
|
<div class="line"><span class="lineno"> 49</span> (*adj1)[u - 1].push_back(std::make_pair(v - 1, w));</div>
|
|
<div class="line"><span class="lineno"> 50</span> (*adj2)[v - 1].push_back(std::make_pair(u - 1, w));</div>
|
|
<div class="line"><span class="lineno"> 51</span> <span class="comment">// (*adj)[v - 1].push_back(std::make_pair(u - 1, w));</span></div>
|
|
<div class="line"><span class="lineno"> 52</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a1b2df3d52a403ad46523ab90d3a723c1" name="a1b2df3d52a403ad46523ab90d3a723c1"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a1b2df3d52a403ad46523ab90d3a723c1">◆ </a></span>Bidijkstra()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int graph::bidirectional_dijkstra::Bidijkstra </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *</td> <td class="paramname"><span class="paramname"><em>adj1</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *</td> <td class="paramname"><span class="paramname"><em>adj2</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>t</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>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. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj1</td><td>input graph </td></tr>
|
|
<tr><td class="paramname">adj2</td><td>input graph reversed </td></tr>
|
|
<tr><td class="paramname">s</td><td>source vertex </td></tr>
|
|
<tr><td class="paramname">t</td><td>target vertex</td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>shortest distance if target is reachable from source else -1 in case if target is not reachable from source. </dd></dl>
|
|
<p>n denotes the number of vertices in graph</p>
|
|
<p>setting all the distances initially to INF</p>
|
|
<p>creating a a vector of min heap using priority queue pq[0] contains the min heap for the direct search pq[1] contains the min heap for the reverse search</p>
|
|
<p>first element of pair contains the distance second element of pair contains the vertex</p>
|
|
<p>vector for store the nodes or vertices in the shortest path</p>
|
|
<p>vector for store the nodes or vertices visited</p>
|
|
<p>pushing the source vertex 's' with 0 distance in pq[0] min heap</p>
|
|
<p>marking the distance of source as 0</p>
|
|
<p>pushing the target vertex 't' with 0 distance in pq[1] min heap</p>
|
|
<p>marking the distance of target as 0</p>
|
|
<p>direct search</p>
|
|
<p>second element of pair denotes the node / vertex</p>
|
|
<p>first element of pair denotes the distance</p>
|
|
<p>for all the reachable vertex from the currently exploring vertex we will try to minimize the distance</p>
|
|
<p>minimizing distances</p>
|
|
<p>check if currentNode has already been visited</p>
|
|
<p>reversed search</p>
|
|
<p>second element of pair denotes the node / vertex</p>
|
|
<p>first element of pair denotes the distance</p>
|
|
<p>for all the reachable vertex from the currently exploring vertex we will try to minimize the distance</p>
|
|
<p>minimizing distances</p>
|
|
<p>check if currentNode has already been visited</p>
|
|
|
|
<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"> 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"> 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>
|
|
<div class="line"><span class="lineno"> 105</span> std::greater<std::pair<uint64_t, uint64_t>>>></div>
|
|
<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"> 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"> 116</span> dist[0][s] = 0;</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"> 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>
|
|
<div class="line"><span class="lineno"> 126</span> </div>
|
|
<div class="line"><span class="lineno"> 127</span> <span class="comment">// If pq[0].size() is equal to zero then the node/ vertex is not</span></div>
|
|
<div class="line"><span class="lineno"> 128</span> <span class="comment">// reachable from s</span></div>
|
|
<div class="line"><span class="lineno"> 129</span> <span class="keywordflow">if</span> (pq[0].size() == 0) {</div>
|
|
<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"> 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"> 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>
|
|
<div class="line"><span class="lineno"> 146</span> pq[0].push(std::make_pair(dist[0][edge.first], edge.first));</div>
|
|
<div class="line"><span class="lineno"> 147</span> }</div>
|
|
<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"> 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>
|
|
<div class="line"><span class="lineno"> 156</span> visited[currentNode] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><span class="lineno"> 158</span> </div>
|
|
<div class="line"><span class="lineno"> 159</span> <span class="comment">// If pq[1].size() is equal to zero then the node/ vertex is not</span></div>
|
|
<div class="line"><span class="lineno"> 160</span> <span class="comment">// reachable from t</span></div>
|
|
<div class="line"><span class="lineno"> 161</span> <span class="keywordflow">if</span> (pq[1].size() == 0) {</div>
|
|
<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"> 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"> 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>
|
|
<div class="line"><span class="lineno"> 178</span> pq[1].push(std::make_pair(dist[1][edge.first], edge.first));</div>
|
|
<div class="line"><span class="lineno"> 179</span> }</div>
|
|
<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"> 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>
|
|
<div class="line"><span class="lineno"> 188</span> visited[currentNode] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><span class="lineno"> 189</span> }</div>
|
|
<div class="line"><span class="lineno"> 190</span> <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><span class="lineno"> 191</span>}</div>
|
|
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a22f1b7277e1dd4190f25014b48487ce6"><div class="ttname"><a href="#a22f1b7277e1dd4190f25014b48487ce6">graph::bidirectional_dijkstra::Shortest_Path_Distance</a></div><div class="ttdeci">uint64_t Shortest_Path_Distance(const std::vector< uint64_t > &workset_, const std::vector< std::vector< uint64_t > > &distance_)</div><div class="ttdoc">This function returns the shortest distance from the source to the target if there is path between ve...</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00062">bidirectional_dijkstra.cpp:62</a></div></div>
|
|
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a330a2b0a904f01802ada1f8f3b28e76c"><div class="ttname"><a href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a></div><div class="ttdeci">constexpr int64_t INF</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00024">bidirectional_dijkstra.cpp:24</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </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>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00249">249</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"> 249</span> {</div>
|
|
<div class="line"><span class="lineno"> 250</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// running predefined tests</span></div>
|
|
<div class="line"><span class="lineno"> 251</span> uint64_t vertices = uint64_t();</div>
|
|
<div class="line"><span class="lineno"> 252</span> uint64_t edges = uint64_t();</div>
|
|
<div class="line"><span class="lineno"> 253</span> std::cout << <span class="stringliteral">"Enter the number of vertices : "</span>;</div>
|
|
<div class="line"><span class="lineno"> 254</span> std::cin >> vertices;</div>
|
|
<div class="line"><span class="lineno"> 255</span> std::cout << <span class="stringliteral">"Enter the number of edges : "</span>;</div>
|
|
<div class="line"><span class="lineno"> 256</span> std::cin >> edges;</div>
|
|
<div class="line"><span class="lineno"> 257</span> </div>
|
|
<div class="line"><span class="lineno"> 258</span> std::vector<std::vector<std::pair<uint64_t, uint64_t>>> adj1(</div>
|
|
<div class="line"><span class="lineno"> 259</span> vertices, std::vector<std::pair<uint64_t, uint64_t>>());</div>
|
|
<div class="line"><span class="lineno"> 260</span> std::vector<std::vector<std::pair<uint64_t, uint64_t>>> adj2(</div>
|
|
<div class="line"><span class="lineno"> 261</span> vertices, std::vector<std::pair<uint64_t, uint64_t>>());</div>
|
|
<div class="line"><span class="lineno"> 262</span> </div>
|
|
<div class="line"><span class="lineno"> 263</span> uint64_t u = uint64_t(), v = uint64_t(), w = uint64_t();</div>
|
|
<div class="line"><span class="lineno"> 264</span> std::cout << <span class="stringliteral">"Enter the edges by three integers in this form: u v w "</span></div>
|
|
<div class="line"><span class="lineno"> 265</span> << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 266</span> std::cout << <span class="stringliteral">"Example: if there is and edge between node 1 and node 4 with "</span></div>
|
|
<div class="line"><span class="lineno"> 267</span> <span class="stringliteral">"weight 7 enter: 1 4 7, and then press enter"</span></div>
|
|
<div class="line"><span class="lineno"> 268</span> << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 269</span> <span class="keywordflow">while</span> (edges--) {</div>
|
|
<div class="line"><span class="lineno"> 270</span> std::cin >> u >> v >> w;</div>
|
|
<div class="line"><span class="lineno"> 271</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj1, &adj2, u, v, w);</div>
|
|
<div class="line"><span class="lineno"> 272</span> <span class="keywordflow">if</span> (edges != 0) {</div>
|
|
<div class="line"><span class="lineno"> 273</span> std::cout << <span class="stringliteral">"Enter the next edge"</span> << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 274</span> }</div>
|
|
<div class="line"><span class="lineno"> 275</span> }</div>
|
|
<div class="line"><span class="lineno"> 276</span> </div>
|
|
<div class="line"><span class="lineno"> 277</span> uint64_t s = uint64_t(), t = uint64_t();</div>
|
|
<div class="line"><span class="lineno"> 278</span> std::cout</div>
|
|
<div class="line"><span class="lineno"> 279</span> << <span class="stringliteral">"Enter the source node and the target node separated by a space"</span></div>
|
|
<div class="line"><span class="lineno"> 280</span> << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 281</span> std::cout << <span class="stringliteral">"Example: If the source node is 5 and the target node is 6 "</span></div>
|
|
<div class="line"><span class="lineno"> 282</span> <span class="stringliteral">"enter: 5 6 and press enter"</span></div>
|
|
<div class="line"><span class="lineno"> 283</span> << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 284</span> std::cin >> s >> t;</div>
|
|
<div class="line"><span class="lineno"> 285</span> <span class="keywordtype">int</span> dist =</div>
|
|
<div class="line"><span class="lineno"> 286</span> <a class="code hl_function" href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a>(&adj1, &adj2, s - 1, t - 1);</div>
|
|
<div class="line"><span class="lineno"> 287</span> <span class="keywordflow">if</span> (dist == -1) {</div>
|
|
<div class="line"><span class="lineno"> 288</span> std::cout << <span class="stringliteral">"Target not reachable from source"</span> << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 289</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><span class="lineno"> 290</span> std::cout << <span class="stringliteral">"Shortest Path Distance : "</span> << dist << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 291</span> }</div>
|
|
<div class="line"><span class="lineno"> 292</span> </div>
|
|
<div class="line"><span class="lineno"> 293</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><span class="lineno"> 294</span>}</div>
|
|
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a1b2df3d52a403ad46523ab90d3a723c1"><div class="ttname"><a href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a></div><div class="ttdeci">int Bidijkstra(std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t s, uint64_t t)</div><div class="ttdoc">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00087">bidirectional_dijkstra.cpp:87</a></div></div>
|
|
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the provided algorithm above.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00200">bidirectional_dijkstra.cpp:200</a></div></div>
|
|
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a69172365aebde9be1997157f6f80e0cf"><div class="ttname"><a href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a></div><div class="ttdeci">void addEdge(std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t > > > *adj2, uint64_t u, uint64_t v, uint64_t w)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00046">bidirectional_dijkstra.cpp:46</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a22f1b7277e1dd4190f25014b48487ce6" name="a22f1b7277e1dd4190f25014b48487ce6"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a22f1b7277e1dd4190f25014b48487ce6">◆ </a></span>Shortest_Path_Distance()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">uint64_t graph::bidirectional_dijkstra::Shortest_Path_Distance </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< uint64_t > &</td> <td class="paramname"><span class="paramname"><em>workset_</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const std::vector< std::vector< uint64_t > > &</td> <td class="paramname"><span class="paramname"><em>distance_</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>This function returns the shortest distance from the source to the target if there is path between vertices 's' and 't'. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">workset_</td><td>vertices visited in the search </td></tr>
|
|
<tr><td class="paramname">distance_</td><td>vector of distances from the source to the target and from the target to the source </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00062">62</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"> 64</span> {</div>
|
|
<div class="line"><span class="lineno"> 65</span> int64_t distance = <a class="code hl_variable" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>;</div>
|
|
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">for</span> (uint64_t i : workset_) {</div>
|
|
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">if</span> (distance_[0][i] + distance_[1][i] < distance) {</div>
|
|
<div class="line"><span class="lineno"> 68</span> distance = distance_[0][i] + distance_[1][i];</div>
|
|
<div class="line"><span class="lineno"> 69</span> }</div>
|
|
<div class="line"><span class="lineno"> 70</span> }</div>
|
|
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">return</span> distance;</div>
|
|
<div class="line"><span class="lineno"> 72</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">◆ </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">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">static</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Function to test the provided algorithm above. </p>
|
|
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00200">200</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"> 200</span> {</div>
|
|
<div class="line"><span class="lineno"> 201</span> std::cout << <span class="stringliteral">"Initiatinig Predefined Tests..."</span> << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 202</span> std::cout << <span class="stringliteral">"Initiating Test 1..."</span> << std::endl;</div>
|
|
<div class="line"><span class="lineno"> 203</span> std::vector<std::vector<std::pair<uint64_t, uint64_t>>> adj1_1(</div>
|
|
<div class="line"><span class="lineno"> 204</span> 4, std::vector<std::pair<uint64_t, uint64_t>>());</div>
|
|
<div class="line"><span class="lineno"> 205</span> std::vector<std::vector<std::pair<uint64_t, uint64_t>>> adj1_2(</div>
|
|
<div class="line"><span class="lineno"> 206</span> 4, std::vector<std::pair<uint64_t, uint64_t>>());</div>
|
|
<div class="line"><span class="lineno"> 207</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj1_1, &adj1_2, 1, 2, 1);</div>
|
|
<div class="line"><span class="lineno"> 208</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj1_1, &adj1_2, 4, 1, 2);</div>
|
|
<div class="line"><span class="lineno"> 209</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj1_1, &adj1_2, 2, 3, 2);</div>
|
|
<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(<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(<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>
|
|
<div class="line"><span class="lineno"> 223</span> std::vector<std::vector<std::pair<uint64_t, uint64_t>>> adj2_1(</div>
|
|
<div class="line"><span class="lineno"> 224</span> 5, std::vector<std::pair<uint64_t, uint64_t>>());</div>
|
|
<div class="line"><span class="lineno"> 225</span> std::vector<std::vector<std::pair<uint64_t, uint64_t>>> adj2_2(</div>
|
|
<div class="line"><span class="lineno"> 226</span> 5, std::vector<std::pair<uint64_t, uint64_t>>());</div>
|
|
<div class="line"><span class="lineno"> 227</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 1, 2, 4);</div>
|
|
<div class="line"><span class="lineno"> 228</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 1, 3, 2);</div>
|
|
<div class="line"><span class="lineno"> 229</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 2, 3, 2);</div>
|
|
<div class="line"><span class="lineno"> 230</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 3, 2, 1);</div>
|
|
<div class="line"><span class="lineno"> 231</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 2, 4, 2);</div>
|
|
<div class="line"><span class="lineno"> 232</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 3, 5, 4);</div>
|
|
<div class="line"><span class="lineno"> 233</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 5, 4, 1);</div>
|
|
<div class="line"><span class="lineno"> 234</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 2, 5, 3);</div>
|
|
<div class="line"><span class="lineno"> 235</span> <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 3, 4, 4);</div>
|
|
<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(<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>
|
|
<div class="line"><span class="lineno"> 243</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<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">◆ </a></span>INF</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int64_t INF = std::numeric_limits<int64_t>::max()</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<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 <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>
|
|
|
|
</div>
|
|
</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 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>
|
|
</html>
|