backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-12 11:37:18 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 6376bf46af

Browse Source
This commit is contained in:
github-actions
2023-09-27 18:42:32 +00:00
parent d28eba1fef
commit b5b4d78981
5708 changed files with 52275 additions and 51112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

139
d8/d69/classgraph_1_1_h_k_graph.html
View File

@@ -3,7 +3,7 @@
<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.9.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: graph::HKGraph Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -115,55 +115,51 @@ Collaboration diagram for graph::HKGraph:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:af02b0c83911070ac6d95fc9905e58aa9"><td class="memItemLeft" align="right" valign="top"><a id="af02b0c83911070ac6d95fc9905e58aa9" name="af02b0c83911070ac6d95fc9905e58aa9"></a>
<tr class="memitem:af02b0c83911070ac6d95fc9905e58aa9" id="r_af02b0c83911070ac6d95fc9905e58aa9"><td class="memItemLeft" align="right" valign="top"><a id="af02b0c83911070ac6d95fc9905e58aa9" name="af02b0c83911070ac6d95fc9905e58aa9"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>HKGraph</b> ()</td></tr>
<tr class="memdesc:af02b0c83911070ac6d95fc9905e58aa9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default Constructor for initialization. <br /></td></tr>
<tr class="separator:af02b0c83911070ac6d95fc9905e58aa9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0da5aa674d3b3e54a38251ee60d7cd64"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64">HKGraph</a> (int <a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>, int <a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a>)</td></tr>
<tr class="memitem:a0da5aa674d3b3e54a38251ee60d7cd64" id="r_a0da5aa674d3b3e54a38251ee60d7cd64"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64">HKGraph</a> (int <a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>, int <a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a>)</td></tr>
<tr class="memdesc:a0da5aa674d3b3e54a38251ee60d7cd64"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor for initialization. <br /></td></tr>
<tr class="separator:a0da5aa674d3b3e54a38251ee60d7cd64"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3b49011c09cf90a116ab53bef61cd95a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a> (int u, int v)</td></tr>
<tr class="memitem:a3b49011c09cf90a116ab53bef61cd95a" id="r_a3b49011c09cf90a116ab53bef61cd95a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a> (int u, int v)</td></tr>
<tr class="memdesc:a3b49011c09cf90a116ab53bef61cd95a"><td class="mdescLeft">&#160;</td><td class="mdescRight">function to add edge from u to v <br /></td></tr>
<tr class="separator:a3b49011c09cf90a116ab53bef61cd95a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7491add14d9fc04f679114ca6d6f0f93"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">bfs</a> ()</td></tr>
<tr class="memitem:a7491add14d9fc04f679114ca6d6f0f93" id="r_a7491add14d9fc04f679114ca6d6f0f93"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">bfs</a> ()</td></tr>
<tr class="memdesc:a7491add14d9fc04f679114ca6d6f0f93"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function checks for the possibility of augmented path availability. <br /></td></tr>
<tr class="separator:a7491add14d9fc04f679114ca6d6f0f93"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae794950cb3407b6b47d3dc986cf714c0"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">dfs</a> (int u)</td></tr>
<tr class="memitem:ae794950cb3407b6b47d3dc986cf714c0" id="r_ae794950cb3407b6b47d3dc986cf714c0"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">dfs</a> (int u)</td></tr>
<tr class="memdesc:ae794950cb3407b6b47d3dc986cf714c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">This functions checks whether an augmenting path is available exists beginning with free vertex u. <br /></td></tr>
<tr class="separator:ae794950cb3407b6b47d3dc986cf714c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9dbda80d02bdc26c3e8ff7330c9be75d"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">hopcroftKarpAlgorithm</a> ()</td></tr>
<tr class="memitem:a9dbda80d02bdc26c3e8ff7330c9be75d" id="r_a9dbda80d02bdc26c3e8ff7330c9be75d"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">hopcroftKarpAlgorithm</a> ()</td></tr>
<tr class="memdesc:a9dbda80d02bdc26c3e8ff7330c9be75d"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function counts the number of augmenting paths between left and right sides of the Bipartite graph. <br /></td></tr>
<tr class="separator:a9dbda80d02bdc26c3e8ff7330c9be75d"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a3d9101e3b4598159005fd028b9b0ff74"><td class="memItemLeft" align="right" valign="top"><a id="a3d9101e3b4598159005fd028b9b0ff74" name="a3d9101e3b4598159005fd028b9b0ff74"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>m</b> {}</td></tr>
<tr class="memdesc:a3d9101e3b4598159005fd028b9b0ff74"><td class="mdescLeft">&#160;</td><td class="mdescRight">m is the number of vertices on left side of Bipartite <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> <br /></td></tr>
<tr class="memitem:a3d9101e3b4598159005fd028b9b0ff74" id="r_a3d9101e3b4598159005fd028b9b0ff74"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a> {}</td></tr>
<tr class="memdesc:a3d9101e3b4598159005fd028b9b0ff74"><td class="mdescLeft">&#160;</td><td class="mdescRight">m is the number of vertices on left side of Bipartite <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> <br /></td></tr>
<tr class="separator:a3d9101e3b4598159005fd028b9b0ff74"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6f5a9fdbb83ef731d739ba6707e21c3c"><td class="memItemLeft" align="right" valign="top"><a id="a6f5a9fdbb83ef731d739ba6707e21c3c" name="a6f5a9fdbb83ef731d739ba6707e21c3c"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> {}</td></tr>
<tr class="memdesc:a6f5a9fdbb83ef731d739ba6707e21c3c"><td class="mdescLeft">&#160;</td><td class="mdescRight">n is the number of vertices on right side of Bipartite <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> <br /></td></tr>
<tr class="memitem:a6f5a9fdbb83ef731d739ba6707e21c3c" id="r_a6f5a9fdbb83ef731d739ba6707e21c3c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> {}</td></tr>
<tr class="memdesc:a6f5a9fdbb83ef731d739ba6707e21c3c"><td class="mdescLeft">&#160;</td><td class="mdescRight">n is the number of vertices on right side of Bipartite <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> <br /></td></tr>
<tr class="separator:a6f5a9fdbb83ef731d739ba6707e21c3c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae6d069bd16d6eafa6e08c7e5f735eda6"><td class="memItemLeft" align="right" valign="top"><a id="ae6d069bd16d6eafa6e08c7e5f735eda6" name="ae6d069bd16d6eafa6e08c7e5f735eda6"></a>
const int&#160;</td><td class="memItemRight" valign="bottom"><b>NIL</b> {0}</td></tr>
<tr class="memitem:ae6d069bd16d6eafa6e08c7e5f735eda6" id="r_ae6d069bd16d6eafa6e08c7e5f735eda6"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae6d069bd16d6eafa6e08c7e5f735eda6">NIL</a> {0}</td></tr>
<tr class="separator:ae6d069bd16d6eafa6e08c7e5f735eda6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a44742cb9cfecd1a4493970af9b8bbb15"><td class="memItemLeft" align="right" valign="top"><a id="a44742cb9cfecd1a4493970af9b8bbb15" name="a44742cb9cfecd1a4493970af9b8bbb15"></a>
const int&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b> {INT_MAX}</td></tr>
<tr class="memitem:a44742cb9cfecd1a4493970af9b8bbb15" id="r_a44742cb9cfecd1a4493970af9b8bbb15"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a44742cb9cfecd1a4493970af9b8bbb15">INF</a> {INT_MAX}</td></tr>
<tr class="separator:a44742cb9cfecd1a4493970af9b8bbb15"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a35893def7a1c5cd60907b4893117796f"><td class="memItemLeft" align="right" valign="top"><a id="a35893def7a1c5cd60907b4893117796f" name="a35893def7a1c5cd60907b4893117796f"></a>
<tr class="memitem:a35893def7a1c5cd60907b4893117796f" id="r_a35893def7a1c5cd60907b4893117796f"><td class="memItemLeft" align="right" valign="top"><a id="a35893def7a1c5cd60907b4893117796f" name="a35893def7a1c5cd60907b4893117796f"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>adj</b></td></tr>
<tr class="memdesc:a35893def7a1c5cd60907b4893117796f"><td class="mdescLeft">&#160;</td><td class="mdescRight">adj[u] stores adjacents of left side and 0 is used for dummy vertex <br /></td></tr>
<tr class="separator:a35893def7a1c5cd60907b4893117796f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a86ebff8a70cbfedd05281993d5d1987b"><td class="memItemLeft" align="right" valign="top"><a id="a86ebff8a70cbfedd05281993d5d1987b" name="a86ebff8a70cbfedd05281993d5d1987b"></a>
<tr class="memitem:a86ebff8a70cbfedd05281993d5d1987b" id="r_a86ebff8a70cbfedd05281993d5d1987b"><td class="memItemLeft" align="right" valign="top"><a id="a86ebff8a70cbfedd05281993d5d1987b" name="a86ebff8a70cbfedd05281993d5d1987b"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>pair_u</b></td></tr>
<tr class="memdesc:a86ebff8a70cbfedd05281993d5d1987b"><td class="mdescLeft">&#160;</td><td class="mdescRight">value of vertex 'u' ranges from 1 to m <br /></td></tr>
<tr class="separator:a86ebff8a70cbfedd05281993d5d1987b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a976ee239402cc2726a280e781c706d77"><td class="memItemLeft" align="right" valign="top"><a id="a976ee239402cc2726a280e781c706d77" name="a976ee239402cc2726a280e781c706d77"></a>
<tr class="memitem:a976ee239402cc2726a280e781c706d77" id="r_a976ee239402cc2726a280e781c706d77"><td class="memItemLeft" align="right" valign="top"><a id="a976ee239402cc2726a280e781c706d77" name="a976ee239402cc2726a280e781c706d77"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>pair_v</b></td></tr>
<tr class="memdesc:a976ee239402cc2726a280e781c706d77"><td class="mdescLeft">&#160;</td><td class="mdescRight">value of vertex 'v' ranges from 1 to n <br /></td></tr>
<tr class="separator:a976ee239402cc2726a280e781c706d77"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6a0228bbba3818447fcf6b56128b552a"><td class="memItemLeft" align="right" valign="top"><a id="a6a0228bbba3818447fcf6b56128b552a" name="a6a0228bbba3818447fcf6b56128b552a"></a>
<tr class="memitem:a6a0228bbba3818447fcf6b56128b552a" id="r_a6a0228bbba3818447fcf6b56128b552a"><td class="memItemLeft" align="right" valign="top"><a id="a6a0228bbba3818447fcf6b56128b552a" name="a6a0228bbba3818447fcf6b56128b552a"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>dist</b></td></tr>
<tr class="memdesc:a6a0228bbba3818447fcf6b56128b552a"><td class="mdescLeft">&#160;</td><td class="mdescRight">dist represents the distance between vertex 'u' and vertex 'v' <br /></td></tr>
<tr class="separator:a6a0228bbba3818447fcf6b56128b552a"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -466,6 +462,103 @@ Here is the call graph for this function:</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg" width="531" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="a44742cb9cfecd1a4493970af9b8bbb15" name="a44742cb9cfecd1a4493970af9b8bbb15"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a44742cb9cfecd1a4493970af9b8bbb15">&#9670;&#160;</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">const int graph::HKGraph::INF {INT_MAX}</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 71</span>{INT_MAX};</div>
</div><!-- fragment -->
</div>
</div>
<a id="a3d9101e3b4598159005fd028b9b0ff74" name="a3d9101e3b4598159005fd028b9b0ff74"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3d9101e3b4598159005fd028b9b0ff74">&#9670;&#160;</a></span>m</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int graph::HKGraph::m {}</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>m is the number of vertices on left side of Bipartite <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> </p>
<div class="fragment"><div class="line"><span class="lineno"> 68</span>{}; <span class="comment">///&lt; m is the number of vertices on left side of Bipartite Graph</span></div>
</div><!-- fragment -->
</div>
</div>
<a id="a6f5a9fdbb83ef731d739ba6707e21c3c" name="a6f5a9fdbb83ef731d739ba6707e21c3c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6f5a9fdbb83ef731d739ba6707e21c3c">&#9670;&#160;</a></span>n</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int graph::HKGraph::n {}</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>n is the number of vertices on right side of Bipartite <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> </p>
<div class="fragment"><div class="line"><span class="lineno"> 69</span>{}; <span class="comment">///&lt; n is the number of vertices on right side of Bipartite Graph</span></div>
</div><!-- fragment -->
</div>
</div>
<a id="ae6d069bd16d6eafa6e08c7e5f735eda6" name="ae6d069bd16d6eafa6e08c7e5f735eda6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae6d069bd16d6eafa6e08c7e5f735eda6">&#9670;&#160;</a></span>NIL</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">const int graph::HKGraph::NIL {0}</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 70</span>{0};</div>
</div><!-- fragment -->
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
@@ -477,7 +570,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></li><li class="navelem"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</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.9.7 </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.9.8 </li>
</ul>
</div>
</body>

