mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 04:42:10 +08:00
234 lines
23 KiB
HTML
234 lines
23 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++: bit_manipulation/travelling_salesman_using_bit_manipulation.cpp Source File</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('d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.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">travelling_salesman_using_bit_manipulation.cpp</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <algorithm></span> </div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <cassert></span> </div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include <iostream></span> </div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include <limits></span> </div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include <vector></span> </div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="keyword">namespace </span>travelling_salesman_using_bit_manipulation {</div>
|
|
<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1"> 53</a></span>std::uint64_t <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> std::vector<std::vector<uint32_t>></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> dist, <span class="comment">// dist is the adjacency matrix containing the distance.</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// setOfCities as a bit represent the cities/nodes. Ex: if</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// setOfCities = 2 => 0010(in binary) means representing the</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// city/node B if city/nodes are represented as D->C->B->A.</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> std::uint64_t setOfCities,</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> std::uint64_t city, <span class="comment">// city is taken to track our current city/node</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// movement,where we are currently.</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> std::uint64_t n, <span class="comment">// n is the no of cities we have.</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> std::vector<std::vector<uint32_t>></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> &<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>) <span class="comment">// dp is taken to memorize the state to avoid recomputition</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span>{</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// base case;</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordflow">if</span> (setOfCities == (1 << n) - 1) { <span class="comment">// we have covered all the cities</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">return</span> dist[city][0]; <span class="comment">// return the cost from the current city to the</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// original city.</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] != -1) {</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city];</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> }</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// otherwise try all possible options</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> uint64_t ans = 2147483647;</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> choice = 0; choice < n; choice++) {</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// check if the city is visited or not.</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">if</span> ((setOfCities & (1 << choice)) ==</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> 0) { <span class="comment">// this means that this perticular city is not visited.</span></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> std::uint64_t subProb =</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> dist[city][choice] +</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> dist, setOfCities | (1 << choice), choice, n, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// Here we are doing a recursive call to tsp with the updated set of</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// city/node and choice which tells that where we are currently.</span></div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> ans = std::min(ans, subProb);</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] = ans;</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">return</span> ans;</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span>} <span class="comment">// namespace travelling_salesman_using_bit_manipulation</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span>} <span class="comment">// namespace bit_manipulation</span></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span></div>
|
|
<div class="foldopen" id="foldopen00100" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 100</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// 1st test-case</span></div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> std::vector<std::vector<uint32_t>> dist = {</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> {0, 20, 42, 35}, {20, 0, 30, 34}, {42, 30, 0, 12}, {35, 34, 12, 0}};</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> uint32_t V = dist.size();</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> std::vector<std::vector<uint32_t>> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(1 << V, std::vector<uint32_t>(V, -1));</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> travelling_salesman_using_bit_manipulation(dist, 1, 0, V, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>) ==</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> 97);</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> std::cout << <span class="stringliteral">"1st test-case: passed!"</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> </div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// 2nd test-case</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> dist = {{0, 5, 10, 15}, {5, 0, 20, 30}, {10, 20, 0, 35}, {15, 30, 35, 0}};</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> V = dist.size();</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> std::vector<std::vector<uint32_t>> dp1(1 << V,</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> std::vector<uint32_t>(V, -1));</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> travelling_salesman_using_bit_manipulation(dist, 1, 0, V, dp1) ==</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> 75);</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> std::cout << <span class="stringliteral">"2nd test-case: passed!"</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// 3rd test-case</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> dist = {{0, 10, 15, 20}, {10, 0, 35, 25}, {15, 35, 0, 30}, {20, 25, 30, 0}};</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> V = dist.size();</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> std::vector<std::vector<uint32_t>> dp2(1 << V,</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> std::vector<uint32_t>(V, -1));</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> travelling_salesman_using_bit_manipulation(dist, 1, 0, V, dp2) ==</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> 80);</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> </div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> std::cout << <span class="stringliteral">"3rd test-case: passed!"</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span></div>
|
|
<div class="foldopen" id="foldopen00139" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 139</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span>}</div>
|
|
</div>
|
|
<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</div></div>
|
|
<div class="ttc" id="anamespacedp_html"><div class="ttname"><a href="../../df/d88/namespacedp.html">dp</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
|
|
<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00100">travelling_salesman_using_bit_manipulation.cpp:100</a></div></div>
|
|
<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_ad08f082be02c3437c2fe89cb035fcee1"><div class="ttname"><a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation</a></div><div class="ttdeci">std::uint64_t travelling_salesman_using_bit_manipulation(std::vector< std::vector< uint32_t > > dist, std::uint64_t setOfCities, std::uint64_t city, std::uint64_t n, std::vector< std::vector< uint32_t > > &dp)</div><div class="ttdoc">The function implements travellingSalesman using bitmanipulation.</div><div class="ttdef"><b>Definition</b> <a href="#l00053">travelling_salesman_using_bit_manipulation.cpp:53</a></div></div>
|
|
<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00139">travelling_salesman_using_bit_manipulation.cpp:139</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html">travelling_salesman_using_bit_manipulation.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>
|