mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-23 05:12:40 +08:00
Documentation for 93a700c7e9
This commit is contained in:
realstealthninja
@@ -138,11 +138,10 @@ $(function(){initNavTree('df/d82/breadth__first__search_8cpp.html','../../'); in
|
||||
<code>#include <map></code><br />
|
||||
<code>#include <queue></code><br />
|
||||
<code>#include <string></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for breadth_first_search.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dec/breadth__first__search_8cpp__incl.svg" width="642" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dec/breadth__first__search_8cpp__incl.svg" width="560" 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="../../df/d82/breadth__first__search_8cpp_source.html">Go to the source code of this file.</a></p>
|
||||
@@ -209,28 +208,28 @@ Functions</h2></td></tr>
|
||||
</div><div class="memdoc">
|
||||
<p>Main function </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00186">186</a> of file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 186</span> {</div>
|
||||
<div class="line"><span class="lineno"> 187</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
|
||||
<div class="line"><span class="lineno"> 188</span> <span class="keywordtype">size_t</span> edges = 0;</div>
|
||||
<div class="line"><span class="lineno"> 189</span> std::cout << <span class="stringliteral">"Enter the number of edges: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 190</span> std::cin >> edges;</div>
|
||||
<div class="line"><span class="lineno"> 191</span> </div>
|
||||
<div class="line"><span class="lineno"> 192</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph<int></a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
|
||||
<div class="line"><span class="lineno"> 193</span> </div>
|
||||
<div class="line"><span class="lineno"> 194</span> std::cout << <span class="stringliteral">"Enter space-separated pairs of vertices that form edges: "</span></div>
|
||||
<div class="line"><span class="lineno"> 195</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 196</span> <span class="keywordflow">while</span> (edges--) {</div>
|
||||
<div class="line"><span class="lineno"> 197</span> <span class="keywordtype">int</span> u = 0, v = 0;</div>
|
||||
<div class="line"><span class="lineno"> 198</span> std::cin >> u >> v;</div>
|
||||
<div class="line"><span class="lineno"> 199</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(u, v);</div>
|
||||
<div class="line"><span class="lineno"> 200</span> }</div>
|
||||
<div class="line"><span class="lineno"> 201</span> </div>
|
||||
<div class="line"><span class="lineno"> 202</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(0);</div>
|
||||
<div class="line"><span class="lineno"> 203</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 204</span>}</div>
|
||||
<div class="ttc" id="abreadth__first__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00139">breadth_first_search.cpp:139</a></div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00064">breadth_first_search.cpp:64</a></div></div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00185">185</a> of file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 185</span> {</div>
|
||||
<div class="line"><span class="lineno"> 186</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
|
||||
<div class="line"><span class="lineno"> 187</span> <span class="keywordtype">size_t</span> edges = 0;</div>
|
||||
<div class="line"><span class="lineno"> 188</span> std::cout << <span class="stringliteral">"Enter the number of edges: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 189</span> std::cin >> edges;</div>
|
||||
<div class="line"><span class="lineno"> 190</span> </div>
|
||||
<div class="line"><span class="lineno"> 191</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph<int></a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
|
||||
<div class="line"><span class="lineno"> 192</span> </div>
|
||||
<div class="line"><span class="lineno"> 193</span> std::cout << <span class="stringliteral">"Enter space-separated pairs of vertices that form edges: "</span></div>
|
||||
<div class="line"><span class="lineno"> 194</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 195</span> <span class="keywordflow">while</span> (edges--) {</div>
|
||||
<div class="line"><span class="lineno"> 196</span> <span class="keywordtype">int</span> u = 0, v = 0;</div>
|
||||
<div class="line"><span class="lineno"> 197</span> std::cin >> u >> v;</div>
|
||||
<div class="line"><span class="lineno"> 198</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(u, v);</div>
|
||||
<div class="line"><span class="lineno"> 199</span> }</div>
|
||||
<div class="line"><span class="lineno"> 200</span> </div>
|
||||
<div class="line"><span class="lineno"> 201</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(0);</div>
|
||||
<div class="line"><span class="lineno"> 202</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 203</span>}</div>
|
||||
<div class="ttc" id="abreadth__first__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00138">breadth_first_search.cpp:138</a></div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00063">breadth_first_search.cpp:63</a></div></div>
|
||||
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -262,51 +261,51 @@ Functions</h2></td></tr>
|
||||
<p>Test 2 Begin</p>
|
||||
<p>Test 3 Begins</p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00139">139</a> of file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 139</span> {</div>
|
||||
<div class="line"><span class="lineno"> 141</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph<int></a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
|
||||
<div class="line"><span class="lineno"> 142</span> std::map<int, bool> correct_result;</div>
|
||||
<div class="line"><span class="lineno"> 143</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(0, 1);</div>
|
||||
<div class="line"><span class="lineno"> 144</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(1, 2);</div>
|
||||
<div class="line"><span class="lineno"> 145</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(2, 3);</div>
|
||||
<div class="line"><span class="lineno"> 146</span> correct_result[0] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 147</span> correct_result[1] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 148</span> correct_result[2] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 149</span> correct_result[3] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 150</span> </div>
|
||||
<div class="line"><span class="lineno"> 151</span> std::map<int, bool> returned_result = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(2);</div>
|
||||
<div class="line"><span class="lineno"> 152</span> </div>
|
||||
<div class="line"><span class="lineno"> 153</span> assert(returned_result == correct_result);</div>
|
||||
<div class="line"><span class="lineno"> 154</span> std::cout << <span class="stringliteral">"Test 1 Passed..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 155</span></div>
|
||||
<div class="line"><span class="lineno"> 157</span> returned_result = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(0);</div>
|
||||
<div class="line"><span class="lineno"> 158</span> </div>
|
||||
<div class="line"><span class="lineno"> 159</span> assert(returned_result == correct_result);</div>
|
||||
<div class="line"><span class="lineno"> 160</span> std::cout << <span class="stringliteral">"Test 2 Passed..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 161</span></div>
|
||||
<div class="line"><span class="lineno"> 163</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph<std::string></a> g2;</div>
|
||||
<div class="line"><span class="lineno"> 164</span> </div>
|
||||
<div class="line"><span class="lineno"> 165</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Gorakhpur"</span>, <span class="stringliteral">"Lucknow"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 166</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Gorakhpur"</span>, <span class="stringliteral">"Kanpur"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 167</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Lucknow"</span>, <span class="stringliteral">"Agra"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 168</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Kanpur"</span>, <span class="stringliteral">"Agra"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 169</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Lucknow"</span>, <span class="stringliteral">"Prayagraj"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 170</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Agra"</span>, <span class="stringliteral">"Noida"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 171</span> </div>
|
||||
<div class="line"><span class="lineno"> 172</span> std::map<std::string, bool> correct_res;</div>
|
||||
<div class="line"><span class="lineno"> 173</span> std::map<std::string, bool> returned_res =</div>
|
||||
<div class="line"><span class="lineno"> 174</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">breadth_first_search</a>(<span class="stringliteral">"Kanpur"</span>);</div>
|
||||
<div class="line"><span class="lineno"> 175</span> correct_res[<span class="stringliteral">"Gorakhpur"</span>] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 176</span> correct_res[<span class="stringliteral">"Lucknow"</span>] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 177</span> correct_res[<span class="stringliteral">"Kanpur"</span>] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 178</span> correct_res[<span class="stringliteral">"Agra"</span>] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 179</span> correct_res[<span class="stringliteral">"Prayagraj"</span>] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 180</span> correct_res[<span class="stringliteral">"Noida"</span>] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 181</span> assert(correct_res == returned_res);</div>
|
||||
<div class="line"><span class="lineno"> 182</span> std::cout << <span class="stringliteral">"Test 3 Passed..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 183</span>}</div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_a3755ec9e6a842238c7f4aac10b661981"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">graph::Graph::breadth_first_search</a></div><div class="ttdeci">std::map< T, bool > breadth_first_search(T src)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00096">breadth_first_search.cpp:96</a></div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_a877b2cba40d8d46dde6fb4209effed19"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">graph::Graph::add_edge</a></div><div class="ttdeci">void add_edge(T u, T v, bool bidir=true)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00074">breadth_first_search.cpp:74</a></div></div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00138">138</a> of file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 138</span> {</div>
|
||||
<div class="line"><span class="lineno"> 140</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph<int></a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
|
||||
<div class="line"><span class="lineno"> 141</span> std::map<int, bool> correct_result;</div>
|
||||
<div class="line"><span class="lineno"> 142</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(0, 1);</div>
|
||||
<div class="line"><span class="lineno"> 143</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(1, 2);</div>
|
||||
<div class="line"><span class="lineno"> 144</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(2, 3);</div>
|
||||
<div class="line"><span class="lineno"> 145</span> correct_result[0] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 146</span> correct_result[1] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 147</span> correct_result[2] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 148</span> correct_result[3] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 149</span> </div>
|
||||
<div class="line"><span class="lineno"> 150</span> std::map<int, bool> returned_result = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(2);</div>
|
||||
<div class="line"><span class="lineno"> 151</span> </div>
|
||||
<div class="line"><span class="lineno"> 152</span> assert(returned_result == correct_result);</div>
|
||||
<div class="line"><span class="lineno"> 153</span> std::cout << <span class="stringliteral">"Test 1 Passed..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 154</span></div>
|
||||
<div class="line"><span class="lineno"> 156</span> returned_result = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(0);</div>
|
||||
<div class="line"><span class="lineno"> 157</span> </div>
|
||||
<div class="line"><span class="lineno"> 158</span> assert(returned_result == correct_result);</div>
|
||||
<div class="line"><span class="lineno"> 159</span> std::cout << <span class="stringliteral">"Test 2 Passed..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 160</span></div>
|
||||
<div class="line"><span class="lineno"> 162</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph<std::string></a> g2;</div>
|
||||
<div class="line"><span class="lineno"> 163</span> </div>
|
||||
<div class="line"><span class="lineno"> 164</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Gorakhpur"</span>, <span class="stringliteral">"Lucknow"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 165</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Gorakhpur"</span>, <span class="stringliteral">"Kanpur"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 166</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Lucknow"</span>, <span class="stringliteral">"Agra"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 167</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Kanpur"</span>, <span class="stringliteral">"Agra"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 168</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Lucknow"</span>, <span class="stringliteral">"Prayagraj"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 169</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">"Agra"</span>, <span class="stringliteral">"Noida"</span>, <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 170</span> </div>
|
||||
<div class="line"><span class="lineno"> 171</span> std::map<std::string, bool> correct_res;</div>
|
||||
<div class="line"><span class="lineno"> 172</span> std::map<std::string, bool> returned_res =</div>
|
||||
<div class="line"><span class="lineno"> 173</span> g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">breadth_first_search</a>(<span class="stringliteral">"Kanpur"</span>);</div>
|
||||
<div class="line"><span class="lineno"> 174</span> correct_res[<span class="stringliteral">"Gorakhpur"</span>] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 175</span> correct_res[<span class="stringliteral">"Lucknow"</span>] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 176</span> correct_res[<span class="stringliteral">"Kanpur"</span>] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 177</span> correct_res[<span class="stringliteral">"Agra"</span>] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 178</span> correct_res[<span class="stringliteral">"Prayagraj"</span>] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 179</span> correct_res[<span class="stringliteral">"Noida"</span>] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 180</span> assert(correct_res == returned_res);</div>
|
||||
<div class="line"><span class="lineno"> 181</span> std::cout << <span class="stringliteral">"Test 3 Passed..."</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 182</span>}</div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_a3755ec9e6a842238c7f4aac10b661981"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">graph::Graph::breadth_first_search</a></div><div class="ttdeci">std::map< T, bool > breadth_first_search(T src)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00095">breadth_first_search.cpp:95</a></div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1_graph_html_a877b2cba40d8d46dde6fb4209effed19"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">graph::Graph::add_edge</a></div><div class="ttdeci">void add_edge(T u, T v, bool bidir=true)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00073">breadth_first_search.cpp:73</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
Reference in New Issue
Block a user