2
d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.map
View File

@@ -1,5 +1,5 @@
<map id="graph::HKGraph::addEdge" name="graph::HKGraph::addEdge">
<area shape="rect" id="Node000001" title="function to add edge from u to v" alt="" coords="5,5,180,31"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="228,5,382,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="180,16,213,16,213,21,180,21"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="180,16,212,16,212,21,180,21"/>
</map>

6
d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::HKGraph::addEdge Pages: 1 -->
<svg width="291pt" height="27pt"
@@ -40,8 +40,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M131.24,-9.62C139.27,-9.62 147.49,-9.62 155.57,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="155.45,-13.13 165.45,-9.62 155.45,-6.13 155.45,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M131.24,-9.62C139.09,-9.62 147.12,-9.62 155.02,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.93,-13.13 164.93,-9.63 154.93,-6.13 154.93,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.5 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

6
d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::HKGraph::addEdge Pages: 1 -->
<svg width="291pt" height="27pt"
@@ -30,8 +30,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M131.24,-9.62C139.27,-9.62 147.49,-9.62 155.57,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="155.45,-13.13 165.45,-9.62 155.45,-6.13 155.45,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M131.24,-9.62C139.09,-9.62 147.12,-9.62 155.02,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.93,-13.13 164.93,-9.63 154.93,-6.13 154.93,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.map
View File

