mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
941 lines
65 KiB
HTML
941 lines
65 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" lang="en-US">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
|
<meta name="generator" content="Doxygen 1.12.0"/>
|
|
<meta name="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>
|
|
<script type="text/javascript" src="../../clipboard.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<script type="text/javascript" src="../../resize.js"></script>
|
|
<script type="text/javascript" src="../../cookie.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 id="projectrow">
|
|
<td id="projectalign">
|
|
<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.12.0 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() { codefold.init(1); });
|
|
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function(){initNavTree('da/d9a/class_graph.html','../../'); initResizable(true); });
|
|
/* @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">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</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="647" height="346"><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 id="pub-methods" name="pub-methods"></a>
|
|
Public Member Functions</h2></td></tr>
|
|
<tr class="memitem:ad3b98f95ee53f91afad11b8eaddc35e0" id="r_ad3b98f95ee53f91afad11b8eaddc35e0"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="#ad3b98f95ee53f91afad11b8eaddc35e0">Graph</a> (int V, int E)</td></tr>
|
|
<tr class="separator:ad3b98f95ee53f91afad11b8eaddc35e0"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6dc4dd4ce49c4052ad2a5d27523881f4" id="r_a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a6dc4dd4ce49c4052ad2a5d27523881f4">addEdge</a> (int src, int dst, int weight)</td></tr>
|
|
<tr class="separator:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:af3ff6b295df8bf3bee0bafd7c7d56915" id="r_af3ff6b295df8bf3bee0bafd7c7d56915"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="#af3ff6b295df8bf3bee0bafd7c7d56915">Graph</a> (int V)</td></tr>
|
|
<tr class="separator:af3ff6b295df8bf3bee0bafd7c7d56915"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6dc4dd4ce49c4052ad2a5d27523881f4" id="r_a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a6dc4dd4ce49c4052ad2a5d27523881f4">addEdge</a> (int src, int dst, int weight)</td></tr>
|
|
<tr class="separator:a6dc4dd4ce49c4052ad2a5d27523881f4"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ade809d353b640b9c2773d71d4f57d57d" id="r_ade809d353b640b9c2773d71d4f57d57d"><td class="memItemLeft" align="right" valign="top"><a id="ade809d353b640b9c2773d71d4f57d57d" name="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:afd81de5588485ebca8498c06a07e8718" id="r_afd81de5588485ebca8498c06a07e8718"><td class="memItemLeft" align="right" valign="top"><a id="afd81de5588485ebca8498c06a07e8718" name="afd81de5588485ebca8498c06a07e8718"></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:afd81de5588485ebca8498c06a07e8718"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a04365fc6f13bf330e38dbc1424134827" id="r_a04365fc6f13bf330e38dbc1424134827"><td class="memItemLeft" align="right" valign="top"><a id="a04365fc6f13bf330e38dbc1424134827" name="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:ab08a73091aea1a70c34cd15200401596" id="r_ab08a73091aea1a70c34cd15200401596"><td class="memItemLeft" align="right" valign="top"><a id="ab08a73091aea1a70c34cd15200401596" name="ab08a73091aea1a70c34cd15200401596"></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:ab08a73091aea1a70c34cd15200401596"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:adcbd1b60cab30b97c54d700eee8e456d" id="r_adcbd1b60cab30b97c54d700eee8e456d"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="#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" id="r_a8c95e00effaea0cd9404dd74cd802ae3"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="#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" id="r_aa99d44d3179d5bbbfa84a5031cf80cb1"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="#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:a5a090e1a63a5c47bdd1a539b21f7fd1d" id="r_a5a090e1a63a5c47bdd1a539b21f7fd1d"><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="#a5a090e1a63a5c47bdd1a539b21f7fd1d">getAdjList</a> () const</td></tr>
|
|
<tr class="separator:a5a090e1a63a5c47bdd1a539b21f7fd1d"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a8dcb5ce0b4a6f65827f5055d9d53a3f1" id="r_a8dcb5ce0b4a6f65827f5055d9d53a3f1"><td class="memItemLeft" align="right" valign="top">unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="#a8dcb5ce0b4a6f65827f5055d9d53a3f1">getVertices</a> () const</td></tr>
|
|
<tr class="separator:a8dcb5ce0b4a6f65827f5055d9d53a3f1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ac5a4d9a4f894a179198936042c778413" id="r_ac5a4d9a4f894a179198936042c778413"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#ac5a4d9a4f894a179198936042c778413">addVertices</a> (unsigned int num=1)</td></tr>
|
|
<tr class="separator:ac5a4d9a4f894a179198936042c778413"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:af765dda8f21280e1cecea19e129f1bc5" id="r_af765dda8f21280e1cecea19e129f1bc5"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#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" id="r_ac85c63bcca4764a621f9f8609a8e5910"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#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" id="r_a6d95f41d2df61697379ccc209c78f801"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d95f41d2df61697379ccc209c78f801">set_graph</a> ()</td></tr>
|
|
<tr class="separator:a6d95f41d2df61697379ccc209c78f801"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ab7a517eb1a45f6539a53dffe5d790b12" id="r_ab7a517eb1a45f6539a53dffe5d790b12"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#ab7a517eb1a45f6539a53dffe5d790b12">ford_fulkerson</a> ()</td></tr>
|
|
<tr class="separator:ab7a517eb1a45f6539a53dffe5d790b12"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ac93ec6a876da0b5a61ebf3bebc347ba5" id="r_ac93ec6a876da0b5a61ebf3bebc347ba5"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#ac93ec6a876da0b5a61ebf3bebc347ba5">print_flow_info</a> ()</td></tr>
|
|
<tr class="separator:ac93ec6a876da0b5a61ebf3bebc347ba5"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
|
|
Public Attributes</h2></td></tr>
|
|
<tr class="memitem:a6afcd41564ea00294a4c089414979ca1" id="r_a6afcd41564ea00294a4c089414979ca1"><td class="memItemLeft" align="right" valign="top"><a id="a6afcd41564ea00294a4c089414979ca1" name="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" id="r_a10ff9c6c323cf435f18e424dbb62235e"><td class="memItemLeft" align="right" valign="top"><a id="a10ff9c6c323cf435f18e424dbb62235e" name="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:a2a546eb4062eb56cb88eb0a381d10a12" id="r_a2a546eb4062eb56cb88eb0a381d10a12"><td class="memItemLeft" align="right" valign="top"><a id="a2a546eb4062eb56cb88eb0a381d10a12" name="a2a546eb4062eb56cb88eb0a381d10a12"></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:a2a546eb4062eb56cb88eb0a381d10a12"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a268ba18d421817ad8713c2e92f19d82a" id="r_a268ba18d421817ad8713c2e92f19d82a"><td class="memItemLeft" align="right" valign="top"><a id="a268ba18d421817ad8713c2e92f19d82a" name="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 id="pri-methods" name="pri-methods"></a>
|
|
Private Member Functions</h2></td></tr>
|
|
<tr class="memitem:acfd6fbc5243626bfb7b7116b76fedab0" id="r_acfd6fbc5243626bfb7b7116b76fedab0"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#acfd6fbc5243626bfb7b7116b76fedab0">bfs</a> (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 id="pri-attribs" name="pri-attribs"></a>
|
|
Private Attributes</h2></td></tr>
|
|
<tr class="memitem:a61943646676002a5e75f7b6493c25713" id="r_a61943646676002a5e75f7b6493c25713"><td class="memItemLeft" align="right" valign="top"><a id="a61943646676002a5e75f7b6493c25713" name="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" id="r_a13697caf8be6275ebb7b9497c9a9d6e5"><td class="memItemLeft" align="right" valign="top"><a id="a13697caf8be6275ebb7b9497c9a9d6e5" name="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" id="r_a92a601c0ada840011e2719cb753b490b"><td class="memItemLeft" align="right" valign="top"><a id="a92a601c0ada840011e2719cb753b490b" name="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" id="r_a8a34b80e2f3749992e0e9b83de742fba"><td class="memItemLeft" align="right" valign="top"><a id="a8a34b80e2f3749992e0e9b83de742fba" name="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" id="r_ae93ae98711b868af601d424954fe94ac"><td class="memItemLeft" align="right" valign="top"><a id="ae93ae98711b868af601d424954fe94ac" name="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" id="r_ad621c5393837c21780ff3477431707ac"><td class="memItemLeft" align="right" valign="top"><a id="ad621c5393837c21780ff3477431707ac" name="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" id="r_a9912e31b32405d21a4c22a9ab8dece30"><td class="memItemLeft" align="right" valign="top"><a id="a9912e31b32405d21a4c22a9ab8dece30" name="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" id="r_a47336f7cfe4698ef887a34e03f1a3856"><td class="memItemLeft" align="right" valign="top"><a id="a47336f7cfe4698ef887a34e03f1a3856" name="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" id="r_a9474bfdf769cc0d23f5b16c181a29431"><td class="memItemLeft" align="right" valign="top"><a id="a9474bfdf769cc0d23f5b16c181a29431" name="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" id="r_a73268574e2528b8e760191113ef6d1eb"><td class="memItemLeft" align="right" valign="top"><a id="a73268574e2528b8e760191113ef6d1eb" name="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" id="r_af1abf6ea5346e12dea4df46262ff35aa"><td class="memItemLeft" align="right" valign="top"><a id="af1abf6ea5346e12dea4df46262ff35aa" name="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" id="r_aa0aaff1a0c13bdf209ea40b83ac01ae6"><td class="memItemLeft" align="right" valign="top"><a id="aa0aaff1a0c13bdf209ea40b83ac01ae6" name="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="ad3b98f95ee53f91afad11b8eaddc35e0" name="ad3b98f95ee53f91afad11b8eaddc35e0"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ad3b98f95ee53f91afad11b8eaddc35e0">◆ </a></span>Graph() <span class="overload">[1/6]</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">int</td> <td class="paramname"><span class="paramname"><em>V</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>E</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<div class="fragment"><div class="line"><span class="lineno"> 19</span> {</div>
|
|
<div class="line"><span class="lineno"> 20</span> this->vertexNum = V;</div>
|
|
<div class="line"><span class="lineno"> 21</span> this->edgeNum = E;</div>
|
|
<div class="line"><span class="lineno"> 22</span> this->edges = (<a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a> *)<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/c/malloc.html">malloc</a>(E * <span class="keyword">sizeof</span>(<a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a>));</div>
|
|
<div class="line"><span class="lineno"> 23</span> }</div>
|
|
<div class="ttc" id="aclass_edge_html"><div class="ttname"><a href="../../d7/d77/class_edge.html">Edge</a></div><div class="ttdef"><b>Definition</b> bellman_ford.cpp:7</div></div>
|
|
<div class="ttc" id="amalloc_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/c/malloc.html">std::malloc</a></div><div class="ttdeci">T malloc(T... args)</div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="af3ff6b295df8bf3bee0bafd7c7d56915" name="af3ff6b295df8bf3bee0bafd7c7d56915"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#af3ff6b295df8bf3bee0bafd7c7d56915">◆ </a></span>Graph() <span class="overload">[2/6]</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">int</td> <td class="paramname"><span class="paramname"><em>V</em></span></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">
|
|
<div class="fragment"><div class="line"><span class="lineno"> 16</span> {</div>
|
|
<div class="line"><span class="lineno"> 17</span> this->vertexNum = V;</div>
|
|
<div class="line"><span class="lineno"> 18</span> this->edges = <span class="keyword">new</span> <span class="keywordtype">int</span> *[V];</div>
|
|
<div class="line"><span class="lineno"> 19</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < V; i++) {</div>
|
|
<div class="line"><span class="lineno"> 20</span> this->edges[i] = <span class="keyword">new</span> <span class="keywordtype">int</span>[V];</div>
|
|
<div class="line"><span class="lineno"> 21</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < V; j++) this->edges[i][j] = INT_MAX;</div>
|
|
<div class="line"><span class="lineno"> 22</span> this->edges[i][i] = 0;</div>
|
|
<div class="line"><span class="lineno"> 23</span> }</div>
|
|
<div class="line"><span class="lineno"> 24</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a902c5b3eacb66d60752525ab23297a95" name="a902c5b3eacb66d60752525ab23297a95"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a902c5b3eacb66d60752525ab23297a95">◆ </a></span>~Graph()</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="paramname"><span class="paramname"><em></em></span></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">
|
|
<div class="fragment"><div class="line"><span class="lineno"> 26</span> {</div>
|
|
<div class="line"><span class="lineno"> 27</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vertexNum; i++) <span class="keyword">delete</span>[] edges[i];</div>
|
|
<div class="line"><span class="lineno"> 28</span> <span class="keyword">delete</span>[] edges;</div>
|
|
<div class="line"><span class="lineno"> 29</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ae4c72b8ac4d693c49800a4c7e273654f" name="ae4c72b8ac4d693c49800a4c7e273654f"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ae4c72b8ac4d693c49800a4c7e273654f">◆ </a></span>Graph() <span class="overload">[3/6]</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="paramname"><span class="paramname"><em></em></span></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">
|
|
<div class="fragment"><div class="line"><span class="lineno"> 56</span>: m_adjList({}) {}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="adcbd1b60cab30b97c54d700eee8e456d" name="adcbd1b60cab30b97c54d700eee8e456d"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#adcbd1b60cab30b97c54d700eee8e456d">◆ </a></span>Graph() <span class="overload">[4/6]</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"><span class="paramname"><em>vertices</em></span>, </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"><span class="paramname"><em>adjList</em></span> )</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"><span class="lineno"> 69</span> : m_vertices(vertices), m_adjList(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(adjList)) {}</div>
|
|
<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><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a8c95e00effaea0cd9404dd74cd802ae3" name="a8c95e00effaea0cd9404dd74cd802ae3"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a8c95e00effaea0cd9404dd74cd802ae3">◆ </a></span>Graph() <span class="overload">[5/6]</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"><span class="paramname"><em>vertices</em></span>, </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"><span class="paramname"><em>adjList</em></span> )</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"><span class="lineno"> 77</span> : m_vertices(vertices), m_adjList(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(adjList)) {}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="aa99d44d3179d5bbbfa84a5031cf80cb1" name="aa99d44d3179d5bbbfa84a5031cf80cb1"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa99d44d3179d5bbbfa84a5031cf80cb1">◆ </a></span>Graph() <span class="overload">[6/6]</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"><span class="paramname"><em>vertices</em></span>, </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"><span class="paramname"><em>edges</em></span> )</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"><span class="lineno"> 89</span> : m_vertices(vertices) {</div>
|
|
<div class="line"><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"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (edge.src >= vertices || edge.dest >= vertices) {</div>
|
|
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a>(</div>
|
|
<div class="line"><span class="lineno"> 93</span> <span class="stringliteral">"Either src or dest of edge out of range"</span>);</div>
|
|
<div class="line"><span class="lineno"> 94</span> }</div>
|
|
<div class="line"><span class="lineno"> 95</span> m_adjList[edge.src].emplace_back(edge.dest);</div>
|
|
<div class="line"><span class="lineno"> 96</span> }</div>
|
|
<div class="line"><span class="lineno"> 97</span> }</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>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<h2 class="groupheader">Member Function Documentation</h2>
|
|
<a id="af765dda8f21280e1cecea19e129f1bc5" name="af765dda8f21280e1cecea19e129f1bc5"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#af765dda8f21280e1cecea19e129f1bc5">◆ </a></span>addEdge() <span class="overload">[1/4]</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"><span class="paramname"><em>edge</em></span></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"><span class="lineno"> 124</span> {</div>
|
|
<div class="line"><span class="lineno"> 125</span> <span class="keywordflow">if</span> (edge.src >= m_vertices || edge.dest >= m_vertices) {</div>
|
|
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">throw</span> <a class="code hl_classRef" 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"><span class="lineno"> 127</span> }</div>
|
|
<div class="line"><span class="lineno"> 128</span> m_adjList[edge.src].emplace_back(edge.dest);</div>
|
|
<div class="line"><span class="lineno"> 129</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a6dc4dd4ce49c4052ad2a5d27523881f4" name="a6dc4dd4ce49c4052ad2a5d27523881f4"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a6dc4dd4ce49c4052ad2a5d27523881f4">◆ </a></span>addEdge() <span class="overload">[2/4]</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">int</td> <td class="paramname"><span class="paramname"><em>src</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>dst</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>weight</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<div class="fragment"><div class="line"><span class="lineno"> 26</span> {</div>
|
|
<div class="line"><span class="lineno"> 27</span> <span class="keyword">static</span> <span class="keywordtype">int</span> edgeInd = 0;</div>
|
|
<div class="line"><span class="lineno"> 28</span> <span class="keywordflow">if</span> (edgeInd < this->edgeNum) {</div>
|
|
<div class="line"><span class="lineno"> 29</span> <a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a> newEdge;</div>
|
|
<div class="line"><span class="lineno"> 30</span> newEdge.src = src;</div>
|
|
<div class="line"><span class="lineno"> 31</span> newEdge.dst = dst;</div>
|
|
<div class="line"><span class="lineno"> 32</span> newEdge.weight = weight;</div>
|
|
<div class="line"><span class="lineno"> 33</span> this->edges[edgeInd++] = newEdge;</div>
|
|
<div class="line"><span class="lineno"> 34</span> }</div>
|
|
<div class="line"><span class="lineno"> 35</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a6dc4dd4ce49c4052ad2a5d27523881f4" name="a6dc4dd4ce49c4052ad2a5d27523881f4"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a6dc4dd4ce49c4052ad2a5d27523881f4">◆ </a></span>addEdge() <span class="overload">[3/4]</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">int</td> <td class="paramname"><span class="paramname"><em>src</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>dst</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>weight</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<div class="fragment"><div class="line"><span class="lineno"> 32</span> {</div>
|
|
<div class="line"><span class="lineno"> 33</span> this->edges[src][dst] = weight;</div>
|
|
<div class="line"><span class="lineno"> 34</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ac85c63bcca4764a621f9f8609a8e5910" name="ac85c63bcca4764a621f9f8609a8e5910"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ac85c63bcca4764a621f9f8609a8e5910">◆ </a></span>addEdge() <span class="overload">[4/4]</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"><span class="paramname"><em>source</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">unsigned int</td> <td class="paramname"><span class="paramname"><em>destination</em></span> )</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"><span class="lineno"> 136</span> {</div>
|
|
<div class="line"><span class="lineno"> 137</span> <span class="keywordflow">if</span> (source >= m_vertices || destination >= m_vertices) {</div>
|
|
<div class="line"><span class="lineno"> 138</span> <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a>(</div>
|
|
<div class="line"><span class="lineno"> 139</span> <span class="stringliteral">"Either source or destination of edge out of range"</span>);</div>
|
|
<div class="line"><span class="lineno"> 140</span> }</div>
|
|
<div class="line"><span class="lineno"> 141</span> m_adjList[source].emplace_back(destination);</div>
|
|
<div class="line"><span class="lineno"> 142</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ac5a4d9a4f894a179198936042c778413" name="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"><span class="paramname"><em>num</em></span><span class="paramdefsep"> = </span><span class="paramdefval">1</span></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"><span class="lineno"> 118</span>{ m_vertices += num; }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="acfd6fbc5243626bfb7b7116b76fedab0" name="acfd6fbc5243626bfb7b7116b76fedab0"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#acfd6fbc5243626bfb7b7116b76fedab0">◆ </a></span>bfs()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool Graph::bfs </td>
|
|
<td>(</td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>source</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>sink</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<div class="fragment"><div class="line"><span class="lineno"> 26</span> { <span class="comment">// to find the augmented - path</span></div>
|
|
<div class="line"><span class="lineno"> 27</span> visited.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/bitset/reset.html">reset</a>();</div>
|
|
<div class="line"><span class="lineno"> 28</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue<int></a> q;</div>
|
|
<div class="line"><span class="lineno"> 29</span> q.push(source);</div>
|
|
<div class="line"><span class="lineno"> 30</span> <span class="keywordtype">bool</span> is_path_found = <span class="keyword">false</span>;</div>
|
|
<div class="line"><span class="lineno"> 31</span> <span class="keywordflow">while</span> (q.empty() == <span class="keyword">false</span> && is_path_found == <span class="keyword">false</span>) {</div>
|
|
<div class="line"><span class="lineno"> 32</span> <span class="keywordtype">int</span> current_node = q.front();</div>
|
|
<div class="line"><span class="lineno"> 33</span> visited.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/bitset/set.html">set</a>(current_node);</div>
|
|
<div class="line"><span class="lineno"> 34</span> q.pop();</div>
|
|
<div class="line"><span class="lineno"> 35</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < total_nodes; ++i) {</div>
|
|
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">if</span> (residual_capacity[current_node][i] > 0 && !visited[i]) {</div>
|
|
<div class="line"><span class="lineno"> 37</span> visited.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/bitset/set.html">set</a>(i);</div>
|
|
<div class="line"><span class="lineno"> 38</span> parent[i] = current_node;</div>
|
|
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">if</span> (i == sink) {</div>
|
|
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><span class="lineno"> 41</span> }</div>
|
|
<div class="line"><span class="lineno"> 42</span> q.push(i);</div>
|
|
<div class="line"><span class="lineno"> 43</span> }</div>
|
|
<div class="line"><span class="lineno"> 44</span> }</div>
|
|
<div class="line"><span class="lineno"> 45</span> }</div>
|
|
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><span class="lineno"> 47</span> }</div>
|
|
<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
|
|
<div class="ttc" id="areset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/bitset/reset.html">std::bitset::reset</a></div><div class="ttdeci">T reset(T... args)</div></div>
|
|
<div class="ttc" id="aset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/bitset/set.html">std::bitset::set</a></div><div class="ttdeci">T set(T... args)</div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ab7a517eb1a45f6539a53dffe5d790b12" name="ab7a517eb1a45f6539a53dffe5d790b12"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ab7a517eb1a45f6539a53dffe5d790b12">◆ </a></span>ford_fulkerson()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void Graph::ford_fulkerson </td>
|
|
<td>(</td>
|
|
<td class="paramname"><span class="paramname"><em></em></span></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">
|
|
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
|
|
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">while</span> (bfs(source, sink)) {</div>
|
|
<div class="line"><span class="lineno"> 64</span> <span class="keywordtype">int</span> current_node = sink;</div>
|
|
<div class="line"><span class="lineno"> 65</span> <span class="keywordtype">int</span> flow = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html">std::numeric_limits<int>::max</a>();</div>
|
|
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">while</span> (current_node != source) {</div>
|
|
<div class="line"><span class="lineno"> 67</span> <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
|
|
<div class="line"><span class="lineno"> 68</span> flow = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(flow, residual_capacity[parent_][current_node]);</div>
|
|
<div class="line"><span class="lineno"> 69</span> current_node = parent_;</div>
|
|
<div class="line"><span class="lineno"> 70</span> }</div>
|
|
<div class="line"><span class="lineno"> 71</span> current_node = sink;</div>
|
|
<div class="line"><span class="lineno"> 72</span> max_flow += flow;</div>
|
|
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">while</span> (current_node != source) {</div>
|
|
<div class="line"><span class="lineno"> 74</span> <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
|
|
<div class="line"><span class="lineno"> 75</span> residual_capacity[parent_][current_node] -= flow;</div>
|
|
<div class="line"><span class="lineno"> 76</span> residual_capacity[current_node][parent_] += flow;</div>
|
|
<div class="line"><span class="lineno"> 77</span> current_node = parent_;</div>
|
|
<div class="line"><span class="lineno"> 78</span> }</div>
|
|
<div class="line"><span class="lineno"> 79</span> }</div>
|
|
<div class="line"><span class="lineno"> 80</span> }</div>
|
|
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html">std::numeric_limits::max</a></div><div class="ttdeci">T max(T... args)</div></div>
|
|
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a5a090e1a63a5c47bdd1a539b21f7fd1d" name="a5a090e1a63a5c47bdd1a539b21f7fd1d"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a5a090e1a63a5c47bdd1a539b21f7fd1d">◆ </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"><span class="paramname"><em></em></span></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"><span class="lineno"> 103</span> {</div>
|
|
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> m_adjList;</div>
|
|
<div class="line"><span class="lineno"> 105</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a8dcb5ce0b4a6f65827f5055d9d53a3f1" name="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"><span class="paramname"><em></em></span></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"><span class="lineno"> 110</span>{ <span class="keywordflow">return</span> m_vertices; }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ac93ec6a876da0b5a61ebf3bebc347ba5" name="ac93ec6a876da0b5a61ebf3bebc347ba5"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ac93ec6a876da0b5a61ebf3bebc347ba5">◆ </a></span>print_flow_info()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void Graph::print_flow_info </td>
|
|
<td>(</td>
|
|
<td class="paramname"><span class="paramname"><em></em></span></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">
|
|
<div class="fragment"><div class="line"><span class="lineno"> 81</span> {</div>
|
|
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < total_nodes; ++i) {</div>
|
|
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < total_nodes; ++j) {</div>
|
|
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">if</span> (capacity[i][j] &&</div>
|
|
<div class="line"><span class="lineno"> 85</span> residual_capacity[i][j] < capacity[i][j]) {</div>
|
|
<div class="line"><span class="lineno"> 86</span> edge_participated.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a>(</div>
|
|
<div class="line"><span class="lineno"> 87</span> i, j, capacity[i][j] - residual_capacity[i][j]));</div>
|
|
<div class="line"><span class="lineno"> 88</span> }</div>
|
|
<div class="line"><span class="lineno"> 89</span> }</div>
|
|
<div class="line"><span class="lineno"> 90</span> }</div>
|
|
<div class="line"><span class="lineno"> 91</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nNodes : "</span> << total_nodes << <span class="stringliteral">"\nMax flow: "</span> << max_flow</div>
|
|
<div class="line"><span class="lineno"> 92</span> << <span class="stringliteral">"\nEdge present in flow: "</span> << edge_participated.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()</div>
|
|
<div class="line"><span class="lineno"> 93</span> << <span class="charliteral">'\n'</span>;</div>
|
|
<div class="line"><span class="lineno"> 94</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nSource\tDestination\tCapacity\total_nodes"</span>;</div>
|
|
<div class="line"><span class="lineno"> 95</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span>& edge_data : edge_participated) {</div>
|
|
<div class="line"><span class="lineno"> 96</span> <span class="keywordtype">int</span> source = 0, destination = 0, capacity_ = 0;</div>
|
|
<div class="line"><span class="lineno"> 97</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(source, destination, capacity_) = edge_data;</div>
|
|
<div class="line"><span class="lineno"> 98</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << source << <span class="stringliteral">"\t"</span> << destination << <span class="stringliteral">"\t\t"</span> << capacity_</div>
|
|
<div class="line"><span class="lineno"> 99</span> << <span class="charliteral">'\t'</span>;</div>
|
|
<div class="line"><span class="lineno"> 100</span> }</div>
|
|
<div class="line"><span class="lineno"> 101</span> }</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="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
|
|
<div class="ttc" id="amake_tuple_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a></div><div class="ttdeci">T make_tuple(T... args)</div></div>
|
|
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
|
<div class="ttc" id="atie_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a></div><div class="ttdeci">T tie(T... args)</div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a6d95f41d2df61697379ccc209c78f801" name="a6d95f41d2df61697379ccc209c78f801"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a6d95f41d2df61697379ccc209c78f801">◆ </a></span>set_graph()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void Graph::set_graph </td>
|
|
<td>(</td>
|
|
<td class="paramname"><span class="paramname"><em></em></span></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">
|
|
<div class="fragment"><div class="line"><span class="lineno"> 50</span> {</div>
|
|
<div class="line"><span class="lineno"> 51</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> total_nodes >> total_edges >> source >> sink;</div>
|
|
<div class="line"><span class="lineno"> 52</span> parent = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>(total_nodes, -1);</div>
|
|
<div class="line"><span class="lineno"> 53</span> capacity = residual_capacity = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a> >(</div>
|
|
<div class="line"><span class="lineno"> 54</span> total_nodes, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>(total_nodes));</div>
|
|
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start = 0, destination = 0, capacity_ = 0, i = 0;</div>
|
|
<div class="line"><span class="lineno"> 56</span> i < total_edges; ++i) {</div>
|
|
<div class="line"><span class="lineno"> 57</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> start >> destination >> capacity_;</div>
|
|
<div class="line"><span class="lineno"> 58</span> residual_capacity[start][destination] = capacity_;</div>
|
|
<div class="line"><span class="lineno"> 59</span> capacity[start][destination] = capacity_;</div>
|
|
<div class="line"><span class="lineno"> 60</span> }</div>
|
|
<div class="line"><span class="lineno"> 61</span> }</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>
|
|
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<hr/>The documentation for this class was generated from the following files:<ul>
|
|
<li>dynamic_programming/<b>bellman_ford.cpp</b></li>
|
|
<li>dynamic_programming/<b>floyd_warshall.cpp</b></li>
|
|
<li>graph/<b>cycle_check_directed_graph.cpp</b></li>
|
|
<li>graph/<b>max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</b></li>
|
|
</ul>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- 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="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|