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

Documentation for aaa08b0150

Browse Source
This commit is contained in:
github-actions
2020-06-19 16:07:44 +00:00
parent 4c261744f6
commit 93021161c2
1714 changed files with 114526 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

581
da/d9a/class_graph.html Normal file
View File

@@ -0,0 +1,581 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Graph Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.18 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('da/d9a/class_graph.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pub-attribs">Public Attributes</a> &#124;
<a href="#pri-methods">Private Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="../../d1/d1d/class_graph-members.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">Graph Class Reference</div> </div>
</div><!--header-->
<div class="contents">
<div class="dynheader">
Collaboration diagram for Graph:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dc2/class_graph__coll__graph.svg" width="648" height="235"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:ad3b98f95ee53f91afad11b8eaddc35e0"><td class="memItemLeft" align="right" valign="top"><a id="ad3b98f95ee53f91afad11b8eaddc35e0"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>Graph</b> (int V, int E)</td></tr>
<tr class="separator:ad3b98f95ee53f91afad11b8eaddc35e0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memItemLeft" align="right" valign="top"><a id="a6dc4dd4ce49c4052ad2a5d27523881f4"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><b>addEdge</b> (int src, int dst, int weight)</td></tr>
<tr class="separator:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af3ff6b295df8bf3bee0bafd7c7d56915"><td class="memItemLeft" align="right" valign="top"><a id="af3ff6b295df8bf3bee0bafd7c7d56915"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>Graph</b> (int V)</td></tr>
<tr class="separator:af3ff6b295df8bf3bee0bafd7c7d56915"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memItemLeft" align="right" valign="top"><a id="a6dc4dd4ce49c4052ad2a5d27523881f4"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><b>addEdge</b> (int src, int dst, int weight)</td></tr>
<tr class="separator:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ade809d353b640b9c2773d71d4f57d57d"><td class="memItemLeft" align="right" valign="top"><a id="ade809d353b640b9c2773d71d4f57d57d"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>Graph</b> (<a class="el" href="../../da/d9a/class_graph.html">Graph</a> &amp;&amp;)=default</td></tr>
<tr class="separator:ade809d353b640b9c2773d71d4f57d57d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a14da756c7e346c651e8cf14df2437d4a"><td class="memItemLeft" align="right" valign="top"><a id="a14da756c7e346c651e8cf14df2437d4a"></a>
<a class="el" href="../../da/d9a/class_graph.html">Graph</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><b>operator=</b> (<a class="el" href="../../da/d9a/class_graph.html">Graph</a> &amp;&amp;)=default</td></tr>
<tr class="separator:a14da756c7e346c651e8cf14df2437d4a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a04365fc6f13bf330e38dbc1424134827"><td class="memItemLeft" align="right" valign="top"><a id="a04365fc6f13bf330e38dbc1424134827"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>Graph</b> (<a class="el" href="../../da/d9a/class_graph.html">Graph</a> const &amp;)=default</td></tr>
<tr class="separator:a04365fc6f13bf330e38dbc1424134827"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac3e58f4a0c8c65befe6629f4e1b71142"><td class="memItemLeft" align="right" valign="top"><a id="ac3e58f4a0c8c65befe6629f4e1b71142"></a>
<a class="el" href="../../da/d9a/class_graph.html">Graph</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><b>operator=</b> (<a class="el" href="../../da/d9a/class_graph.html">Graph</a> const &amp;)=default</td></tr>
<tr class="separator:ac3e58f4a0c8c65befe6629f4e1b71142"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae30edce9b4e7c6347e67edc343f366d8"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8">Graph</a> (unsigned int vertices, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">AdjList</a> const &amp;adjList)</td></tr>
<tr class="separator:ae30edce9b4e7c6347e67edc343f366d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8c95e00effaea0cd9404dd74cd802ae3"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">Graph</a> (unsigned int vertices, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">AdjList</a> &amp;&amp;adjList)</td></tr>
<tr class="separator:a8c95e00effaea0cd9404dd74cd802ae3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa99d44d3179d5bbbfa84a5031cf80cb1"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1">Graph</a> (unsigned int vertices, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d7/d77/class_edge.html">Edge</a> &gt; const &amp;edges)</td></tr>
<tr class="separator:aa99d44d3179d5bbbfa84a5031cf80cb1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae8959064e179573cc48f8cee99115c07"><td class="memItemLeft" align="right" valign="top">std::remove_reference_t&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">AdjList</a> &gt; const &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#ae8959064e179573cc48f8cee99115c07">getAdjList</a> () const</td></tr>
<tr class="separator:ae8959064e179573cc48f8cee99115c07"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8aa88a88269773cc4dba255dec035898"><td class="memItemLeft" align="right" valign="top">std::remove_reference_t&lt; unsigned int &gt; const &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#a8aa88a88269773cc4dba255dec035898">getVertices</a> () const</td></tr>
<tr class="separator:a8aa88a88269773cc4dba255dec035898"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac5a4d9a4f894a179198936042c778413"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">addVertices</a> (unsigned int num=1)</td></tr>
<tr class="separator:ac5a4d9a4f894a179198936042c778413"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af765dda8f21280e1cecea19e129f1bc5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">addEdge</a> (<a class="el" href="../../d7/d77/class_edge.html">Edge</a> const &amp;edge)</td></tr>
<tr class="separator:af765dda8f21280e1cecea19e129f1bc5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac85c63bcca4764a621f9f8609a8e5910"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910">addEdge</a> (unsigned int source, unsigned int destination)</td></tr>
<tr class="separator:ac85c63bcca4764a621f9f8609a8e5910"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a13e73168c59bf97020bbc28a34b115bc"><td class="memItemLeft" align="right" valign="top"><a id="a13e73168c59bf97020bbc28a34b115bc"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><b>set_graph</b> (void)</td></tr>
<tr class="separator:a13e73168c59bf97020bbc28a34b115bc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa3f6376d7f744929f515214ea90c5280"><td class="memItemLeft" align="right" valign="top"><a id="aa3f6376d7f744929f515214ea90c5280"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><b>ford_fulkerson</b> (void)</td></tr>
<tr class="separator:aa3f6376d7f744929f515214ea90c5280"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae0d2312723fb56a431e6fba4f264d25c"><td class="memItemLeft" align="right" valign="top"><a id="ae0d2312723fb56a431e6fba4f264d25c"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><b>print_flow_info</b> (void)</td></tr>
<tr class="separator:ae0d2312723fb56a431e6fba4f264d25c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acfa457b5f6f7eb480fd469fb980a01ea"><td class="memItemLeft" align="right" valign="top"><a id="acfa457b5f6f7eb480fd469fb980a01ea"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>Graph</b> (const int V)</td></tr>
<tr class="separator:acfa457b5f6f7eb480fd469fb980a01ea"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memItemLeft" align="right" valign="top"><a id="a6dc4dd4ce49c4052ad2a5d27523881f4"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><b>addEdge</b> (int src, int dst, int weight)</td></tr>
<tr class="separator:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:a6afcd41564ea00294a4c089414979ca1"><td class="memItemLeft" align="right" valign="top"><a id="a6afcd41564ea00294a4c089414979ca1"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b></td></tr>
<tr class="separator:a6afcd41564ea00294a4c089414979ca1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a10ff9c6c323cf435f18e424dbb62235e"><td class="memItemLeft" align="right" valign="top"><a id="a10ff9c6c323cf435f18e424dbb62235e"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>edgeNum</b></td></tr>
<tr class="separator:a10ff9c6c323cf435f18e424dbb62235e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3535be2ce0d62152e54395951330da81"><td class="memItemLeft" align="right" valign="top"><a id="a3535be2ce0d62152e54395951330da81"></a>
<a class="el" href="../../d7/d77/class_edge.html">Edge</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>edges</b></td></tr>
<tr class="separator:a3535be2ce0d62152e54395951330da81"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a268ba18d421817ad8713c2e92f19d82a"><td class="memItemLeft" align="right" valign="top"><a id="a268ba18d421817ad8713c2e92f19d82a"></a>
int **&#160;</td><td class="memItemRight" valign="bottom"><b>edges</b></td></tr>
<tr class="separator:a268ba18d421817ad8713c2e92f19d82a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:acfd6fbc5243626bfb7b7116b76fedab0"><td class="memItemLeft" align="right" valign="top"><a id="acfd6fbc5243626bfb7b7116b76fedab0"></a>
bool&#160;</td><td class="memItemRight" valign="bottom"><b>bfs</b> (int source, int sink)</td></tr>
<tr class="separator:acfd6fbc5243626bfb7b7116b76fedab0"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a61943646676002a5e75f7b6493c25713"><td class="memItemLeft" align="right" valign="top"><a id="a61943646676002a5e75f7b6493c25713"></a>
unsigned int&#160;</td><td class="memItemRight" valign="bottom"><b>m_vertices</b></td></tr>
<tr class="separator:a61943646676002a5e75f7b6493c25713"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a13697caf8be6275ebb7b9497c9a9d6e5"><td class="memItemLeft" align="right" valign="top"><a id="a13697caf8be6275ebb7b9497c9a9d6e5"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">AdjList</a>&#160;</td><td class="memItemRight" valign="bottom"><b>m_adjList</b></td></tr>
<tr class="separator:a13697caf8be6275ebb7b9497c9a9d6e5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af0e8f10f05298718b830d7c01a7cd69c"><td class="memItemLeft" align="right" valign="top"><a id="af0e8f10f05298718b830d7c01a7cd69c"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>residual_capacity</b> [MAXN][MAXN]</td></tr>
<tr class="separator:af0e8f10f05298718b830d7c01a7cd69c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ada0d96b867fe317f251c5a025a1ee8b3"><td class="memItemLeft" align="right" valign="top"><a id="ada0d96b867fe317f251c5a025a1ee8b3"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>capacity</b> [MAXN][MAXN]</td></tr>
<tr class="separator:ada0d96b867fe317f251c5a025a1ee8b3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae93ae98711b868af601d424954fe94ac"><td class="memItemLeft" align="right" valign="top"><a id="ae93ae98711b868af601d424954fe94ac"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>total_nodes</b></td></tr>
<tr class="separator:ae93ae98711b868af601d424954fe94ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad621c5393837c21780ff3477431707ac"><td class="memItemLeft" align="right" valign="top"><a id="ad621c5393837c21780ff3477431707ac"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>total_edges</b></td></tr>
<tr class="separator:ad621c5393837c21780ff3477431707ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9912e31b32405d21a4c22a9ab8dece30"><td class="memItemLeft" align="right" valign="top"><a id="a9912e31b32405d21a4c22a9ab8dece30"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>source</b></td></tr>
<tr class="separator:a9912e31b32405d21a4c22a9ab8dece30"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a47336f7cfe4698ef887a34e03f1a3856"><td class="memItemLeft" align="right" valign="top"><a id="a47336f7cfe4698ef887a34e03f1a3856"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>sink</b></td></tr>
<tr class="separator:a47336f7cfe4698ef887a34e03f1a3856"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a08e82d027824859388cd85c83bfbc314"><td class="memItemLeft" align="right" valign="top"><a id="a08e82d027824859388cd85c83bfbc314"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>parent</b> [MAXN]</td></tr>
<tr class="separator:a08e82d027824859388cd85c83bfbc314"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a73268574e2528b8e760191113ef6d1eb"><td class="memItemLeft" align="right" valign="top"><a id="a73268574e2528b8e760191113ef6d1eb"></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/utility/tuple.html">std::tuple</a>&lt; int, int, int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>edge_participated</b></td></tr>
<tr class="separator:a73268574e2528b8e760191113ef6d1eb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af1abf6ea5346e12dea4df46262ff35aa"><td class="memItemLeft" align="right" valign="top"><a id="af1abf6ea5346e12dea4df46262ff35aa"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/bitset.html">std::bitset</a>&lt; MAXN &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>visited</b></td></tr>
<tr class="separator:af1abf6ea5346e12dea4df46262ff35aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa0aaff1a0c13bdf209ea40b83ac01ae6"><td class="memItemLeft" align="right" valign="top"><a id="aa0aaff1a0c13bdf209ea40b83ac01ae6"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td></tr>
<tr class="separator:aa0aaff1a0c13bdf209ea40b83ac01ae6"><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>Implementation of graph class.</p>
<p>The graph will be represented using Adjacency List representation. This class contains 2 data members "m_vertices" &amp; "m_adjList" used to represent the number of vertices and adjacency list of the graph respectively. The vertices are labelled 0 - (m_vertices - 1). </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="ae30edce9b4e7c6347e67edc343f366d8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae30edce9b4e7c6347e67edc343f366d8">&#9670;&nbsp;</a></span>Graph() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">Graph::Graph </td>
<td>(</td>
<td class="paramtype">unsigned int&#160;</td>
<td class="paramname"><em>vertices</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">AdjList</a> const &amp;&#160;</td>
<td class="paramname"><em>adjList</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Create a graph from vertices and adjacency list.</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">vertices</td><td>specify the number of vertices the graph would contain. </td></tr>
<tr><td class="paramname">adjList</td><td>is the adjacency list representation of graph. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; : m_vertices(vertices), m_adjList(adjList) {}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a8c95e00effaea0cd9404dd74cd802ae3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8c95e00effaea0cd9404dd74cd802ae3">&#9670;&nbsp;</a></span>Graph() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">Graph::Graph </td>
<td>(</td>
<td class="paramtype">unsigned int&#160;</td>
<td class="paramname"><em>vertices</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">AdjList</a> &amp;&amp;&#160;</td>
<td class="paramname"><em>adjList</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Create a graph from vertices and adjacency list.</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">vertices</td><td>specify the number of vertices the graph would contain. </td></tr>
<tr><td class="paramname">adjList</td><td>is the adjacency list representation of graph. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; : m_vertices(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(vertices)), m_adjList(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(adjList)) {}</div>
</div><!-- fragment -->
</div>
</div>
<a id="aa99d44d3179d5bbbfa84a5031cf80cb1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa99d44d3179d5bbbfa84a5031cf80cb1">&#9670;&nbsp;</a></span>Graph() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">Graph::Graph </td>
<td>(</td>
<td class="paramtype">unsigned int&#160;</td>
<td class="paramname"><em>vertices</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d7/d77/class_edge.html">Edge</a> &gt; const &amp;&#160;</td>
<td class="paramname"><em>edges</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Create a graph from vertices and a set of edges.</p>
<p>Adjacency list of the graph would be created from the set of edges. If the source or destination of any edge has a value greater or equal to number of vertices, then it would throw a range_error.</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">vertices</td><td>specify the number of vertices the graph would contain. </td></tr>
<tr><td class="paramname">edges</td><td>is a vector of edges. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; : m_vertices(vertices) {</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; edge : edges) {</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="keywordflow">if</span> (edge.src &gt;= vertices || edge.dest &gt;= vertices) {</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <span class="keywordflow">throw</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a>(</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <span class="stringliteral">&quot;Either src or dest of edge out of range&quot;</span>);</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; }</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; m_adjList[edge.src].emplace_back(edge.dest);</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; }</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; }</div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="af765dda8f21280e1cecea19e129f1bc5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af765dda8f21280e1cecea19e129f1bc5">&#9670;&nbsp;</a></span>addEdge() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void Graph::addEdge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d7/d77/class_edge.html">Edge</a> const &amp;&#160;</td>
<td class="paramname"><em>edge</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Add an edge in the graph.</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">edge</td><td>that needs to be added. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; {</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; <span class="keywordflow">if</span> (edge.src &gt;= m_vertices || edge.dest &gt;= m_vertices) {</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; <span class="keywordflow">throw</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a>(<span class="stringliteral">&quot;Either src or dest of edge out of range&quot;</span>);</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; }</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; m_adjList[edge.src].emplace_back(edge.dest);</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ac85c63bcca4764a621f9f8609a8e5910"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac85c63bcca4764a621f9f8609a8e5910">&#9670;&nbsp;</a></span>addEdge() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void Graph::addEdge </td>
<td>(</td>
<td class="paramtype">unsigned int&#160;</td>
<td class="paramname"><em>source</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned int&#160;</td>
<td class="paramname"><em>destination</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Add an <a class="el" href="../../d7/d77/class_edge.html">Edge</a> in the graph</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">source</td><td>is source vertex of the edge. </td></tr>
<tr><td class="paramname">destination</td><td>is the destination vertex of the edge. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; {</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; <span class="keywordflow">if</span> (source &gt;= m_vertices || destination &gt;= m_vertices) {</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; <span class="keywordflow">throw</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a>(</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; <span class="stringliteral">&quot;Either source or destination of edge out of range&quot;</span>);</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; }</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; m_adjList[source].emplace_back(destination);</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ac5a4d9a4f894a179198936042c778413"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac5a4d9a4f894a179198936042c778413">&#9670;&nbsp;</a></span>addVertices()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void Graph::addVertices </td>
<td>(</td>
<td class="paramtype">unsigned int&#160;</td>
<td class="paramname"><em>num</em> = <code>1</code></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Add vertices in the graph.</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">num</td><td>is the number of vertices to be added. It adds 1 vertex by default. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160;{ m_vertices += num; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ae8959064e179573cc48f8cee99115c07"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae8959064e179573cc48f8cee99115c07">&#9670;&nbsp;</a></span>getAdjList()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::remove_reference_t&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">AdjList</a>&gt; const&amp; Graph::getAdjList </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Return a const reference of the adjacency list.</p>
<dl class="section return"><dt>Returns</dt><dd>const reference to the adjacency list </dd></dl>
<div class="fragment"><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; {</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <span class="keywordflow">return</span> m_adjList;</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a8aa88a88269773cc4dba255dec035898"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8aa88a88269773cc4dba255dec035898">&#9670;&nbsp;</a></span>getVertices()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">std::remove_reference_t&lt;unsigned int&gt; const&amp; Graph::getVertices </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<dl class="section return"><dt>Returns</dt><dd>number of vertices in the graph. </dd></dl>
<div class="fragment"><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; {</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <span class="keywordflow">return</span> m_vertices;</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; }</div>
</div><!-- fragment -->
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li>dynamic_programming/bellman_ford.cpp</li>
<li>dynamic_programming/floyd_warshall.cpp</li>
<li>graph/cycle_check_directed_graph.cpp</li>
<li>graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</li>
<li>greedy_algorithms/dijkstra.cpp</li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
<div class="ttc" id="arange_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a></div><div class="ttdoc">STL class.</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../da/d9a/class_graph.html">Graph</a></li>
<li class="footer">Generated on Fri Jun 19 2020 16:06:45 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>
</div>
</body>
</html>

45
da/d9a/class_graph.js Normal file
View File

@@ -0,0 +1,45 @@
var class_graph =
[
[ "Graph", "da/d9a/class_graph.html#ad3b98f95ee53f91afad11b8eaddc35e0", null ],
[ "Graph", "da/d9a/class_graph.html#af3ff6b295df8bf3bee0bafd7c7d56915", null ],
[ "~Graph", "da/d9a/class_graph.html#a902c5b3eacb66d60752525ab23297a95", null ],
[ "Graph", "da/d9a/class_graph.html#ae4c72b8ac4d693c49800a4c7e273654f", null ],
[ "~Graph", "da/d9a/class_graph.html#a9f341e2e8348a3f484987bdb0cec8006", null ],
[ "Graph", "da/d9a/class_graph.html#ade809d353b640b9c2773d71d4f57d57d", null ],
[ "Graph", "da/d9a/class_graph.html#a04365fc6f13bf330e38dbc1424134827", null ],
[ "Graph", "da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8", null ],
[ "Graph", "da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3", null ],
[ "Graph", "da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1", null ],
[ "Graph", "da/d9a/class_graph.html#ae4c72b8ac4d693c49800a4c7e273654f", null ],
[ "Graph", "da/d9a/class_graph.html#acfa457b5f6f7eb480fd469fb980a01ea", null ],
[ "addEdge", "da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5", null ],
[ "addEdge", "da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4", null ],
[ "addEdge", "da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4", null ],
[ "addEdge", "da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4", null ],
[ "addEdge", "da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910", null ],
[ "addVertices", "da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413", null ],
[ "bfs", "da/d9a/class_graph.html#acfd6fbc5243626bfb7b7116b76fedab0", null ],
[ "ford_fulkerson", "da/d9a/class_graph.html#aa3f6376d7f744929f515214ea90c5280", null ],
[ "getAdjList", "da/d9a/class_graph.html#ae8959064e179573cc48f8cee99115c07", null ],
[ "getVertices", "da/d9a/class_graph.html#a8aa88a88269773cc4dba255dec035898", null ],
[ "operator=", "da/d9a/class_graph.html#a14da756c7e346c651e8cf14df2437d4a", null ],
[ "operator=", "da/d9a/class_graph.html#ac3e58f4a0c8c65befe6629f4e1b71142", null ],
[ "print_flow_info", "da/d9a/class_graph.html#ae0d2312723fb56a431e6fba4f264d25c", null ],
[ "set_graph", "da/d9a/class_graph.html#a13e73168c59bf97020bbc28a34b115bc", null ],
[ "capacity", "da/d9a/class_graph.html#ada0d96b867fe317f251c5a025a1ee8b3", null ],
[ "edge_participated", "da/d9a/class_graph.html#a73268574e2528b8e760191113ef6d1eb", null ],
[ "edgeNum", "da/d9a/class_graph.html#a10ff9c6c323cf435f18e424dbb62235e", null ],
[ "edges", "da/d9a/class_graph.html#a268ba18d421817ad8713c2e92f19d82a", null ],
[ "edges", "da/d9a/class_graph.html#a3535be2ce0d62152e54395951330da81", null ],
[ "m_adjList", "da/d9a/class_graph.html#a13697caf8be6275ebb7b9497c9a9d6e5", null ],
[ "m_vertices", "da/d9a/class_graph.html#a61943646676002a5e75f7b6493c25713", null ],
[ "max_flow", "da/d9a/class_graph.html#aa0aaff1a0c13bdf209ea40b83ac01ae6", null ],
[ "parent", "da/d9a/class_graph.html#a08e82d027824859388cd85c83bfbc314", null ],
[ "residual_capacity", "da/d9a/class_graph.html#af0e8f10f05298718b830d7c01a7cd69c", null ],
[ "sink", "da/d9a/class_graph.html#a47336f7cfe4698ef887a34e03f1a3856", null ],
[ "source", "da/d9a/class_graph.html#a9912e31b32405d21a4c22a9ab8dece30", null ],
[ "total_edges", "da/d9a/class_graph.html#ad621c5393837c21780ff3477431707ac", null ],
[ "total_nodes", "da/d9a/class_graph.html#ae93ae98711b868af601d424954fe94ac", null ],
[ "vertexNum", "da/d9a/class_graph.html#a6afcd41564ea00294a4c089414979ca1", null ],
[ "visited", "da/d9a/class_graph.html#af1abf6ea5346e12dea4df46262ff35aa", null ]
];

181
da/d9a/palindrome__of__number_8cpp.html Normal file
View File

@@ -0,0 +1,181 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: others/palindrome_of_number.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.18 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('da/d9a/palindrome__of__number_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">palindrome_of_number.cpp File Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>Check if a number is <a href="https://en.wikipedia.org/wiki/Palindrome">palindrome</a> or not.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;cstring&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for palindrome_of_number.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d6c/palindrome__of__number_8cpp__incl.svg" width="267" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><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>Check if a number is <a href="https://en.wikipedia.org/wiki/Palindrome">palindrome</a> or not. </p>
<p>This program cheats by using the STL library's <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a> function. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<div class="fragment"><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160; {</div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160; <span class="keywordtype">int</span> num;</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter number = &quot;</span>;</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; num;</div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160; </div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s1 = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a>(num); <span class="comment">// convert number to string</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s2 = s1;</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; </div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a>(s1.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), s1.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>()); <span class="comment">// reverse the string</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; </div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; <span class="keywordflow">if</span> (s1 == s2) <span class="comment">// check if reverse and original string are identical</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;true&quot;</span>;</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; <span class="keywordflow">else</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;false&quot;</span>;</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; </div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="228" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="ato_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></div><div class="ttdeci">T to_string(T... args)</div></div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../da/d9a/palindrome__of__number_8cpp.html">palindrome_of_number.cpp</a></li>
<li class="footer">Generated on Fri Jun 19 2020 16:06:44 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>
</div>
</body>
</html>

4
da/d9a/palindrome__of__number_8cpp.js Normal file
View File

@@ -0,0 +1,4 @@
var palindrome__of__number_8cpp =
[
[ "main", "da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ]
];

7
da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="main" name="main">
<area shape="rect" id="node1" title=" " alt="" coords="5,81,56,108"/>
<area shape="rect" id="node2" href="/Users/runner/runners/2.263.0/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="104,5,223,32"/>
<area shape="rect" id="node3" href="/Users/runner/runners/2.263.0/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="109,56,218,83"/>
<area shape="rect" id="node4" href="/Users/runner/runners/2.263.0/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="118,107,209,133"/>
<area shape="rect" id="node5" href="/Users/runner/runners/2.263.0/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/to_string.html#" title=" " alt="" coords="114,157,213,184"/>
</map>

1
da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
96910d526327bd4ff05b94521e561074

82
da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,82 @@
<?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 2.44.0 (20200408.0750)
-->
<!-- Title: main Pages: 1 -->
<svg width="171pt" height="142pt"
viewBox="0.00 0.00 171.00 142.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 167,-138 167,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#bfbfbf" stroke="black" points="0,-57.5 0,-76.5 38,-76.5 38,-57.5 0,-57.5"/>
<text text-anchor="middle" x="19" y="-64.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="74,-114.5 74,-133.5 163,-133.5 163,-114.5 74,-114.5"/>
<text text-anchor="middle" x="118.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M32.4,-76.81C43.05,-84.97 59.01,-96.57 74,-105 77.11,-106.75 80.41,-108.45 83.76,-110.07"/>
<polygon fill="midnightblue" stroke="midnightblue" points="82.6,-113.39 93.15,-114.39 85.52,-107.03 82.6,-113.39"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="77.5,-76.5 77.5,-95.5 159.5,-95.5 159.5,-76.5 77.5,-76.5"/>
<text text-anchor="middle" x="118.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M38.34,-70.57C46.7,-72.2 57.05,-74.22 67.47,-76.25"/>
<polygon fill="midnightblue" stroke="midnightblue" points="66.94,-79.71 77.43,-78.19 68.28,-72.84 66.94,-79.71"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="84.5,-38.5 84.5,-57.5 152.5,-57.5 152.5,-38.5 84.5,-38.5"/>
<text text-anchor="middle" x="118.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M38.34,-63.43C48.52,-61.44 61.66,-58.88 74.29,-56.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="75.1,-59.83 84.25,-54.48 73.76,-52.96 75.1,-59.83"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="81.5,-0.5 81.5,-19.5 155.5,-19.5 155.5,-0.5 81.5,-0.5"/>
<text text-anchor="middle" x="118.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::to_string</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M32.4,-57.19C43.05,-49.03 59.01,-37.43 74,-29 77.11,-27.25 80.41,-25.55 83.76,-23.93"/>
<polygon fill="midnightblue" stroke="midnightblue" points="85.52,-26.97 93.15,-19.61 82.6,-20.61 85.52,-26.97"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.9 KiB