@@ -1,5 +1,5 @@
<map id="graph::HKGraph::bfs" name="graph::HKGraph::bfs">
<area shape="rect" id="Node000001" title="This function checks for the possibility of augmented path availability." alt="" coords="5,5,147,31"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="195,5,307,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,16,180,16,180,21,147,21"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,16,179,16,179,21,147,21"/>
</map>

6
d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::HKGraph::bfs Pages: 1 -->
<svg width="234pt" height="27pt"
@@ -40,8 +40,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.33,-9.62 122.79,-9.62 130.97,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.9,-13.13 140.9,-9.62 130.9,-6.13 130.9,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.14,-9.62 122.4,-9.62 130.41,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.39,-13.13 140.39,-9.63 130.39,-6.13 130.39,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.5 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

6
d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::HKGraph::bfs Pages: 1 -->
<svg width="234pt" height="27pt"
@@ -30,8 +30,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.33,-9.62 122.79,-9.62 130.97,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.9,-13.13 140.9,-9.62 130.9,-6.13 130.9,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.14,-9.62 122.4,-9.62 130.41,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.39,-13.13 140.39,-9.63 130.39,-6.13 130.39,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

10
d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.map
View File

@@ -1,11 +1,11 @@
<map id="graph::HKGraph::hopcroftKarpAlgorithm" name="graph::HKGraph::hopcroftKarpAlgorithm">
<area shape="rect" id="Node000001" title="This function counts the number of augmenting paths between left and right sides of the Bipartite gra..." alt="" coords="5,35,176,76"/>
<area shape="rect" id="Node000002" href="$d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93" title="This function checks for the possibility of augmented path availability." alt="" coords="224,5,365,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,37,209,31,210,36,176,43"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,37,208,31,209,37,176,43"/>
<area shape="rect" id="Node000004" href="$d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0" title="This functions checks whether an augmenting path is available exists beginning with free vertex u." alt="" coords="224,79,365,104"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="176,68,210,74,209,79,176,73"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="176,68,209,74,208,79,176,73"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="413,43,525,68"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="358,29,399,38,398,43,357,34"/>
<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="359,75,398,67,399,73,360,81"/>
<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="265,80,259,70,262,60,275,54,294,52,317,55,327,62,324,67,315,60,294,57,276,59,266,64,264,69,269,77"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="358,29,398,38,397,43,357,34"/>
<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="359,75,397,68,398,73,360,81"/>
<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="265,80,259,70,262,60,275,54,294,52,316,55,327,61,324,66,314,60,294,57,276,59,266,64,264,69,269,77"/>
</map>

