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

Documentation for 341ed50da8

Browse Source
This commit is contained in:
github-actions
2021-09-03 19:56:17 +00:00
parent 52d0c55145
commit 08e8eb037e
3432 changed files with 71392 additions and 72953 deletions
Download Patch File Download Diff File Expand all files Collapse all files

392
df/dce/namespacegraph.html
View File

@@ -2,8 +2,8 @@
<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.9.1"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: graph Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -17,9 +17,9 @@
<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"],
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>
@@ -32,8 +32,7 @@
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
@@ -42,21 +41,22 @@
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
@@ -70,7 +70,7 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('df/dce/namespacegraph.html','../../'); initResizable(); });
/* @license-end */
</script>
@@ -93,62 +93,61 @@ $(document).ready(function(){initNavTree('df/dce/namespacegraph.html','../../');
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">graph Namespace Reference</div> </div>
<div class="headertitle"><div class="title">graph Namespace Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms.
<a href="../../df/dce/namespacegraph.html#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Represents Bipartite graph for Hopcroft Karp implementation. <a href="../../d8/d69/classgraph_1_1_h_k_graph.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a372ff051a7bc6c91d34a7b58edf8dfce"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce">addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&gt; *adj, int u, int v)</td></tr>
<tr class="memdesc:a372ff051a7bc6c91d34a7b58edf8dfce"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph. <a href="../../df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce">More...</a><br /></td></tr>
<tr class="separator:a372ff051a7bc6c91d34a7b58edf8dfce"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8e9885e0dd49fcf8262a9868124deac9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9">explore</a> (const <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; *adj, int u, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *visited)</td></tr>
<tr class="memdesc:a8e9885e0dd49fcf8262a9868124deac9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function for depth first seach algorithm this function explores the vertex which is passed into. <a href="../../df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9">More...</a><br /></td></tr>
<tr class="separator:a8e9885e0dd49fcf8262a9868124deac9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9fc2ded2807582edf398e6d7c7114914"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a9fc2ded2807582edf398e6d7c7114914">getConnectedComponents</a> (const <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; *adj)</td></tr>
<tr class="memdesc:a9fc2ded2807582edf398e6d7c7114914"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that perfoms depth first search algorithm on graph and calculated the number of connected components. <a href="../../df/dce/namespacegraph.html#a9fc2ded2807582edf398e6d7c7114914">More...</a><br /></td></tr>
<tr class="separator:a9fc2ded2807582edf398e6d7c7114914"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a33d8f7759375aee956643d76df491b7b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a33d8f7759375aee956643d76df491b7b">addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt;&gt; *adj, size_t u, size_t v)</td></tr>
<tr class="memdesc:a33d8f7759375aee956643d76df491b7b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds and edge between two vertices of graph say u and v in this case. <a href="../../df/dce/namespacegraph.html#a33d8f7759375aee956643d76df491b7b">More...</a><br /></td></tr>
<tr class="separator:a33d8f7759375aee956643d76df491b7b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a48acac475cb48614279e7ea784c32fc3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a48acac475cb48614279e7ea784c32fc3">explore</a> (const <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; size_t &gt;&gt; &amp;adj, size_t v, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *visited)</td></tr>
<tr class="memdesc:a48acac475cb48614279e7ea784c32fc3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored. <a href="../../df/dce/namespacegraph.html#a48acac475cb48614279e7ea784c32fc3">More...</a><br /></td></tr>
<tr class="separator:a48acac475cb48614279e7ea784c32fc3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2e6017a54d445819ede9adcf33240e1a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a2e6017a54d445819ede9adcf33240e1a">depth_first_search</a> (const <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; size_t &gt;&gt; &amp;adj, size_t start)</td></tr>
<tr class="memdesc:a2e6017a54d445819ede9adcf33240e1a"><td class="mdescLeft">&#160;</td><td class="mdescRight">initiates depth first search algorithm. <a href="../../df/dce/namespacegraph.html#a2e6017a54d445819ede9adcf33240e1a">More...</a><br /></td></tr>
<tr class="separator:a2e6017a54d445819ede9adcf33240e1a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a454891267187a5ec6c6e3f3ad5203ff1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a454891267187a5ec6c6e3f3ad5203ff1">addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt;&gt;&gt; *adj, int u, int v, int w)</td></tr>
<tr class="memdesc:a454891267187a5ec6c6e3f3ad5203ff1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph. <a href="../../df/dce/namespacegraph.html#a454891267187a5ec6c6e3f3ad5203ff1">More...</a><br /></td></tr>
<tr class="separator:a454891267187a5ec6c6e3f3ad5203ff1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a868530bfaed30e57290a76d5b4402d50"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a868530bfaed30e57290a76d5b4402d50">dijkstra</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt;&gt;&gt; *adj, int s, int t)</td></tr>
<tr class="memdesc:a868530bfaed30e57290a76d5b4402d50"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source. <a href="../../df/dce/namespacegraph.html#a868530bfaed30e57290a76d5b4402d50">More...</a><br /></td></tr>
<tr class="separator:a868530bfaed30e57290a76d5b4402d50"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9125ceb66bfbec3093bba64c2c1e99e2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *adj, int u, int v)</td></tr>
<tr class="memdesc:a9125ceb66bfbec3093bba64c2c1e99e2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph. <a href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">More...</a><br /></td></tr>
<tr class="separator:a9125ceb66bfbec3093bba64c2c1e99e2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a> (const <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; *adj, int u, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *visited)</td></tr>
<tr class="memdesc:a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function for depth first seach algorithm this function explores the vertex which is passed into. <a href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">More...</a><br /></td></tr>
<tr class="separator:a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a83ab16e96cec644109a58dfc9329bc2b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">getConnectedComponents</a> (const <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; *adj)</td></tr>
<tr class="memdesc:a83ab16e96cec644109a58dfc9329bc2b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that perfoms depth first search algorithm on graph and calculated the number of connected components. <a href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">More...</a><br /></td></tr>
<tr class="separator:a83ab16e96cec644109a58dfc9329bc2b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad4016cfc80485a43748895a2c26c7d08"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08">addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</td></tr>
<tr class="memdesc:ad4016cfc80485a43748895a2c26c7d08"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds and edge between two vertices of graph say u and v in this case. <a href="../../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08">More...</a><br /></td></tr>
<tr class="separator:ad4016cfc80485a43748895a2c26c7d08"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a64c1db5aad7502c6f08e4652f6edd463"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463">explore</a> (const <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; size_t &gt; &gt; &amp;adj, size_t v, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *visited)</td></tr>
<tr class="memdesc:a64c1db5aad7502c6f08e4652f6edd463"><td class="mdescLeft">&#160;</td><td class="mdescRight">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored. <a href="../../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463">More...</a><br /></td></tr>
<tr class="separator:a64c1db5aad7502c6f08e4652f6edd463"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab5428a3519267a28bba4b4310cfbb6ae"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae">depth_first_search</a> (const <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; size_t &gt; &gt; &amp;adj, size_t start)</td></tr>
<tr class="memdesc:ab5428a3519267a28bba4b4310cfbb6ae"><td class="mdescLeft">&#160;</td><td class="mdescRight">initiates depth first search algorithm. <a href="../../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae">More...</a><br /></td></tr>
<tr class="separator:ab5428a3519267a28bba4b4310cfbb6ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0e30e0dca68cb6e4f671440819b35b6a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a">addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &gt; *adj, int u, int v, int w)</td></tr>
<tr class="memdesc:a0e30e0dca68cb6e4f671440819b35b6a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph. <a href="../../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a">More...</a><br /></td></tr>
<tr class="separator:a0e30e0dca68cb6e4f671440819b35b6a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adc68cbc8ba09eb1142265935c0d45b84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">dijkstra</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &gt; *adj, int s, int t)</td></tr>
<tr class="memdesc:adc68cbc8ba09eb1142265935c0d45b84"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source. <a href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">More...</a><br /></td></tr>
<tr class="separator:adc68cbc8ba09eb1142265935c0d45b84"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. </p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms.</p>
<p>for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></p>
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms </p>
<div class="textblock"><p ><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. </p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p ><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms.</p>
<p >for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></p>
<p ><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a372ff051a7bc6c91d34a7b58edf8dfce"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a372ff051a7bc6c91d34a7b58edf8dfce">&#9670;&nbsp;</a></span>addEdge() <span class="overload">[1/3]</span></h2>
<a id="a9125ceb66bfbec3093bba64c2c1e99e2" name="a9125ceb66bfbec3093bba64c2c1e99e2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9125ceb66bfbec3093bba64c2c1e99e2">&#9670;&nbsp;</a></span>addEdge() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -156,7 +155,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">void graph::addEdge </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&gt; *&#160;</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *&#160;</td>
<td class="paramname"><em>adj</em>, </td>
</tr>
<tr>
@@ -188,15 +187,15 @@ Functions</h2></td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; {</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; (*adj)[u - 1].push_back(v - 1);</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; (*adj)[v - 1].push_back(u - 1);</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160;}</div>
<div class="fragment"><div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> {</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> (*adj)[u - 1].push_back(v - 1);</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> (*adj)[v - 1].push_back(u - 1);</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a33d8f7759375aee956643d76df491b7b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a33d8f7759375aee956643d76df491b7b">&#9670;&nbsp;</a></span>addEdge() <span class="overload">[2/3]</span></h2>
<a id="ad4016cfc80485a43748895a2c26c7d08" name="ad4016cfc80485a43748895a2c26c7d08"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad4016cfc80485a43748895a2c26c7d08">&#9670;&nbsp;</a></span>addEdge() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -204,7 +203,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">void graph::addEdge </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt;&gt; *&#160;</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; *&#160;</td>
<td class="paramname"><em>adj</em>, </td>
</tr>
<tr>
@@ -236,22 +235,22 @@ Functions</h2></td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; {</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="comment">/*</span></div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160;<span class="comment"> * Here we are considering undirected graph that&#39;s the</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160;<span class="comment"> * reason we are adding v to the adjacency list representation of u</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160;<span class="comment"> * and also adding u to the adjacency list representation of v</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; (*adj)[u - 1].push_back(v - 1);</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; (*adj)[v - 1].push_back(u - 1);</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160;}</div>
<div class="fragment"><div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> {</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="comment">/*</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment"> *</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="comment"> * Here we are considering undirected graph that&#39;s the</span></div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="comment"> * reason we are adding v to the adjacency list representation of u</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment"> * and also adding u to the adjacency list representation of v</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment"> *</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="comment"> */</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> (*adj)[u - 1].push_back(v - 1);</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> (*adj)[v - 1].push_back(u - 1);</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a454891267187a5ec6c6e3f3ad5203ff1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a454891267187a5ec6c6e3f3ad5203ff1">&#9670;&nbsp;</a></span>addEdge() <span class="overload">[3/3]</span></h2>
<a id="a0e30e0dca68cb6e4f671440819b35b6a" name="a0e30e0dca68cb6e4f671440819b35b6a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0e30e0dca68cb6e4f671440819b35b6a">&#9670;&nbsp;</a></span>addEdge() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -259,7 +258,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">void graph::addEdge </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt;&gt;&gt; *&#160;</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &gt; *&#160;</td>
<td class="paramname"><em>adj</em>, </td>
</tr>
<tr>
@@ -296,22 +295,22 @@ Functions</h2></td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; {</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; (*adj)[u - 1].push_back(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(v - 1, w));</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; <span class="comment">// (*adj)[v - 1].push_back(std::make_pair(u - 1, w));</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160;}</div>
<div class="fragment"><div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> {</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> (*adj)[u - 1].push_back(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(v - 1, w));</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// (*adj)[v - 1].push_back(std::make_pair(u - 1, w));</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span>}</div>
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a454891267187a5ec6c6e3f3ad5203ff1_cgraph.svg" width="286" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.svg" width="286" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a2e6017a54d445819ede9adcf33240e1a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2e6017a54d445819ede9adcf33240e1a">&#9670;&nbsp;</a></span>depth_first_search()</h2>
<a id="ab5428a3519267a28bba4b4310cfbb6ae" name="ab5428a3519267a28bba4b4310cfbb6ae"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab5428a3519267a28bba4b4310cfbb6ae">&#9670;&nbsp;</a></span>depth_first_search()</h2>
<div class="memitem">
<div class="memproto">
@@ -319,7 +318,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void graph::depth_first_search </td>
<td>(</td>
<td class="paramtype">const <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; size_t &gt;&gt; &amp;&#160;</td>
<td class="paramtype">const <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; size_t &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>adj</em>, </td>
</tr>
<tr>
@@ -344,26 +343,25 @@ Here is the call graph for this function:</div>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; {</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <span class="keywordtype">size_t</span> vertices = adj.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; </div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> visited(vertices, <span class="keyword">false</span>);</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <a class="code" href="../../df/dce/namespacegraph.html#a48acac475cb48614279e7ea784c32fc3">explore</a>(adj, start, &amp;visited);</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160;}</div>
<div class="ttc" id="anamespacegraph_html_a48acac475cb48614279e7ea784c32fc3"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a48acac475cb48614279e7ea784c32fc3">graph::explore</a></div><div class="ttdeci">void explore(const std::vector&lt; std::vector&lt; size_t &gt;&gt; &amp;adj, size_t v, std::vector&lt; bool &gt; *visited)</div><div class="ttdoc">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...</div><div class="ttdef"><b>Definition:</b> depth_first_search.cpp:80</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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; bool &gt;</a></div></div>
<div class="fragment"><div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> {</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordtype">size_t</span> vertices = adj.size();</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> visited(vertices, <span class="keyword">false</span>);</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463">explore</a>(adj, start, &amp;visited);</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span>}</div>
<div class="ttc" id="anamespacegraph_html_a64c1db5aad7502c6f08e4652f6edd463"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463">graph::explore</a></div><div class="ttdeci">void explore(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t v, std::vector&lt; bool &gt; *visited)</div><div class="ttdoc">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...</div><div class="ttdef"><b>Definition:</b> depth_first_search.cpp:80</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 class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a2e6017a54d445819ede9adcf33240e1a_cgraph.svg" width="299" height="88"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.svg" width="291" height="70"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a868530bfaed30e57290a76d5b4402d50"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a868530bfaed30e57290a76d5b4402d50">&#9670;&nbsp;</a></span>dijkstra()</h2>
<a id="adc68cbc8ba09eb1142265935c0d45b84" name="adc68cbc8ba09eb1142265935c0d45b84"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adc68cbc8ba09eb1142265935c0d45b84">&#9670;&nbsp;</a></span>dijkstra()</h2>
<div class="memitem">
<div class="memproto">
@@ -371,7 +369,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int graph::dijkstra </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt;&gt;&gt; *&#160;</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &gt; *&#160;</td>
<td class="paramname"><em>adj</em>, </td>
</tr>
<tr>
@@ -404,59 +402,59 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>shortest distance if target is reachable from source else -1 in case if target is not reachable from source. </dd></dl>
<p>n denotes the number of vertices in graph</p>
<p>setting all the distances initially to INF</p>
<p>creating a min heap using priority queue first element of pair contains the distance second element of pair contains the vertex</p>
<p>pushing the source vertex 's' with 0 distance in min heap</p>
<p>marking the distance of source as 0</p>
<p>second element of pair denotes the node / vertex</p>
<p>first element of pair denotes the distance</p>
<p>for all the reachable vertex from the currently exploring vertex we will try to minimize the distance</p>
<p>minimizing distances</p>
<div class="fragment"><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; {<span class="comment"></span></div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160;<span class="comment"> /// n denotes the number of vertices in graph</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160;<span class="comment"></span> <span class="keywordtype">int</span> n = adj-&gt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160;<span class="comment"> /// setting all the distances initially to INF</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> dist(n, INF);</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160;<span class="comment"> /// creating a min heap using priority queue</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160;<span class="comment"> /// first element of pair contains the distance</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160;<span class="comment"> /// second element of pair contains the vertex</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue&lt;std::pair&lt;int, int&gt;</a>, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::pair&lt;int, int&gt;</a>&gt;,</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater&lt;std::pair&lt;int, int&gt;</a>&gt;&gt;</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; pq;</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160;<span class="comment"> /// pushing the source vertex &#39;s&#39; with 0 distance in min heap</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160;<span class="comment"></span> pq.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">push</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, s));</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160;<span class="comment"> /// marking the distance of source as 0</span></div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160;<span class="comment"></span> dist[s] = 0;</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; </div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="keywordflow">while</span> (!pq.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html">empty</a>()) {<span class="comment"></span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160;<span class="comment"> /// second element of pair denotes the node / vertex</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160;<span class="comment"></span> <span class="keywordtype">int</span> currentNode = pq.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">top</a>().second;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160;<span class="comment"> /// first element of pair denotes the distance</span></div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160;<span class="comment"></span> <span class="keywordtype">int</span> currentDist = pq.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">top</a>().first;</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; </div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; pq.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html">pop</a>();</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160;<span class="comment"> /// for all the reachable vertex from the currently exploring vertex</span></div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160;<span class="comment"> /// we will try to minimize the distance</span></div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, int&gt;</a> edge : (*adj)[currentNode]) {<span class="comment"></span></div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160;<span class="comment"> /// minimizing distances</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160;<span class="comment"></span> <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[edge.first]) {</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; dist[edge.first] = currentDist + edge.second;</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; pq.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">push</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(dist[edge.first], edge.first));</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; }</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; }</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; }</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keywordflow">if</span> (dist[t] != INF) {</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <span class="keywordflow">return</span> dist[t];</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; }</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160;}</div>
<p >n denotes the number of vertices in graph</p>
<p >setting all the distances initially to INF</p>
<p >creating a min heap using priority queue first element of pair contains the distance second element of pair contains the vertex</p>
<p >pushing the source vertex 's' with 0 distance in min heap</p>
<p >marking the distance of source as 0</p>
<p >second element of pair denotes the node / vertex</p>
<p >first element of pair denotes the distance</p>
<p >for all the reachable vertex from the currently exploring vertex we will try to minimize the distance</p>
<p >minimizing distances</p>
<div class="fragment"><div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> {<span class="comment"></span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span><span class="comment"> /// n denotes the number of vertices in graph</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span><span class="comment"></span> <span class="keywordtype">int</span> n = adj-&gt;size();</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span><span class="comment"></span> </div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span><span class="comment"> /// setting all the distances initially to INF</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> dist(n, INF);</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span><span class="comment"></span> </div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment"> /// creating a min heap using priority queue</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment"> /// first element of pair contains the distance</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment"> /// second element of pair contains the vertex</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue&lt;std::pair&lt;int, int&gt;</a>, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::pair&lt;int, int&gt;</a>&gt;,</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater&lt;std::pair&lt;int, int&gt;</a>&gt;&gt;</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> pq;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span><span class="comment"></span> </div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="comment"> /// pushing the source vertex &#39;s&#39; with 0 distance in min heap</span></div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="comment"></span> pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">push</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, s));</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="comment"></span> </div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment"> /// marking the distance of source as 0</span></div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment"></span> dist[s] = 0;</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> </div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">while</span> (!pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html">empty</a>()) {<span class="comment"></span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="comment"> /// second element of pair denotes the node / vertex</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span><span class="comment"></span> <span class="keywordtype">int</span> currentNode = pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">top</a>().second;</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment"></span> </div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="comment"> /// first element of pair denotes the distance</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span><span class="comment"></span> <span class="keywordtype">int</span> currentDist = pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">top</a>().first;</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> </div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html">pop</a>();</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span><span class="comment"></span> </div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span><span class="comment"> /// for all the reachable vertex from the currently exploring vertex</span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="comment"> /// we will try to minimize the distance</span></div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="comment"></span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, int&gt;</a> edge : (*adj)[currentNode]) {<span class="comment"></span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="comment"> /// minimizing distances</span></div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span><span class="comment"></span> <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[edge.first]) {</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> dist[edge.first] = currentDist + edge.second;</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">push</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(dist[edge.first], edge.first));</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> }</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> }</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordflow">if</span> (dist[t] != INF) {</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keywordflow">return</span> dist[t];</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> }</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span>}</div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html">std::priority_queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="agreater_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater</a></div></div>
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
@@ -464,17 +462,11 @@ Here is the call graph for this function:</div>
<div class="ttc" id="apriority_queue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></div></div>
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">std::priority_queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">std::priority_queue::top</a></div><div class="ttdeci">T top(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a868530bfaed30e57290a76d5b4402d50_cgraph.svg" width="279" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div><!-- fragment -->
</div>
</div>
</div>
</div>
<a id="a8e9885e0dd49fcf8262a9868124deac9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8e9885e0dd49fcf8262a9868124deac9">&#9670;&nbsp;</a></span>explore() <span class="overload">[1/2]</span></h2>
<a id="a3ae80bc4c6a79d041b4f3a6589eb7fb8" name="a3ae80bc4c6a79d041b4f3a6589eb7fb8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">&#9670;&nbsp;</a></span>explore() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -482,7 +474,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void graph::explore </td>
<td>(</td>
<td class="paramtype">const <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="paramtype">const <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="paramname"><em>adj</em>, </td>
</tr>
<tr>
@@ -514,20 +506,26 @@ Here is the call graph for this function:</div>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; {</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; (*visited)[u] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> v : (*adj)[u]) {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="keywordflow">if</span> (!(*visited)[v]) {</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <a class="code" href="../../df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9">explore</a>(adj, v, visited);</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; }</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; }</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160;}</div>
<div class="ttc" id="anamespacegraph_html_a8e9885e0dd49fcf8262a9868124deac9"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9">graph::explore</a></div><div class="ttdeci">void explore(const std::vector&lt; std::vector&lt; int &gt;&gt; *adj, int u, std::vector&lt; bool &gt; *visited)</div><div class="ttdoc">Utility function for depth first seach algorithm this function explores the vertex which is passed in...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:59</div></div>
</div><!-- fragment -->
<div class="fragment"><div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> {</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> (*visited)[u] = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> v : (*adj)[u]) {</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">if</span> (!(*visited)[v]) {</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, v, visited);</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> }</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> }</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span>}</div>
<div class="ttc" id="anamespacegraph_html_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">graph::explore</a></div><div class="ttdeci">void explore(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)</div><div class="ttdoc">Utility function for depth first seach algorithm this function explores the vertex which is passed in...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:59</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.svg" width="118" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
<a id="a48acac475cb48614279e7ea784c32fc3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a48acac475cb48614279e7ea784c32fc3">&#9670;&nbsp;</a></span>explore() <span class="overload">[2/2]</span></h2>
</div>
</div>
<a id="a64c1db5aad7502c6f08e4652f6edd463" name="a64c1db5aad7502c6f08e4652f6edd463"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a64c1db5aad7502c6f08e4652f6edd463">&#9670;&nbsp;</a></span>explore() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -535,7 +533,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void graph::explore </td>
<td>(</td>
<td class="paramtype">const <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; size_t &gt;&gt; &amp;&#160;</td>
<td class="paramtype">const <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; size_t &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>adj</em>, </td>
</tr>
<tr>
@@ -567,27 +565,27 @@ Here is the call graph for this function:</div>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; {</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; v + 1 &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; (*visited)[v] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : adj[v]) {</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="keywordflow">if</span> (!(*visited)[x]) {</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <a class="code" href="../../df/dce/namespacegraph.html#a48acac475cb48614279e7ea784c32fc3">explore</a>(adj, x, visited);</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; }</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; }</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160;}</div>
<div class="fragment"><div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> {</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; v + 1 &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> (*visited)[v] = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : adj[v]) {</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (!(*visited)[x]) {</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463">explore</a>(adj, x, visited);</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> }</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</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><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a48acac475cb48614279e7ea784c32fc3_cgraph.svg" width="272" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.svg" width="272" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a9fc2ded2807582edf398e6d7c7114914"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9fc2ded2807582edf398e6d7c7114914">&#9670;&nbsp;</a></span>getConnectedComponents()</h2>
<a id="a83ab16e96cec644109a58dfc9329bc2b" name="a83ab16e96cec644109a58dfc9329bc2b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a83ab16e96cec644109a58dfc9329bc2b">&#9670;&nbsp;</a></span>getConnectedComponents()</h2>
<div class="memitem">
<div class="memproto">
@@ -595,7 +593,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int graph::getConnectedComponents </td>
<td>(</td>
<td class="paramtype">const <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="paramtype">const <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="paramname"><em>adj</em></td><td>)</td>
<td></td>
</tr>
@@ -610,23 +608,23 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>connected_components number of connected components in graph. </dd></dl>
<div class="fragment"><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; {</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; <span class="keywordtype">int</span> n = adj-&gt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="keywordtype">int</span> connected_components = 0;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> visited(n, <span class="keyword">false</span>);</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; </div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="keywordflow">if</span> (!visited[i]) {</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <a class="code" href="../../df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9">explore</a>(adj, i, &amp;visited);</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; connected_components++;</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; }</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; }</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; <span class="keywordflow">return</span> connected_components;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160;}</div>
<div class="fragment"><div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> {</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordtype">int</span> n = adj-&gt;size();</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordtype">int</span> connected_components = 0;</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> visited(n, <span class="keyword">false</span>);</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">if</span> (!visited[i]) {</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, i, &amp;visited);</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> connected_components++;</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> }</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> }</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="keywordflow">return</span> connected_components;</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a9fc2ded2807582edf398e6d7c7114914_cgraph.svg" width="396" height="88"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.svg" width="388" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
@@ -638,7 +636,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../df/dce/namespacegraph.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.1 </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.2 </li>
</ul>
</div>
</body>

33
df/dce/namespacegraph.js
View File

@@ -1,36 +1,33 @@
var namespacegraph =
[
[ "bidirectional_dijkstra", null, [
[ "addEdge", "d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2", null ],
[ "Bidijkstra", "d7/d07/bidirectional__dijkstra_8cpp.html#aa3848a7213562b47084585499d3642a5", null ],
[ "Shortest_Path_Distance", "d7/d07/bidirectional__dijkstra_8cpp.html#ab322409d0015c023d91c67b5b2679257", null ]
[ "addEdge", "d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf", null ],
[ "Bidijkstra", "d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1", null ],
[ "Shortest_Path_Distance", "d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6", null ]
] ],
[ "depth_first_search", null, [
[ "addEdge", "da/d4b/depth__first__search__with__stack_8cpp.html#a7511fcdb330b3ab599ff9e15229ae068", null ],
[ "dfs", "da/d4b/depth__first__search__with__stack_8cpp.html#ae198aeaad22ccd56712b7380bd62f777", null ]
[ "addEdge", "da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b", null ],
[ "dfs", "da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9", null ]
] ],
[ "disjoint_union", null, [
[ "find_set", "d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e", null ],
[ "make_set", "d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62", null ],
[ "no_of_connected_components", "d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141", null ],
[ "union_sets", "d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145", null ],
[ "connected_set_size", "d8/d99/connected__components__with__dsu_8cpp.html#af675d8149b6a82cb7fa07f39210b8a2b", null ],
[ "number_of_nodes", "d8/d99/connected__components__with__dsu_8cpp.html#a7ab30d5b9594d90071a53c6d147158ef", null ],
[ "parent", "d8/d99/connected__components__with__dsu_8cpp.html#aa93bd9d3409fe4eeb7e5658eddd75fa8", null ]
[ "union_sets", "d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145", null ]
] ],
[ "is_graph_bipartite", null, [
[ "Graph", "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html", "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph" ]
] ],
[ "Graph", "dc/d61/classgraph_1_1_graph.html", "dc/d61/classgraph_1_1_graph" ],
[ "HKGraph", "d8/d69/classgraph_1_1_h_k_graph.html", "d8/d69/classgraph_1_1_h_k_graph" ],
[ "RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html", "d0/d58/classgraph_1_1_rooted_tree" ],
[ "LowestCommonAncestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html", "d9/d23/classgraph_1_1_lowest_common_ancestor" ],
[ "addEdge", "df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce", null ],
[ "addEdge", "df/dce/namespacegraph.html#a33d8f7759375aee956643d76df491b7b", null ],
[ "addEdge", "df/dce/namespacegraph.html#a454891267187a5ec6c6e3f3ad5203ff1", null ],
[ "depth_first_search", "df/dce/namespacegraph.html#a2e6017a54d445819ede9adcf33240e1a", null ],
[ "dijkstra", "df/dce/namespacegraph.html#a868530bfaed30e57290a76d5b4402d50", null ],
[ "explore", "df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9", null ],
[ "explore", "df/dce/namespacegraph.html#a48acac475cb48614279e7ea784c32fc3", null ],
[ "getConnectedComponents", "df/dce/namespacegraph.html#a9fc2ded2807582edf398e6d7c7114914", null ]
[ "RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html", "d0/d58/classgraph_1_1_rooted_tree" ],
[ "addEdge", "df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2", null ],
[ "addEdge", "df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08", null ],
[ "addEdge", "df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a", null ],
[ "depth_first_search", "df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae", null ],
[ "dijkstra", "df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84", null ],
[ "explore", "df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8", null ],
[ "explore", "df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463", null ],
[ "getConnectedComponents", "df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b", null ]
];

0
df/dce/namespacegraph_a454891267187a5ec6c6e3f3ad5203ff1_cgraph.map → df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.map
View File

0
df/dce/namespacegraph_a454891267187a5ec6c6e3f3ad5203ff1_cgraph.md5 → df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.md5
View File

2
df/dce/namespacegraph_a454891267187a5ec6c6e3f3ad5203ff1_cgraph.svg → df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.48.0 (20210717.1556)
<!-- Generated by graphviz version 2.49.0 (20210828.1703)
-->
<!-- Title: graph::addEdge Pages: 1 -->
<svg width="214pt" height="28pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

5
df/dce/namespacegraph_a2e6017a54d445819ede9adcf33240e1a_cgraph.map
View File

@@ -1,5 +0,0 @@
<map id="graph::depth_first_search" name="graph::depth_first_search">
<area shape="rect" id="node1" title="initiates depth first search algorithm." alt="" coords="5,23,131,65"/>
<area shape="rect" id="node2" href="$df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="183,5,289,32"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="179,56,293,83"/>
</map>

1
df/dce/namespacegraph_a2e6017a54d445819ede9adcf33240e1a_cgraph.md5
View File

@@ -1 +0,0 @@
fd6b525b4c2fd44089e715e847cf0cac

53
df/dce/namespacegraph_a2e6017a54d445819ede9adcf33240e1a_cgraph.svg
View File

@@ -1,53 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.48.0 (20210717.1556)
-->
<!-- Title: graph::depth_first_search Pages: 1 -->
<svg width="224pt" height="66pt"
viewBox="0.00 0.00 224.00 66.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 62)">
<title>graph::depth_first_search</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-62 220,-62 220,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="initiates depth first search algorithm.">
<polygon fill="#bfbfbf" stroke="black" points="0,-14 0,-44 94,-44 94,-14 0,-14"/>
<text text-anchor="start" x="8" y="-32" font-family="Helvetica,sans-Serif" font-size="10.00">graph::depth_first</text>
<text text-anchor="middle" x="47" y="-21" font-family="Helvetica,sans-Serif" font-size="10.00">_search</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
<polygon fill="white" stroke="black" points="133,-38.5 133,-57.5 213,-57.5 213,-38.5 133,-38.5"/>
<text text-anchor="middle" x="173" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M94.17,-36.07C103.48,-37.5 113.29,-39 122.7,-40.45"/>
<polygon fill="midnightblue" stroke="midnightblue" points="122.29,-43.92 132.7,-41.98 123.35,-37 122.29,-43.92"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="130,-0.5 130,-19.5 216,-19.5 216,-0.5 130,-0.5"/>
<text text-anchor="middle" x="173" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M94.17,-21.93C102.59,-20.64 111.42,-19.28 119.99,-17.97"/>
<polygon fill="midnightblue" stroke="midnightblue" points="120.53,-21.43 129.88,-16.45 119.47,-14.51 120.53,-21.43"/>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 2.6 KiB

3
df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="graph::explore" name="graph::explore">
<area shape="rect" id="node1" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="5,29,112,56"/>
</map>

1
df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
c4e57e3cabac454c2b30ddcd1344e665

28
df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.svg Normal file
View File

@@ -0,0 +1,28 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.0 (20210828.1703)
-->
<!-- Title: graph::explore Pages: 1 -->
<svg width="88pt" height="46pt"
viewBox="0.00 0.00 88.00 46.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42)">
<title>graph::explore</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 84,-42 84,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 80,-19.5 80,-0.5 0,-0.5"/>
<text text-anchor="middle" x="40" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M27.67,-19.76C21.67,-28.57 25.78,-38 40,-38 48.66,-38 53.58,-34.5 54.73,-29.77"/>
<polygon fill="midnightblue" stroke="midnightblue" points="58.07,-28.66 52.33,-19.76 51.26,-30.3 58.07,-28.66"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.3 KiB

1
df/dce/namespacegraph_a48acac475cb48614279e7ea784c32fc3_cgraph.md5
View File

@@ -1 +0,0 @@
c6d54475bbbaa8bb1ce8480f511bf7ed

4
df/dce/namespacegraph_a48acac475cb48614279e7ea784c32fc3_cgraph.map → df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.map
View File

@@ -1,4 +1,4 @@
<map id="graph::explore" name="graph::explore">
<area shape="rect" id="node1" title="Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec..." alt="" coords="5,5,112,32"/>
<area shape="rect" id="node2" href="$df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="160,5,267,32"/>
<area shape="rect" id="node1" title="Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec..." alt="" coords="5,29,112,56"/>
<area shape="rect" id="node2" href="$df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="160,29,267,56"/>
</map>

1
df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
5bbe427180bcb672ada19b379938fdf2

18
df/dce/namespacegraph_a48acac475cb48614279e7ea784c32fc3_cgraph.svg → df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.svg
View File

@@ -1,14 +1,14 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.48.0 (20210717.1556)
<!-- Generated by graphviz version 2.49.0 (20210828.1703)
-->
<!-- Title: graph::explore Pages: 1 -->
<svg width="204pt" height="28pt"
viewBox="0.00 0.00 204.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<svg width="204pt" height="46pt"
viewBox="0.00 0.00 204.00 46.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42)">
<title>graph::explore</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 200,-24 200,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 200,-42 200,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -21,7 +21,7 @@
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
<g id="a_node2"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
<polygon fill="white" stroke="black" points="116,-0.5 116,-19.5 196,-19.5 196,-0.5 116,-0.5"/>
<text text-anchor="middle" x="156" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
</a>
@@ -33,5 +33,11 @@
<path fill="none" stroke="midnightblue" d="M80.23,-10C88.38,-10 97.07,-10 105.54,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="105.7,-13.5 115.7,-10 105.7,-6.5 105.7,-13.5"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M138.12,-19.76C129.42,-28.57 135.38,-38 156,-38 168.89,-38 176.05,-34.31 177.48,-29.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="180.66,-27.9 173.88,-19.76 174.1,-30.35 180.66,-27.9"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.8 KiB

After

Width:  |  Height:  |  Size: 2.1 KiB

4
df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="graph::getConnectedComponents" name="graph::getConnectedComponents">
<area shape="rect" id="node1" title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co..." alt="" coords="5,29,228,56"/>
<area shape="rect" id="node2" href="$df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="276,29,383,56"/>
</map>

1
df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
c044c7105235c8551d1e22d625d71f80

43
df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.svg Normal file
View File

@@ -0,0 +1,43 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.0 (20210828.1703)
-->
<!-- Title: graph::getConnectedComponents Pages: 1 -->
<svg width="291pt" height="46pt"
viewBox="0.00 0.00 291.00 46.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42)">
<title>graph::getConnectedComponents</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-42 287,-42 287,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co...">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 167,-19.5 167,-0.5 0,-0.5"/>
<text text-anchor="middle" x="83.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::getConnectedComponents</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
<polygon fill="white" stroke="black" points="203,-0.5 203,-19.5 283,-19.5 283,-0.5 203,-0.5"/>
<text text-anchor="middle" x="243" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M167.4,-10C175.95,-10 184.44,-10 192.46,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="192.7,-13.5 202.7,-10 192.7,-6.5 192.7,-13.5"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M218.65,-19.76C206.8,-28.57 214.92,-38 243,-38 261.43,-38 271.26,-33.94 272.49,-28.65"/>
<polygon fill="midnightblue" stroke="midnightblue" points="275.39,-26.66 267.35,-19.76 269.32,-30.17 275.39,-26.66"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.2 KiB

4
df/dce/namespacegraph_a868530bfaed30e57290a76d5b4402d50_cgraph.map
View File

@@ -1,4 +0,0 @@
<map id="graph::dijkstra" name="graph::dijkstra">
<area shape="rect" id="node1" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="5,5,111,32"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="159,5,273,32"/>
</map>

1
df/dce/namespacegraph_a868530bfaed30e57290a76d5b4402d50_cgraph.md5
View File

@@ -1 +0,0 @@
d37dcc0db19130368c0b23b1e4783053

37
df/dce/namespacegraph_a868530bfaed30e57290a76d5b4402d50_cgraph.svg
View File

@@ -1,37 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.48.0 (20210717.1556)
-->
<!-- Title: graph::dijkstra Pages: 1 -->
<svg width="209pt" height="28pt"
viewBox="0.00 0.00 209.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>graph::dijkstra</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 205,-24 205,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 79,-19.5 79,-0.5 0,-0.5"/>
<text text-anchor="middle" x="39.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="115,-0.5 115,-19.5 201,-19.5 201,-0.5 115,-0.5"/>
<text text-anchor="middle" x="158" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M79.29,-10C87.39,-10 96.05,-10 104.54,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="104.77,-13.5 114.77,-10 104.77,-6.5 104.77,-13.5"/>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 1.7 KiB

5
df/dce/namespacegraph_a9fc2ded2807582edf398e6d7c7114914_cgraph.map
View File

@@ -1,5 +0,0 @@
<map id="graph::getConnectedComponents" name="graph::getConnectedComponents">
<area shape="rect" id="node1" title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co..." alt="" coords="5,31,228,57"/>
<area shape="rect" id="node2" href="$df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="280,5,387,32"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="276,56,391,83"/>
</map>

1
df/dce/namespacegraph_a9fc2ded2807582edf398e6d7c7114914_cgraph.md5
View File

@@ -1 +0,0 @@
740a76ada42c106a2d0535e985137991

52
df/dce/namespacegraph_a9fc2ded2807582edf398e6d7c7114914_cgraph.svg
View File

@@ -1,52 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.48.0 (20210717.1556)
-->
<!-- Title: graph::getConnectedComponents Pages: 1 -->
<svg width="297pt" height="66pt"
viewBox="0.00 0.00 297.00 66.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 62)">
<title>graph::getConnectedComponents</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-62 293,-62 293,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co...">
<polygon fill="#bfbfbf" stroke="black" points="0,-19.5 0,-38.5 167,-38.5 167,-19.5 0,-19.5"/>
<text text-anchor="middle" x="83.5" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::getConnectedComponents</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/dce/namespacegraph.html#a8e9885e0dd49fcf8262a9868124deac9" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
<polygon fill="white" stroke="black" points="206,-38.5 206,-57.5 286,-57.5 286,-38.5 206,-38.5"/>
<text text-anchor="middle" x="246" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M165.22,-38.56C175.54,-39.78 185.85,-41 195.46,-42.14"/>
<polygon fill="midnightblue" stroke="midnightblue" points="195.25,-45.64 205.59,-43.33 196.07,-38.68 195.25,-45.64"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="203,-0.5 203,-19.5 289,-19.5 289,-0.5 203,-0.5"/>
<text text-anchor="middle" x="246" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M165.22,-19.44C174.53,-18.34 183.84,-17.24 192.63,-16.2"/>
<polygon fill="midnightblue" stroke="midnightblue" points="193.18,-19.66 202.69,-15.01 192.35,-12.71 193.18,-19.66"/>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 2.6 KiB

4
df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="graph::depth_first_search" name="graph::depth_first_search">
<area shape="rect" id="node1" title="initiates depth first search algorithm." alt="" coords="5,22,131,63"/>
<area shape="rect" id="node2" href="$df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="179,29,285,56"/>
</map>

1
df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
93c80eb7f823cb85de3a7857df5fdb93

44
df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.svg Normal file
View File

@@ -0,0 +1,44 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.0 (20210828.1703)
-->
<!-- Title: graph::depth_first_search Pages: 1 -->
<svg width="218pt" height="52pt"
viewBox="0.00 0.00 218.00 51.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 47.5)">
<title>graph::depth_first_search</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-47.5 214,-47.5 214,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="initiates depth first search algorithm.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 94,-30.5 94,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::depth_first</text>
<text text-anchor="middle" x="47" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
<polygon fill="white" stroke="black" points="130,-6 130,-25 210,-25 210,-6 130,-6"/>
<text text-anchor="middle" x="170" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M94.09,-15.5C102.45,-15.5 111.19,-15.5 119.64,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="119.75,-19 129.75,-15.5 119.75,-12 119.75,-19"/>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M151.2,-25.26C142.05,-34.07 148.32,-43.5 170,-43.5 183.89,-43.5 191.46,-39.63 192.69,-34.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="195.9,-33.12 188.8,-25.26 189.44,-35.83 195.9,-33.12"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.2 KiB