backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-29 04:53:55 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for c26eea874d

Browse Source
This commit is contained in:
realstealthninja
2025-05-19 11:38:33 +00:00
parent c7a9a42397
commit 14583a2f33
2829 changed files with 30266 additions and 21669 deletions
Download Patch File Download Diff File Expand all files Collapse all files

83
dc/d61/classgraph_1_1_graph.html
View File

@@ -4,7 +4,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.12.0"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: graph::Graph&lt; T &gt; Class Template Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -60,7 +60,7 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<!-- Generated by Doxygen 1.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -167,7 +167,7 @@ Private Attributes</h2></td></tr>
<div class="textblock"><div class="compoundTemplParams">template&lt;typename T&gt;<br />
class graph::Graph&lt; T &gt;</div><p>Class for representing a graph as an adjacency list. Its vertices are indexed 0, 1, ..., N - 1. </p>
<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a8839fa14bff19d2deab4a618447c13e5" name="a8839fa14bff19d2deab4a618447c13e5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8839fa14bff19d2deab4a618447c13e5">&#9670;&#160;</a></span>Graph()</h2>
@@ -175,7 +175,7 @@ class graph::Graph&lt; T &gt;</div><p>Class for representing a graph as an adjac
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
template&lt;typename T&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
@@ -193,7 +193,7 @@ template&lt;typename T &gt; </div>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -209,12 +209,13 @@ template&lt;typename T &gt; </div>
<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>.resize(N);</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;edge : undirected_edges) {</div>
<div class="line"><span class="lineno"> 65</span> <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[edge.first].push_back(edge.second);</div>
<div class="line"><span class="lineno"> 66</span> <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[edge.second].push_back(edge.first);</div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>.resize(<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">N</a>);</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">edge</a> : <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">undirected_edges</a>) {</div>
<div class="line"><span class="lineno"> 65</span> <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">edge</a>.first].push_back(<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">edge</a>.second);</div>
<div class="line"><span class="lineno"> 66</span> <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">edge</a>.second].push_back(<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">edge</a>.first);</div>
<div class="line"><span class="lineno"> 67</span> }</div>
<div class="line"><span class="lineno"> 68</span> }</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>
<div class="ttc" id="aclassgraph_1_1_graph_html_a59940c462861f2fcf4951d1b6c084e6a"><div class="ttname"><a href="#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00077">lowest_common_ancestor.cpp:77</a></div></div>
</div><!-- fragment -->
</div>
@@ -226,7 +227,7 @@ template&lt;typename T &gt; </div>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
template&lt;typename T&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
@@ -249,7 +250,7 @@ template&lt;typename T &gt; </div>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -258,10 +259,10 @@ template&lt;typename T &gt; </div>
<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00074">74</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"> 74</span> {</div>
<div class="line"><span class="lineno"> 84</span> <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[u].push_back(v); <span class="comment">// u--&gt;v edge added</span></div>
<div class="line"><span class="lineno"> 85</span> <span class="keywordflow">if</span> (bidir == <span class="keyword">true</span>) {</div>
<div class="line"><span class="lineno"> 84</span> <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">u</a>].push_back(<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">v</a>); <span class="comment">// u--&gt;v edge added</span></div>
<div class="line"><span class="lineno"> 85</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">bidir</a> == <span class="keyword">true</span>) {</div>
<div class="line"><span class="lineno"> 86</span> <span class="comment">// if graph is bidirectional</span></div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[v].push_back(u); <span class="comment">// v--&gt;u edge added</span></div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">v</a>].push_back(<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">u</a>); <span class="comment">// v--&gt;u edge added</span></div>
<div class="line"><span class="lineno"> 88</span> }</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="ttc" id="aclassgraph_1_1_graph_html_acebf0505d625b043bb9c8c27c7a8def0"><div class="ttname"><a href="#acebf0505d625b043bb9c8c27c7a8def0">graph::Graph::adjacency_list</a></div><div class="ttdeci">std::map&lt; T, std::list&lt; T &gt; &gt; adjacency_list</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00069">breadth_first_search.cpp:69</a></div></div>
@@ -274,7 +275,7 @@ template&lt;typename T &gt; </div>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
template&lt;typename T&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
@@ -288,7 +289,7 @@ template&lt;typename T &gt; </div>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -306,32 +307,30 @@ template&lt;typename T &gt; </div>
<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00096">96</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"> 96</span> {</div>
<div class="line"><span class="lineno"> 98</span> std::map&lt;T, bool&gt; visited;</div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;adjlist : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>) {</div>
<div class="line"><span class="lineno"> 102</span> visited[adjlist.first] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 103</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[adjlist.first]) {</div>
<div class="line"><span class="lineno"> 104</span> visited[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">std::map&lt;T, bool&gt;</a> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">visited</a>;</div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">adjlist</a> : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>) {</div>
<div class="line"><span class="lineno"> 102</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">visited</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">adjlist</a>.first] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 103</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">node</a> : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">adjlist</a>.first]) {</div>
<div class="line"><span class="lineno"> 104</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">visited</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">node</a>] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 105</span> }</div>
<div class="line"><span class="lineno"> 106</span> }</div>
<div class="line"><span class="lineno"> 107</span> </div>
<div class="line"><span class="lineno"> 109</span> std::queue&lt;T&gt; tracker;</div>
<div class="line"><span class="lineno"> 110</span> </div>
<div class="line"><span class="lineno"> 112</span> tracker.push(src);</div>
<div class="line"><span class="lineno"> 114</span> visited[src] = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">while</span> (!tracker.empty()) {</div>
<div class="line"><span class="lineno"> 118</span> T <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = tracker.front();</div>
<div class="line"><span class="lineno"> 120</span> tracker.pop();</div>
<div class="line"><span class="lineno"> 121</span> <span class="keywordflow">for</span> (T <span class="keyword">const</span> &amp;neighbour : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>]) {</div>
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">if</span> (!visited[neighbour]) {</div>
<div class="line"><span class="lineno"> 126</span> tracker.push(neighbour);</div>
<div class="line"><span class="lineno"> 128</span> visited[neighbour] = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 107</span></div>
<div class="line"><span class="lineno"> 109</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">std::queue&lt;T&gt;</a> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">tracker</a>;</div>
<div class="line"><span class="lineno"> 110</span></div>
<div class="line"><span class="lineno"> 112</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">tracker</a>.push(<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">src</a>);</div>
<div class="line"><span class="lineno"> 114</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">visited</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">src</a>] = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">tracker</a>.empty()) {</div>
<div class="line"><span class="lineno"> 118</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">T</a> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">node</a> = <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">tracker</a>.front();</div>
<div class="line"><span class="lineno"> 120</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">tracker</a>.pop();</div>
<div class="line"><span class="lineno"> 121</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">T</a> <span class="keyword">const</span> &amp;<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">neighbour</a> : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">node</a>]) {</div>
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">visited</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">neighbour</a>]) {</div>
<div class="line"><span class="lineno"> 126</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">tracker</a>.push(<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">neighbour</a>);</div>
<div class="line"><span class="lineno"> 128</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">visited</a>[<a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">neighbour</a>] = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 129</span> }</div>
<div class="line"><span class="lineno"> 130</span> }</div>
<div class="line"><span class="lineno"> 131</span> }</div>
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">return</span> visited;</div>
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">visited</a>;</div>
<div class="line"><span class="lineno"> 133</span> }</div>
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -341,7 +340,7 @@ template&lt;typename T &gt; </div>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
template&lt;typename T&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
@@ -355,7 +354,7 @@ template&lt;typename T &gt; </div>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -373,7 +372,7 @@ template&lt;typename T &gt; </div>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
template&lt;typename T&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
@@ -384,7 +383,7 @@ template&lt;typename T &gt; </div>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -400,7 +399,7 @@ template&lt;typename T &gt; </div>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
template&lt;typename T&gt; </div>
<table class="memname">
<tr>
<td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>&lt; T &gt;::neighbors</td>
@@ -424,7 +423,7 @@ template&lt;typename T &gt; </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="../../dc/d61/classgraph_1_1_graph.html">Graph</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.12.0 </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.13.2 </li>
</ul>
</div>
</body>