22
d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::HKGraph::hopcroftKarpAlgorithm Pages: 1 -->
<svg width="398pt" height="82pt"
@@ -41,8 +41,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M127.99,-48.34C136.18,-49.86 144.58,-51.42 152.77,-52.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.93,-56.53 162.4,-54.91 153.2,-49.64 151.93,-56.53"/>
<path fill="none" stroke="#63b8ff" d="M127.99,-48.34C136,-49.82 144.2,-51.35 152.22,-52.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.44,-56.25 161.91,-54.63 152.72,-49.37 151.44,-56.25"/>
</a>
</g>
</g>
@@ -59,8 +59,8 @@
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M127.99,-25.33C136.18,-23.86 144.58,-22.36 152.77,-20.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="153.17,-24.2 162.4,-18.99 151.94,-17.31 153.17,-24.2"/>
<path fill="none" stroke="#63b8ff" d="M127.99,-25.33C136,-23.9 144.2,-22.43 152.22,-20.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.68,-24.47 161.91,-19.26 151.45,-17.58 152.68,-24.47"/>
</a>
</g>
</g>
@@ -77,8 +77,8 @@
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M264.37,-54.52C274.23,-52.38 284.71,-50.11 294.77,-47.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295.43,-51.14 304.46,-45.6 293.95,-44.3 295.43,-51.14"/>
<path fill="none" stroke="#63b8ff" d="M264.37,-54.52C274.13,-52.4 284.49,-50.15 294.44,-47.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="294.95,-51.47 303.98,-45.93 293.47,-44.62 294.95,-51.47"/>
</a>
</g>
</g>
@@ -86,8 +86,8 @@
<g id="edge5_Node000004_Node000003" class="edge">
<title>Node4&#45;&gt;Node3</title>
<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M265.83,-19.68C275.31,-21.66 285.3,-23.75 294.91,-25.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="294.03,-29.36 304.54,-27.98 295.46,-22.51 294.03,-29.36"/>
<path fill="none" stroke="#63b8ff" d="M265.83,-19.68C275.11,-21.62 284.87,-23.66 294.29,-25.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.55,-29.05 304.05,-27.67 294.98,-22.2 293.55,-29.05"/>
</a>
</g>
</g>
@@ -95,8 +95,8 @@
<g id="edge4_Node000004_Node000004" class="edge">
<title>Node4&#45;&gt;Node4</title>
<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M196.22,-19.54C186.86,-28.15 193.7,-37.25 216.75,-37.25 230.08,-37.25 237.98,-34.21 240.48,-29.98"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="243.55,-29.07 237.28,-20.54 236.86,-31.12 243.55,-29.07"/>
<path fill="none" stroke="#63b8ff" d="M196.22,-19.54C186.86,-28.15 193.7,-37.25 216.75,-37.25 229.36,-37.25 237.11,-34.53 240.02,-30.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="243.44,-29.88 237.64,-21.01 236.64,-31.56 243.44,-29.88"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.4 KiB

