backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-17 03:51:27 +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

18
de/d00/classgraph_1_1is__graph__bipartite_1_1_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::is_graph_bipartite::Graph 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,27 +115,27 @@ Collaboration diagram for graph::is_graph_bipartite::Graph:</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:a6aef65b40347c4606662cad4dd2e14d3"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3">Graph</a> (int size)</td></tr>
<tr class="memitem:a6aef65b40347c4606662cad4dd2e14d3" id="r_a6aef65b40347c4606662cad4dd2e14d3"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3">Graph</a> (int size)</td></tr>
<tr class="memdesc:a6aef65b40347c4606662cad4dd2e14d3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor that initializes the graph on creation. <br /></td></tr>
<tr class="separator:a6aef65b40347c4606662cad4dd2e14d3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad8c10df34357b2cd865c81e0c4f0bd8c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c">addEdge</a> (int u, int v)</td></tr>
<tr class="memitem:ad8c10df34357b2cd865c81e0c4f0bd8c" id="r_ad8c10df34357b2cd865c81e0c4f0bd8c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad8c10df34357b2cd865c81e0c4f0bd8c">addEdge</a> (int u, int v)</td></tr>
<tr class="memdesc:ad8c10df34357b2cd865c81e0c4f0bd8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add an edge between two nodes or vertices of graph. <br /></td></tr>
<tr class="separator:ad8c10df34357b2cd865c81e0c4f0bd8c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9b0c6400693a5cfff971f768dd5ca5ca"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca">is_bipartite</a> ()</td></tr>
<tr class="memitem:a9b0c6400693a5cfff971f768dd5ca5ca" id="r_a9b0c6400693a5cfff971f768dd5ca5ca"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca">is_bipartite</a> ()</td></tr>
<tr class="memdesc:a9b0c6400693a5cfff971f768dd5ca5ca"><td class="mdescLeft">&#160;</td><td class="mdescRight">function to add edges to our graph <br /></td></tr>
<tr class="separator:a9b0c6400693a5cfff971f768dd5ca5ca"><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:aefea7ee87a708298c486d5a38ac628ef"><td class="memItemLeft" align="right" valign="top"><a id="aefea7ee87a708298c486d5a38ac628ef" name="aefea7ee87a708298c486d5a38ac628ef"></a>
<tr class="memitem:aefea7ee87a708298c486d5a38ac628ef" id="r_aefea7ee87a708298c486d5a38ac628ef"><td class="memItemLeft" align="right" valign="top"><a id="aefea7ee87a708298c486d5a38ac628ef" name="aefea7ee87a708298c486d5a38ac628ef"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>n</b></td></tr>
<tr class="memdesc:aefea7ee87a708298c486d5a38ac628ef"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of the graph <br /></td></tr>
<tr class="separator:aefea7ee87a708298c486d5a38ac628ef"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab0efcfa04fff8616aff0062522d1483f"><td class="memItemLeft" align="right" valign="top"><a id="ab0efcfa04fff8616aff0062522d1483f" name="ab0efcfa04fff8616aff0062522d1483f"></a>
<tr class="memitem:ab0efcfa04fff8616aff0062522d1483f" id="r_ab0efcfa04fff8616aff0062522d1483f"><td class="memItemLeft" align="right" valign="top"><a id="ab0efcfa04fff8616aff0062522d1483f" name="ab0efcfa04fff8616aff0062522d1483f"></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/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>adj</b></td></tr>
<tr class="memdesc:ab0efcfa04fff8616aff0062522d1483f"><td class="mdescLeft">&#160;</td><td class="mdescRight">adj stores the graph as an adjacency list <br /></td></tr>
<tr class="separator:ab0efcfa04fff8616aff0062522d1483f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9d10768f927baa8a4d4a5ffce295b6b6"><td class="memItemLeft" align="right" valign="top"><a id="a9d10768f927baa8a4d4a5ffce295b6b6" name="a9d10768f927baa8a4d4a5ffce295b6b6"></a>
<tr class="memitem:a9d10768f927baa8a4d4a5ffce295b6b6" id="r_a9d10768f927baa8a4d4a5ffce295b6b6"><td class="memItemLeft" align="right" valign="top"><a id="a9d10768f927baa8a4d4a5ffce295b6b6" name="a9d10768f927baa8a4d4a5ffce295b6b6"></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>side</b></td></tr>
<tr class="memdesc:a9d10768f927baa8a4d4a5ffce295b6b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the side of the vertex <br /></td></tr>
<tr class="separator:a9d10768f927baa8a4d4a5ffce295b6b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -297,7 +297,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"><b>is_graph_bipartite</b></li><li class="navelem"><a class="el" href="../../de/d00/classgraph_1_1is__graph__bipartite_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.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
de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.map
View File

