288 lines
37 KiB
HTML
288 lines
37 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!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">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: dijkstra.cc Source File</title>
|
|
<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>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.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>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.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 style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</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">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('dijkstra_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<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">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">dijkstra.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="dijkstra_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <set></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  </div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="adjustable__priority__queue_8h.html">ortools/base/adjustable_priority_queue.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="shortestpaths_8h.html">ortools/graph/shortestpaths.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  </div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Priority queue element</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">class </span>Element {</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> Element& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keywordflow">return</span> distance_ != other.distance_ ? distance_ > other.distance_</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  : node_ > other.node_;</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  }</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordtype">void</span> SetHeapIndex(<span class="keywordtype">int</span> h) { heap_index_ = h; }</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordtype">int</span> GetHeapIndex()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> heap_index_; }</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordtype">void</span> set_distance(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> distance) { distance_ = distance; }</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> distance()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> distance_; }</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordtype">void</span> set_node(<span class="keywordtype">int</span> node) { node_ = node; }</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordtype">int</span> node()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node_; }</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  </div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> distance_ = 0;</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordtype">int</span> heap_index_ = -1;</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordtype">int</span> node_ = -1;</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> };</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="keyword">template</span> <<span class="keyword">class</span> S></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dijkstra_s_p.html"> 49</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_dijkstra_s_p.html">DijkstraSP</a> {</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dijkstra_s_p.html#a16f35892a0d488e2eafd3bc2f5762503"> 51</a></span>  <span class="keyword">static</span> constexpr <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_dijkstra_s_p.html#a16f35892a0d488e2eafd3bc2f5762503">kInfinity</a> = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a> / 2;</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  </div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dijkstra_s_p.html#a26e3b87ba6aa299f848e480bf3d22a86"> 53</a></span>  <a class="code" href="classoperations__research_1_1_dijkstra_s_p.html#a26e3b87ba6aa299f848e480bf3d22a86">DijkstraSP</a>(<span class="keywordtype">int</span> node_count, <span class="keywordtype">int</span> start_node,</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<span class="keywordtype">int</span>, <span class="keywordtype">int</span>)> graph, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> disconnected_distance)</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  : node_count_(node_count),</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  start_node_(start_node),</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  graph_(std::move(graph)),</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  disconnected_distance_(disconnected_distance),</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  predecessor_(new int[node_count]),</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  elements_(node_count) {}</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  </div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dijkstra_s_p.html#a48b9f284876a7bfaa4d6841cac33554e"> 62</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_dijkstra_s_p.html#a48b9f284876a7bfaa4d6841cac33554e">ShortestPath</a>(<span class="keywordtype">int</span> end_node, std::vector<int>* nodes) {</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  Initialize();</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">bool</span> found = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">while</span> (!frontier_.<a class="code" href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>()) {</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> distance;</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordtype">int</span> node = SelectClosestNode(&distance);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">if</span> (distance == <a class="code" href="classoperations__research_1_1_dijkstra_s_p.html#a16f35892a0d488e2eafd3bc2f5762503">kInfinity</a>) {</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  found = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node == end_node) {</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  found = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  Update(node);</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span> (found) {</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  FindPath(end_node, nodes);</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">return</span> found;</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  </div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">void</span> Initialize() {</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < node_count_; i++) {</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  elements_[i].set_node(i);</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">if</span> (i == start_node_) {</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  predecessor_[i] = -1;</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  elements_[i].set_distance(0);</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  frontier_.<a class="code" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(&elements_[i]);</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  elements_[i].set_distance(<a class="code" href="classoperations__research_1_1_dijkstra_s_p.html#a16f35892a0d488e2eafd3bc2f5762503">kInfinity</a>);</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  predecessor_[i] = start_node_;</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  not_visited_.insert(i);</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  </div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordtype">int</span> SelectClosestNode(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* distance) {</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node = frontier_.<a class="code" href="class_adjustable_priority_queue.html#a8e7578f2135632c4d0ce66fd5936231e">Top</a>()->node();</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  *distance = frontier_.<a class="code" href="class_adjustable_priority_queue.html#a8e7578f2135632c4d0ce66fd5936231e">Top</a>()->distance();</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  frontier_.<a class="code" href="class_adjustable_priority_queue.html#a701a584ce72cccbcce9cb0656b6c898b">Pop</a>();</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  not_visited_.erase(node);</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  added_to_the_frontier_.erase(node);</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">return</span> node;</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordtype">void</span> Update(<span class="keywordtype">int</span> node) {</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& other_node : not_visited_) {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> graph_node_i = graph_(node, other_node);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (graph_node_i != disconnected_distance_) {</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">if</span> (added_to_the_frontier_.find(other_node) ==</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  added_to_the_frontier_.end()) {</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  frontier_.<a class="code" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(&elements_[other_node]);</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  added_to_the_frontier_.insert(other_node);</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  }</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> other_distance = elements_[node].distance() + graph_node_i;</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span> (elements_[other_node].distance() > other_distance) {</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  elements_[other_node].set_distance(other_distance);</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  frontier_.<a class="code" href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">NoteChangedPriority</a>(&elements_[other_node]);</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  predecessor_[other_node] = node;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  }</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordtype">void</span> FindPath(<span class="keywordtype">int</span> dest, std::vector<int>* nodes) {</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordtype">int</span> j = dest;</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  nodes->push_back(j);</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">while</span> (predecessor_[j] != -1) {</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  nodes->push_back(predecessor_[j]);</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  j = predecessor_[j];</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  }</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  </div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node_count_;</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> start_node_;</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<span class="keywordtype">int</span>, <span class="keywordtype">int</span>)> graph_;</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> disconnected_distance_;</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  std::unique_ptr<int[]> predecessor_;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<Element></a> frontier_;</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  std::vector<Element> elements_;</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  S not_visited_;</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  S added_to_the_frontier_;</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> };</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  </div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ae8d40400ca48351e9df5a54eba245a9c"> 147</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research.html#ae8d40400ca48351e9df5a54eba245a9c">DijkstraShortestPath</a>(<span class="keywordtype">int</span> node_count, <span class="keywordtype">int</span> start_node, <span class="keywordtype">int</span> end_node,</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<span class="keywordtype">int</span>, <span class="keywordtype">int</span>)> graph,</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> disconnected_distance,</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  std::vector<int>* nodes) {</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <a class="code" href="classoperations__research_1_1_dijkstra_s_p.html">DijkstraSP<absl::flat_hash_set<int></a>> bf(</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  node_count, start_node, std::move(graph), disconnected_distance);</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">return</span> bf.<a class="code" href="classoperations__research_1_1_dijkstra_s_p.html#a48b9f284876a7bfaa4d6841cac33554e">ShortestPath</a>(end_node, nodes);</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> }</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  </div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a5ac9fec524473a07cf586c653652f721"> 156</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research.html#a5ac9fec524473a07cf586c653652f721">StableDijkstraShortestPath</a>(<span class="keywordtype">int</span> node_count, <span class="keywordtype">int</span> start_node, <span class="keywordtype">int</span> end_node,</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<span class="keywordtype">int</span>, <span class="keywordtype">int</span>)> graph,</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> disconnected_distance,</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  std::vector<int>* nodes) {</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <a class="code" href="classoperations__research_1_1_dijkstra_s_p.html">DijkstraSP<std::set<int></a>> bf(node_count, start_node, std::move(graph),</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  disconnected_distance);</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">return</span> bf.<a class="code" href="classoperations__research_1_1_dijkstra_s_p.html#a48b9f284876a7bfaa4d6841cac33554e">ShortestPath</a>(end_node, nodes);</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> }</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aadjustable__priority__queue_8h_html"><div class="ttname"><a href="adjustable__priority__queue_8h.html">adjustable_priority_queue.h</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html"><div class="ttname"><a href="class_adjustable_priority_queue.html">AdjustablePriorityQueue< Element ></a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a506169056c5f470fabdf77aa1934a5a3"><div class="ttname"><a href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">AdjustablePriorityQueue::NoteChangedPriority</a></div><div class="ttdeci">void NoteChangedPriority(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00074">adjustable_priority_queue.h:74</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a701a584ce72cccbcce9cb0656b6c898b"><div class="ttname"><a href="class_adjustable_priority_queue.html#a701a584ce72cccbcce9cb0656b6c898b">AdjustablePriorityQueue::Pop</a></div><div class="ttdeci">void Pop()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00117">adjustable_priority_queue.h:117</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a8e12342fc420701fbffd97025421575a"><div class="ttname"><a href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a">AdjustablePriorityQueue::IsEmpty</a></div><div class="ttdeci">bool IsEmpty() const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00127">adjustable_priority_queue.h:127</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a8e7578f2135632c4d0ce66fd5936231e"><div class="ttname"><a href="class_adjustable_priority_queue.html#a8e7578f2135632c4d0ce66fd5936231e">AdjustablePriorityQueue::Top</a></div><div class="ttdeci">T * Top()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00087">adjustable_priority_queue.h:87</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_ac312fa979ea8afd5deabd6b581b3bb1f"><div class="ttname"><a href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">AdjustablePriorityQueue::Add</a></div><div class="ttdeci">void Add(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00049">adjustable_priority_queue.h:49</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dijkstra_s_p_html"><div class="ttname"><a href="classoperations__research_1_1_dijkstra_s_p.html">operations_research::DijkstraSP</a></div><div class="ttdef"><b>Definition:</b> <a href="dijkstra_8cc_source.html#l00049">dijkstra.cc:49</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dijkstra_s_p_html_a16f35892a0d488e2eafd3bc2f5762503"><div class="ttname"><a href="classoperations__research_1_1_dijkstra_s_p.html#a16f35892a0d488e2eafd3bc2f5762503">operations_research::DijkstraSP::kInfinity</a></div><div class="ttdeci">static constexpr int64 kInfinity</div><div class="ttdef"><b>Definition:</b> <a href="dijkstra_8cc_source.html#l00051">dijkstra.cc:51</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dijkstra_s_p_html_a26e3b87ba6aa299f848e480bf3d22a86"><div class="ttname"><a href="classoperations__research_1_1_dijkstra_s_p.html#a26e3b87ba6aa299f848e480bf3d22a86">operations_research::DijkstraSP::DijkstraSP</a></div><div class="ttdeci">DijkstraSP(int node_count, int start_node, std::function< int64(int, int)> graph, int64 disconnected_distance)</div><div class="ttdef"><b>Definition:</b> <a href="dijkstra_8cc_source.html#l00053">dijkstra.cc:53</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dijkstra_s_p_html_a48b9f284876a7bfaa4d6841cac33554e"><div class="ttname"><a href="classoperations__research_1_1_dijkstra_s_p.html#a48b9f284876a7bfaa4d6841cac33554e">operations_research::DijkstraSP::ShortestPath</a></div><div class="ttdeci">bool ShortestPath(int end_node, std::vector< int > *nodes)</div><div class="ttdef"><b>Definition:</b> <a href="dijkstra_8cc_source.html#l00062">dijkstra.cc:62</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719"><div class="ttname"><a href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div><div class="ttdeci">static const int64 kint64max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00053">integral_types.h:53</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a5ac9fec524473a07cf586c653652f721"><div class="ttname"><a href="namespaceoperations__research.html#a5ac9fec524473a07cf586c653652f721">operations_research::StableDijkstraShortestPath</a></div><div class="ttdeci">bool StableDijkstraShortestPath(int node_count, int start_node, int end_node, std::function< int64(int, int)> graph, int64 disconnected_distance, std::vector< int > *nodes)</div><div class="ttdef"><b>Definition:</b> <a href="dijkstra_8cc_source.html#l00156">dijkstra.cc:156</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ae8d40400ca48351e9df5a54eba245a9c"><div class="ttname"><a href="namespaceoperations__research.html#ae8d40400ca48351e9df5a54eba245a9c">operations_research::DijkstraShortestPath</a></div><div class="ttdeci">bool DijkstraShortestPath(int node_count, int start_node, int end_node, std::function< int64(int, int)> graph, int64 disconnected_distance, std::vector< int > *nodes)</div><div class="ttdef"><b>Definition:</b> <a href="dijkstra_8cc_source.html#l00147">dijkstra.cc:147</a></div></div>
|
|
<div class="ttc" id="ashortestpaths_8h_html"><div class="ttname"><a href="shortestpaths_8h.html">shortestpaths.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_725f3a5915051842f84e3ea508be2a62.html">graph</a></li><li class="navelem"><a class="el" href="dijkstra_8cc.html">dijkstra.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|