After

Width:  |  Height:  |  Size: 5.4 KiB

22
d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::HKGraph::hopcroftKarpAlgorithm Pages: 1 -->
<svg width="398pt" height="82pt"
@@ -31,8 +31,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M127.99,-48.34C136.18,-49.86 144.58,-51.42 152.77,-52.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.93,-56.53 162.4,-54.91 153.2,-49.64 151.93,-56.53"/>
<path fill="none" stroke="#63b8ff" d="M127.99,-48.34C136,-49.82 144.2,-51.35 152.22,-52.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.44,-56.25 161.91,-54.63 152.72,-49.37 151.44,-56.25"/>
</a>
</g>
</g>
@@ -49,8 +49,8 @@
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M127.99,-25.33C136.18,-23.86 144.58,-22.36 152.77,-20.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="153.17,-24.2 162.4,-18.99 151.94,-17.31 153.17,-24.2"/>
<path fill="none" stroke="#63b8ff" d="M127.99,-25.33C136,-23.9 144.2,-22.43 152.22,-20.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.68,-24.47 161.91,-19.26 151.45,-17.58 152.68,-24.47"/>
</a>
</g>
</g>
@@ -67,8 +67,8 @@
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M264.37,-54.52C274.23,-52.38 284.71,-50.11 294.77,-47.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295.43,-51.14 304.46,-45.6 293.95,-44.3 295.43,-51.14"/>
<path fill="none" stroke="#63b8ff" d="M264.37,-54.52C274.13,-52.4 284.49,-50.15 294.44,-47.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="294.95,-51.47 303.98,-45.93 293.47,-44.62 294.95,-51.47"/>
</a>
</g>
</g>
@@ -76,8 +76,8 @@
<g id="edge5_Node000004_Node000003" class="edge">
<title>Node4&#45;&gt;Node3</title>
<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M265.83,-19.68C275.31,-21.66 285.3,-23.75 294.91,-25.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="294.03,-29.36 304.54,-27.98 295.46,-22.51 294.03,-29.36"/>
<path fill="none" stroke="#63b8ff" d="M265.83,-19.68C275.11,-21.62 284.87,-23.66 294.29,-25.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.55,-29.05 304.05,-27.67 294.98,-22.2 293.55,-29.05"/>
</a>
</g>
</g>
@@ -85,8 +85,8 @@
<g id="edge4_Node000004_Node000004" class="edge">
<title>Node4&#45;&gt;Node4</title>
<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M196.22,-19.54C186.86,-28.15 193.7,-37.25 216.75,-37.25 230.08,-37.25 237.98,-34.21 240.48,-29.98"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="243.55,-29.07 237.28,-20.54 236.86,-31.12 243.55,-29.07"/>
<path fill="none" stroke="#63b8ff" d="M196.22,-19.54C186.86,-28.15 193.7,-37.25 216.75,-37.25 229.36,-37.25 237.11,-34.53 240.02,-30.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="243.44,-29.88 237.64,-21.01 236.64,-31.56 243.44,-29.88"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.6 KiB