@@ -1,5 +1,5 @@
<map id="graph::is_graph_bipartite::Graph::Graph" name="graph::is_graph_bipartite::Graph::Graph">
<area shape="rect" id="Node000001" title="Constructor that initializes the graph on creation." alt="" coords="5,5,169,46"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="217,13,343,39"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,23,202,23,202,28,169,28"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,23,201,23,201,28,169,28"/>
</map>

6
de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_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::is_graph_bipartite::Graph::Graph Pages: 1 -->
<svg width="261pt" height="39pt"
@@ -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="M122.74,-15.25C130.88,-15.25 139.21,-15.25 147.3,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.14,-18.75 157.14,-15.25 147.14,-11.75 147.14,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M122.74,-15.25C130.69,-15.25 138.84,-15.25 146.75,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="146.63,-18.75 156.63,-15.25 146.63,-11.75 146.63,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.7 KiB

After

Width:  |  Height:  |  Size: 2.7 KiB

6
de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_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::is_graph_bipartite::Graph::Graph Pages: 1 -->
<svg width="261pt" height="39pt"
@@ -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="M122.74,-15.25C130.88,-15.25 139.21,-15.25 147.3,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.14,-18.75 157.14,-15.25 147.14,-11.75 147.14,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M122.74,-15.25C130.69,-15.25 138.84,-15.25 146.75,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="146.63,-18.75 156.63,-15.25 146.63,-11.75 146.63,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.9 KiB

After

Width:  |  Height:  |  Size: 1.9 KiB

2
de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_ad8c10df34357b2cd865c81e0c4f0bd8c_cgraph.map
View File

@@ -1,5 +1,5 @@
<map id="graph::is_graph_bipartite::Graph::addEdge" name="graph::is_graph_bipartite::Graph::addEdge">
<area shape="rect" id="Node000001" title="Function that add an edge between two nodes or vertices of graph." alt="" coords="5,5,169,46"/>
<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="217,13,371,39"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,23,202,23,202,28,169,28"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,23,201,23,201,28,169,28"/>
</map>

6
de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_ad8c10df34357b2cd865c81e0c4f0bd8c_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::is_graph_bipartite::Graph::addEdge Pages: 1 -->
<svg width="282pt" height="39pt"
@@ -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="M122.77,-15.25C130.91,-15.25 139.3,-15.25 147.55,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.29,-18.75 157.29,-15.25 147.29,-11.75 147.29,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M122.77,-15.25C130.72,-15.25 138.92,-15.25 146.99,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="146.78,-18.75 156.78,-15.25 146.78,-11.75 146.78,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.7 KiB

After

Width:  |  Height:  |  Size: 2.7 KiB

6
de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_ad8c10df34357b2cd865c81e0c4f0bd8c_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::is_graph_bipartite::Graph::addEdge Pages: 1 -->
<svg width="282pt" height="39pt"
@@ -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="M122.77,-15.25C130.91,-15.25 139.3,-15.25 147.55,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.29,-18.75 157.29,-15.25 147.29,-11.75 147.29,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M122.77,-15.25C130.72,-15.25 138.92,-15.25 146.99,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="146.78,-18.75 156.78,-15.25 146.78,-11.75 146.78,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.9 KiB

After

Width:  |  Height:  |  Size: 1.9 KiB