mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 04:42:10 +08:00
578 lines
37 KiB
HTML
578 lines
37 KiB
HTML
<!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.20"/>
|
|
<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++
|
|
 <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.20 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&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&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&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> |
|
|
<a href="#pub-attribs">Public Attributes</a> |
|
|
<a href="#pri-methods">Private Member Functions</a> |
|
|
<a href="#pri-attribs">Private Attributes</a> |
|
|
<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="651" height="364"><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>
|
|
 </td><td class="memItemRight" valign="bottom"><b>Graph</b> (int V, int E)</td></tr>
|
|
<tr class="separator:ad3b98f95ee53f91afad11b8eaddc35e0"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memItemLeft" align="right" valign="top"><a id="a6dc4dd4ce49c4052ad2a5d27523881f4"></a>
|
|
void </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"> </td></tr>
|
|
<tr class="memitem:af3ff6b295df8bf3bee0bafd7c7d56915"><td class="memItemLeft" align="right" valign="top"><a id="af3ff6b295df8bf3bee0bafd7c7d56915"></a>
|
|
 </td><td class="memItemRight" valign="bottom"><b>Graph</b> (int V)</td></tr>
|
|
<tr class="separator:af3ff6b295df8bf3bee0bafd7c7d56915"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memItemLeft" align="right" valign="top"><a id="a6dc4dd4ce49c4052ad2a5d27523881f4"></a>
|
|
void </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"> </td></tr>
|
|
<tr class="memitem:ade809d353b640b9c2773d71d4f57d57d"><td class="memItemLeft" align="right" valign="top"><a id="ade809d353b640b9c2773d71d4f57d57d"></a>
|
|
 </td><td class="memItemRight" valign="bottom"><b>Graph</b> (<a class="el" href="../../da/d9a/class_graph.html">Graph</a> &&)=default</td></tr>
|
|
<tr class="separator:ade809d353b640b9c2773d71d4f57d57d"><td class="memSeparator" colspan="2"> </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> & </td><td class="memItemRight" valign="bottom"><b>operator=</b> (<a class="el" href="../../da/d9a/class_graph.html">Graph</a> &&)=default</td></tr>
|
|
<tr class="separator:a14da756c7e346c651e8cf14df2437d4a"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a04365fc6f13bf330e38dbc1424134827"><td class="memItemLeft" align="right" valign="top"><a id="a04365fc6f13bf330e38dbc1424134827"></a>
|
|
 </td><td class="memItemRight" valign="bottom"><b>Graph</b> (<a class="el" href="../../da/d9a/class_graph.html">Graph</a> const &)=default</td></tr>
|
|
<tr class="separator:a04365fc6f13bf330e38dbc1424134827"><td class="memSeparator" colspan="2"> </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> & </td><td class="memItemRight" valign="bottom"><b>operator=</b> (<a class="el" href="../../da/d9a/class_graph.html">Graph</a> const &)=default</td></tr>
|
|
<tr class="separator:ac3e58f4a0c8c65befe6629f4e1b71142"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:adcbd1b60cab30b97c54d700eee8e456d"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">Graph</a> (unsigned int vertices, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a> adjList)</td></tr>
|
|
<tr class="separator:adcbd1b60cab30b97c54d700eee8e456d"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a8c95e00effaea0cd9404dd74cd802ae3"><td class="memItemLeft" align="right" valign="top"> </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/map.html">AdjList</a> &&adjList)</td></tr>
|
|
<tr class="separator:a8c95e00effaea0cd9404dd74cd802ae3"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aa99d44d3179d5bbbfa84a5031cf80cb1"><td class="memItemLeft" align="right" valign="top"> </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>< <a class="el" href="../../d7/d77/class_edge.html">Edge</a> > const &edges)</td></tr>
|
|
<tr class="separator:aa99d44d3179d5bbbfa84a5031cf80cb1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6cb6fbec4ea7cfdfda368f2c468a757d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_reference.html">std::remove_reference</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a> >::type const & </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#a6cb6fbec4ea7cfdfda368f2c468a757d">getAdjList</a> () const</td></tr>
|
|
<tr class="separator:a6cb6fbec4ea7cfdfda368f2c468a757d"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a8dcb5ce0b4a6f65827f5055d9d53a3f1"><td class="memItemLeft" align="right" valign="top">unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1">getVertices</a> () const</td></tr>
|
|
<tr class="separator:a8dcb5ce0b4a6f65827f5055d9d53a3f1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ac5a4d9a4f894a179198936042c778413"><td class="memItemLeft" align="right" valign="top">void </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"> </td></tr>
|
|
<tr class="memitem:af765dda8f21280e1cecea19e129f1bc5"><td class="memItemLeft" align="right" valign="top">void </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 &edge)</td></tr>
|
|
<tr class="separator:af765dda8f21280e1cecea19e129f1bc5"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ac85c63bcca4764a621f9f8609a8e5910"><td class="memItemLeft" align="right" valign="top">void </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"> </td></tr>
|
|
<tr class="memitem:a6d95f41d2df61697379ccc209c78f801"><td class="memItemLeft" align="right" valign="top"><a id="a6d95f41d2df61697379ccc209c78f801"></a>
|
|
void </td><td class="memItemRight" valign="bottom"><b>set_graph</b> ()</td></tr>
|
|
<tr class="separator:a6d95f41d2df61697379ccc209c78f801"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ab7a517eb1a45f6539a53dffe5d790b12"><td class="memItemLeft" align="right" valign="top"><a id="ab7a517eb1a45f6539a53dffe5d790b12"></a>
|
|
void </td><td class="memItemRight" valign="bottom"><b>ford_fulkerson</b> ()</td></tr>
|
|
<tr class="separator:ab7a517eb1a45f6539a53dffe5d790b12"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ac93ec6a876da0b5a61ebf3bebc347ba5"><td class="memItemLeft" align="right" valign="top"><a id="ac93ec6a876da0b5a61ebf3bebc347ba5"></a>
|
|
void </td><td class="memItemRight" valign="bottom"><b>print_flow_info</b> ()</td></tr>
|
|
<tr class="separator:ac93ec6a876da0b5a61ebf3bebc347ba5"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:acfa457b5f6f7eb480fd469fb980a01ea"><td class="memItemLeft" align="right" valign="top"><a id="acfa457b5f6f7eb480fd469fb980a01ea"></a>
|
|
 </td><td class="memItemRight" valign="bottom"><b>Graph</b> (const int V)</td></tr>