After

Width:  |  Height:  |  Size: 4.6 KiB

4
d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.map
View File

@@ -1,6 +1,6 @@
<map id="graph::HKGraph::dfs" name="graph::HKGraph::dfs">
<area shape="rect" id="Node000001" title="This functions checks whether an augmenting path is available exists beginning with free vertex u." alt="" coords="5,29,147,55"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="46,30,41,21,44,11,56,5,76,3,98,6,109,13,106,17,96,11,76,8,58,10,48,15,46,20,51,28"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="46,30,41,21,44,11,56,5,76,3,97,5,108,12,106,16,96,10,76,8,58,10,48,15,46,20,51,28"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="195,29,307,55"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="147,40,180,40,180,45,147,45"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="147,40,179,40,179,45,147,45"/>
</map>

10
d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::HKGraph::dfs Pages: 1 -->
<svg width="234pt" height="45pt"
@@ -31,8 +31,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.47,-19.54C23.11,-28.15 29.95,-37.25 53,-37.25 66.33,-37.25 74.23,-34.21 76.73,-29.98"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.8,-29.07 73.53,-20.54 73.11,-31.12 79.8,-29.07"/>
<path fill="none" stroke="#63b8ff" d="M32.47,-19.54C23.11,-28.15 29.95,-37.25 53,-37.25 65.61,-37.25 73.36,-34.53 76.27,-30.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.69,-29.88 73.89,-21.01 72.89,-31.56 79.69,-29.88"/>
</a>
</g>
</g>
@@ -49,8 +49,8 @@
<g id="edge2_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.33,-9.62 122.79,-9.62 130.97,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.9,-13.13 140.9,-9.62 130.9,-6.13 130.9,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.14,-9.62 122.4,-9.62 130.41,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.39,-13.13 140.39,-9.63 130.39,-6.13 130.39,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 2.9 KiB

10
d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::HKGraph::dfs Pages: 1 -->
<svg width="234pt" height="45pt"
@@ -21,8 +21,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.47,-19.54C23.11,-28.15 29.95,-37.25 53,-37.25 66.33,-37.25 74.23,-34.21 76.73,-29.98"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.8,-29.07 73.53,-20.54 73.11,-31.12 79.8,-29.07"/>
<path fill="none" stroke="#63b8ff" d="M32.47,-19.54C23.11,-28.15 29.95,-37.25 53,-37.25 65.61,-37.25 73.36,-34.53 76.27,-30.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.69,-29.88 73.89,-21.01 72.89,-31.56 79.69,-29.88"/>
</a>
</g>
</g>
@@ -39,8 +39,8 @@
<g id="edge2_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.33,-9.62 122.79,-9.62 130.97,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.9,-13.13 140.9,-9.62 130.9,-6.13 130.9,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.14,-9.62 122.4,-9.62 130.41,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.39,-13.13 140.39,-9.63 130.39,-6.13 130.39,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB