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

Documentation for d4962c3032

Browse Source
This commit is contained in:
realstealthninja
2025-08-14 04:29:32 +00:00
parent 67d95bf85f
commit e364889a34
986 changed files with 1471 additions and 1483 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
d1/d9a/hopcroft__karp_8cpp_source.html
View File

@@ -301,7 +301,7 @@ $(function(){initNavTree('d1/d9a/hopcroft__karp_8cpp_source.html','../../','');
<div class="foldopen" id="foldopen00255" data-start="{" data-end="}">
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9"> 255</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>(){</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// Sample test case 1</span></div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="keywordtype">int</span> v1a = 3, v1b = 5, e1 = 2; <span class="comment">// vertices of left side, right side and edges</span></div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="keywordtype">int</span> v1a = 3, v1b = 5; <span class="comment">// vertices of left side, right side and edges</span></div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <a class="code hl_class" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> g1(v1a, v1b); <span class="comment">// execute the algorithm </span></div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> </div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> g1.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(0,1);</div>
@@ -313,7 +313,7 @@ $(function(){initNavTree('d1/d9a/hopcroft__karp_8cpp_source.html','../../','');
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> assert(res1 == expected_res1); <span class="comment">// assert check to ensure that the algorithm executed correctly for test 1</span></div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> </div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="comment">// Sample test case 2</span></div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keywordtype">int</span> v2a = 4, v2b = 4, e2 = 6; <span class="comment">// vertices of left side, right side and edges</span></div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keywordtype">int</span> v2a = 4, v2b = 4; <span class="comment">// vertices of left side, right side and edges</span></div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <a class="code hl_class" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> g2(v2a, v2b); <span class="comment">// execute the algorithm </span></div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> </div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> g2.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(1,1);</div>
@@ -329,7 +329,7 @@ $(function(){initNavTree('d1/d9a/hopcroft__karp_8cpp_source.html','../../','');
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> assert(res2 == expected_res2); <span class="comment">// assert check to ensure that the algorithm executed correctly for test 2</span></div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> </div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="comment">// Sample test case 3</span></div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="keywordtype">int</span> v3a = 6, v3b = 6, e3 = 4; <span class="comment">// vertices of left side, right side and edges</span></div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="keywordtype">int</span> v3a = 6, v3b = 6; <span class="comment">// vertices of left side, right side and edges</span></div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <a class="code hl_class" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> g3(v3a, v3b); <span class="comment">// execute the algorithm </span></div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> </div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> g3.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(0,1);</div>