|
|
<tr class="separator:acfa457b5f6f7eb480fd469fb980a01ea"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memItemLeft" align="right" valign="top"><a id="a6dc4dd4ce49c4052ad2a5d27523881f4"></a>
|
|
void </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"> </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 </td><td class="memItemRight" valign="bottom"><b>vertexNum</b></td></tr>
|
|
<tr class="separator:a6afcd41564ea00294a4c089414979ca1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a10ff9c6c323cf435f18e424dbb62235e"><td class="memItemLeft" align="right" valign="top"><a id="a10ff9c6c323cf435f18e424dbb62235e"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>edgeNum</b></td></tr>
|
|
<tr class="separator:a10ff9c6c323cf435f18e424dbb62235e"><td class="memSeparator" colspan="2"> </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> * </td><td class="memItemRight" valign="bottom"><b>edges</b></td></tr>
|
|
<tr class="separator:a3535be2ce0d62152e54395951330da81"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a268ba18d421817ad8713c2e92f19d82a"><td class="memItemLeft" align="right" valign="top"><a id="a268ba18d421817ad8713c2e92f19d82a"></a>
|
|
int ** </td><td class="memItemRight" valign="bottom"><b>edges</b></td></tr>
|
|
<tr class="separator:a268ba18d421817ad8713c2e92f19d82a"><td class="memSeparator" colspan="2"> </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 </td><td class="memItemRight" valign="bottom"><b>bfs</b> (int source, int sink)</td></tr>
|
|
<tr class="separator:acfd6fbc5243626bfb7b7116b76fedab0"><td class="memSeparator" colspan="2"> </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 </td><td class="memItemRight" valign="bottom"><b>m_vertices</b> = 0</td></tr>
|
|
<tr class="separator:a61943646676002a5e75f7b6493c25713"><td class="memSeparator" colspan="2"> </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/map.html">AdjList</a> </td><td class="memItemRight" valign="bottom"><b>m_adjList</b></td></tr>
|
|
<tr class="separator:a13697caf8be6275ebb7b9497c9a9d6e5"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a92a601c0ada840011e2719cb753b490b"><td class="memItemLeft" align="right" valign="top"><a id="a92a601c0ada840011e2719cb753b490b"></a>
|
|
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > > </td><td class="memItemRight" valign="bottom"><b>residual_capacity</b></td></tr>
|
|
<tr class="separator:a92a601c0ada840011e2719cb753b490b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a8a34b80e2f3749992e0e9b83de742fba"><td class="memItemLeft" align="right" valign="top"><a id="a8a34b80e2f3749992e0e9b83de742fba"></a>
|
|
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > > </td><td class="memItemRight" valign="bottom"><b>capacity</b></td></tr>
|
|
<tr class="separator:a8a34b80e2f3749992e0e9b83de742fba"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae93ae98711b868af601d424954fe94ac"><td class="memItemLeft" align="right" valign="top"><a id="ae93ae98711b868af601d424954fe94ac"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>total_nodes</b> = 0</td></tr>
|
|
<tr class="separator:ae93ae98711b868af601d424954fe94ac"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ad621c5393837c21780ff3477431707ac"><td class="memItemLeft" align="right" valign="top"><a id="ad621c5393837c21780ff3477431707ac"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>total_edges</b> = 0</td></tr>
|
|
<tr class="separator:ad621c5393837c21780ff3477431707ac"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a9912e31b32405d21a4c22a9ab8dece30"><td class="memItemLeft" align="right" valign="top"><a id="a9912e31b32405d21a4c22a9ab8dece30"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>source</b> = 0</td></tr>
|
|
<tr class="separator:a9912e31b32405d21a4c22a9ab8dece30"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a47336f7cfe4698ef887a34e03f1a3856"><td class="memItemLeft" align="right" valign="top"><a id="a47336f7cfe4698ef887a34e03f1a3856"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>sink</b> = 0</td></tr>
|
|
<tr class="separator:a47336f7cfe4698ef887a34e03f1a3856"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a9474bfdf769cc0d23f5b16c181a29431"><td class="memItemLeft" align="right" valign="top"><a id="a9474bfdf769cc0d23f5b16c181a29431"></a>
|
|
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > </td><td class="memItemRight" valign="bottom"><b>parent</b></td></tr>
|
|
<tr class="separator:a9474bfdf769cc0d23f5b16c181a29431"><td class="memSeparator" colspan="2"> </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>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a>< int, int, int > > </td><td class="memItemRight" valign="bottom"><b>edge_participated</b></td></tr>
|
|
<tr class="separator:a73268574e2528b8e760191113ef6d1eb"><td class="memSeparator" colspan="2"> </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>< MAXN > </td><td class="memItemRight" valign="bottom"><b>visited</b></td></tr>
|
|
<tr class="separator:af1abf6ea5346e12dea4df46262ff35aa"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aa0aaff1a0c13bdf209ea40b83ac01ae6"><td class="memItemLeft" align="right" valign="top"><a id="aa0aaff1a0c13bdf209ea40b83ac01ae6"></a>
|
|
int </td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td></tr>
|
|
<tr class="separator:aa0aaff1a0c13bdf209ea40b83ac01ae6"><td class="memSeparator" colspan="2"> </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" & "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 & Destructor Documentation</h2>
|
|
<a id="adcbd1b60cab30b97c54d700eee8e456d"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#adcbd1b60cab30b97c54d700eee8e456d">◆ </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 </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/map.html">AdjList</a> </td>
|
|
<td class="paramname"><em>adjList</em> </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="l00069"></a><span class="lineno"> 69</span>  : m_vertices(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="a8c95e00effaea0cd9404dd74cd802ae3"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a8c95e00effaea0cd9404dd74cd802ae3">◆ </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 </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/map.html">AdjList</a> && </td>
|
|
<td class="paramname"><em>adjList</em> </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="l00077"></a><span class="lineno"> 77</span>  : m_vertices(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">◆ </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 </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>< <a class="el" href="../../d7/d77/class_edge.html">Edge</a> > const & </td>
|
|
<td class="paramname"><em>edges</em> </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="l00089"></a><span class="lineno"> 89</span>  : m_vertices(vertices) {</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>& edge : edges) {</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">if</span> (edge.src >= vertices || edge.dest >= vertices) {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <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="l00093"></a><span class="lineno"> 93</span>  <span class="stringliteral">"Either src or dest of edge out of range"</span>);</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  }</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  m_adjList[edge.src].emplace_back(edge.dest);</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</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">◆ </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 & </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="l00124"></a><span class="lineno"> 124</span>  {</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">if</span> (edge.src >= m_vertices || edge.dest >= m_vertices) {</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <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">"Either src or dest of edge out of range"</span>);</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  }</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  m_adjList[edge.src].emplace_back(edge.dest);</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ac85c63bcca4764a621f9f8609a8e5910"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ac85c63bcca4764a621f9f8609a8e5910">◆ </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 </td>
|
|
<td class="paramname"><em>source</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">unsigned int </td>
|
|
<td class="paramname"><em>destination</em> </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="l00136"></a><span class="lineno"> 136</span>  {</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">if</span> (source >= m_vertices || destination >= m_vertices) {</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <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="l00139"></a><span class="lineno"> 139</span>  <span class="stringliteral">"Either source or destination of edge out of range"</span>);</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  m_adjList[source].emplace_back(destination);</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ac5a4d9a4f894a179198936042c778413"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ac5a4d9a4f894a179198936042c778413">◆ </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 </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="l00118"></a><span class="lineno"> 118</span> { m_vertices += num; }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a6cb6fbec4ea7cfdfda368f2c468a757d"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a6cb6fbec4ea7cfdfda368f2c468a757d">◆ </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"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_reference.html">std::remove_reference</a><<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a>>::type const& 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="l00103"></a><span class="lineno"> 103</span>  {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">return</span> m_adjList;</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a8dcb5ce0b4a6f65827f5055d9d53a3f1"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a8dcb5ce0b4a6f65827f5055d9d53a3f1">◆ </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">unsigned int 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="l00110"></a><span class="lineno"> 110</span> { <span class="keywordflow">return</span> m_vertices; }</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 by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|