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

Documentation for 0931d530ae

Browse Source
This commit is contained in:
github-actions
2023-01-22 19:44:10 +00:00
parent a448f64699
commit b48f6e8671
2457 changed files with 9513 additions and 8691 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
d3/d40/graph__coloring_8cpp.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.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: backtracking/graph_coloring.cpp File 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.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -129,23 +129,23 @@ Namespaces</h2></td></tr>
Functions</h2></td></tr>
<tr class="memitem:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
<tr class="memitem:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07">backtracking::graph_coloring::printSolution</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; &amp;color)</td></tr>
<tr class="memdesc:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function to print the solution. <a href="../../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07">More...</a><br /></td></tr>
<tr class="memdesc:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function to print the solution. <br /></td></tr>
<tr class="separator:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a976efe049deb042bf1f02612e181ab1d"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
<tr class="memitem:a976efe049deb042bf1f02612e181ab1d"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d">backtracking::graph_coloring::isSafe</a> (int v, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;graph, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; &amp;color, int c)</td></tr>
<tr class="memdesc:a976efe049deb042bf1f02612e181ab1d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to check if the current color assignment is safe for vertex v. <a href="../../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d">More...</a><br /></td></tr>
<tr class="memdesc:a976efe049deb042bf1f02612e181ab1d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to check if the current color assignment is safe for vertex v. <br /></td></tr>
<tr class="separator:a976efe049deb042bf1f02612e181ab1d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a40337efc5dad761096489bf2c5b1c80c"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
<tr class="memitem:a40337efc5dad761096489bf2c5b1c80c"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c">backtracking::graph_coloring::graphColoring</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;graph, int m, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; color, int v)</td></tr>
<tr class="memdesc:a40337efc5dad761096489bf2c5b1c80c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive utility function to solve m coloring problem. <a href="../../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c">More...</a><br /></td></tr>
<tr class="memdesc:a40337efc5dad761096489bf2c5b1c80c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive utility function to solve m coloring problem. <br /></td></tr>
<tr class="separator:a40337efc5dad761096489bf2c5b1c80c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
<tr class="memdesc:gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >prints the assigned colors using <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm </p>
<p >In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices are of the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges are of the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color.</p>
<div class="textblock"><p>prints the assigned colors using <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm </p>
<p>In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices are of the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges are of the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AnupKumarPanwar" target="_blank">Anup Kumar Panwar</a> </dd>
<dd>
<a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
@@ -412,7 +412,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="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../d3/d40/graph__coloring_8cpp.html">graph_coloring.cpp</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.5 </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.6 </li>
</ul>
</div>
</body>

2
d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: backtracking::graph_coloring::graphColoring Pages: 1 -->
<svg width="130pt" height="56pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 1.4 KiB

2
d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: backtracking::graph_coloring::printSolution Pages: 1 -->
<svg width="124pt" height="56pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 1.4 KiB

2
d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_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 7.0.4 (20221203.1631)
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
-->
<!-- Title: backtracking::graph_coloring::isSafe Pages: 1 -->
<svg width="110pt" height="56pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 1.4 KiB