backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 11:32:44 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 2dadbf73f4

Browse Source
This commit is contained in:
github-actions
2024-02-12 20:07:08 +00:00
parent b5b4d78981
commit a1eb9bd385
1261 changed files with 30404 additions and 29974 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: greedy_algorithms::dijkstra::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="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.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>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html','../../'); initResizable(); });
$(function(){initNavTree('d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d2/daa/classgreedy__algorithms_1_1dijk
<div class="contents">
<p>Wrapper class for storing a graph.
<a href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for greedy_algorithms::dijkstra::Graph:</div>
<div class="dyncontent">
@@ -115,10 +117,10 @@ Collaboration diagram for greedy_algorithms::dijkstra::Graph:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:afefaeb247734a7c64bd04e68e3c1c4bc" id="r_afefaeb247734a7c64bd04e68e3c1c4bc"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc">Graph</a> (const int V)</td></tr>
<tr class="memitem:afefaeb247734a7c64bd04e68e3c1c4bc" id="r_afefaeb247734a7c64bd04e68e3c1c4bc"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afefaeb247734a7c64bd04e68e3c1c4bc">Graph</a> (const int V)</td></tr>
<tr class="memdesc:afefaeb247734a7c64bd04e68e3c1c4bc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs a graph. <br /></td></tr>
<tr class="separator:afefaeb247734a7c64bd04e68e3c1c4bc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a224b6efacbad55d59e11b046f792fe79" id="r_a224b6efacbad55d59e11b046f792fe79"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79">add_edge</a> (int src, int dst, int weight)</td></tr>
<tr class="memitem:a224b6efacbad55d59e11b046f792fe79" id="r_a224b6efacbad55d59e11b046f792fe79"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a224b6efacbad55d59e11b046f792fe79">add_edge</a> (int src, int dst, int weight)</td></tr>
<tr class="memdesc:a224b6efacbad55d59e11b046f792fe79"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds an edge to the graph. <br /></td></tr>
<tr class="separator:a224b6efacbad55d59e11b046f792fe79"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -127,7 +129,7 @@ Public Attributes</h2></td></tr>
<tr class="memitem:a2b0f8f5d257613bb0c0cb470413964b1" id="r_a2b0f8f5d257613bb0c0cb470413964b1"><td class="memItemLeft" align="right" valign="top"><a id="a2b0f8f5d257613bb0c0cb470413964b1" name="a2b0f8f5d257613bb0c0cb470413964b1"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b> = 0</td></tr>
<tr class="separator:a2b0f8f5d257613bb0c0cb470413964b1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a42a583424fb3b90346f1564d737a0fff" id="r_a42a583424fb3b90346f1564d737a0fff"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a42a583424fb3b90346f1564d737a0fff">edges</a> {}</td></tr>
<tr class="memitem:a42a583424fb3b90346f1564d737a0fff" id="r_a42a583424fb3b90346f1564d737a0fff"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a42a583424fb3b90346f1564d737a0fff">edges</a> {}</td></tr>
<tr class="separator:a42a583424fb3b90346f1564d737a0fff"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -145,8 +147,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b> = 0</td>
<tr>
<td class="memname">greedy_algorithms::dijkstra::Graph::Graph </td>
<td>(</td>
<td class="paramtype">const int&#160;</td>
<td class="paramname"><em>V</em></td><td>)</td>
<td class="paramtype">const int</td> <td class="paramname"><span class="paramname"><em>V</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -197,25 +198,17 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b> = 0</td>
<tr>
<td class="memname">void greedy_algorithms::dijkstra::Graph::add_edge </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>src</em>, </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&#160;</td>
<td class="paramname"><em>dst</em>, </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&#160;</td>
<td class="paramname"><em>weight</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>weight</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -266,7 +259,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b> = 0</td>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></li><li class="navelem"><b>dijkstra</b></li><li class="navelem"><a class="el" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">Graph</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </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.10.0 </li>
</ul>
</div>
</body>