mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-20 20:07:45 +08:00
892 lines
63 KiB
HTML
892 lines
63 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
|
<meta name="generator" content="Doxygen 1.14.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>TheAlgorithms/C++: graph Namespace Reference</title>
|
|
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
|
<script type="text/javascript">
|
|
DoxygenAwesomeDarkModeToggle.init()
|
|
</script>
|
|
<script type="text/javascript" src="../../clipboard.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<script type="text/javascript" src="../../cookie.js"></script>
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
|
<script type="text/javascript">
|
|
window.MathJax = {
|
|
options: {
|
|
ignoreHtmlClass: 'tex2jax_ignore',
|
|
processHtmlClass: 'tex2jax_process'
|
|
},
|
|
loader: {
|
|
load: ['[tex]/ams']
|
|
},
|
|
tex: {
|
|
macros: {},
|
|
packages: ['base','configmacros','ams']
|
|
}
|
|
};
|
|
</script>
|
|
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr id="projectrow">
|
|
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
|
<td id="projectalign">
|
|
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">All the algorithms implemented in C++</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
$(function(){initNavTree('df/dce/namespacegraph.html','../../',''); });
|
|
</script>
|
|
<div id="container">
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="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="#details">More...</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-nested-classes" class="groupheader"><a id="nested-classes" name="nested-classes"></a>
|
|
Classes</h2></td></tr>
|
|
<tr class="memitem:Graph" id="r_Graph"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a></td></tr>
|
|
<tr class="memitem:HKGraph" id="r_HKGraph"><td class="memItemLeft" align="right" valign="top">class  </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"> </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="memitem:LowestCommonAncestor" id="r_LowestCommonAncestor"><td class="memItemLeft" align="right" valign="top">class  </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="memitem:RootedTree" id="r_RootedTree"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a></td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:a9125ceb66bfbec3093bba64c2c1e99e2" id="r_a9125ceb66bfbec3093bba64c2c1e99e2"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a9125ceb66bfbec3093bba64c2c1e99e2">addEdge</a> (std::vector< std::vector< int > > *adj, int u, int v)</td></tr>
|
|
<tr class="memdesc:a9125ceb66bfbec3093bba64c2c1e99e2"><td class="mdescLeft"> </td><td class="mdescRight">Function that add edge between two nodes or vertices of graph. <br /></td></tr>
|
|
<tr class="memitem:a3ae80bc4c6a79d041b4f3a6589eb7fb8" id="r_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a> (const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *visited)</td></tr>
|
|
<tr class="memdesc:a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="mdescLeft"> </td><td class="mdescRight">Utility function for depth first seach algorithm this function explores the vertex which is passed into. <br /></td></tr>
|
|
<tr class="memitem:a83ab16e96cec644109a58dfc9329bc2b" id="r_a83ab16e96cec644109a58dfc9329bc2b"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#a83ab16e96cec644109a58dfc9329bc2b">getConnectedComponents</a> (const std::vector< std::vector< int > > *adj)</td></tr>
|
|
<tr class="memdesc:a83ab16e96cec644109a58dfc9329bc2b"><td class="mdescLeft"> </td><td class="mdescRight">Function that perfoms depth first search algorithm on graph and calculated the number of connected components. <br /></td></tr>
|
|
<tr class="memitem:ad4016cfc80485a43748895a2c26c7d08" id="r_ad4016cfc80485a43748895a2c26c7d08"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#ad4016cfc80485a43748895a2c26c7d08">addEdge</a> (std::vector< std::vector< size_t > > *adj, size_t u, size_t v)</td></tr>
|
|
<tr class="memdesc:ad4016cfc80485a43748895a2c26c7d08"><td class="mdescLeft"> </td><td class="mdescRight">Adds and edge between two vertices of graph say u and v in this case. <br /></td></tr>
|
|
<tr class="memitem:a64c1db5aad7502c6f08e4652f6edd463" id="r_a64c1db5aad7502c6f08e4652f6edd463"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a64c1db5aad7502c6f08e4652f6edd463">explore</a> (const std::vector< std::vector< size_t > > &adj, size_t v, std::vector< bool > *visited)</td></tr>
|
|
<tr class="memdesc:a64c1db5aad7502c6f08e4652f6edd463"><td class="mdescLeft"> </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. <br /></td></tr>
|
|
<tr class="memitem:ab5428a3519267a28bba4b4310cfbb6ae" id="r_ab5428a3519267a28bba4b4310cfbb6ae"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#ab5428a3519267a28bba4b4310cfbb6ae">depth_first_search</a> (const std::vector< std::vector< size_t > > &adj, size_t start)</td></tr>
|
|
<tr class="memdesc:ab5428a3519267a28bba4b4310cfbb6ae"><td class="mdescLeft"> </td><td class="mdescRight">initiates depth first search algorithm. <br /></td></tr>
|
|
<tr class="memitem:a0e30e0dca68cb6e4f671440819b35b6a" id="r_a0e30e0dca68cb6e4f671440819b35b6a"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a0e30e0dca68cb6e4f671440819b35b6a">addEdge</a> (std::vector< std::vector< std::pair< int, int > > > *adj, int u, int v, int w)</td></tr>
|
|
<tr class="memdesc:a0e30e0dca68cb6e4f671440819b35b6a"><td class="mdescLeft"> </td><td class="mdescRight">Function that add edge between two nodes or vertices of graph. <br /></td></tr>
|
|
<tr class="memitem:adc68cbc8ba09eb1142265935c0d45b84" id="r_adc68cbc8ba09eb1142265935c0d45b84"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#adc68cbc8ba09eb1142265935c0d45b84">dijkstra</a> (std::vector< std::vector< std::pair< int, int > > > *adj, int s, int t)</td></tr>
|
|
<tr class="memdesc:adc68cbc8ba09eb1142265935c0d45b84"><td class="mdescLeft"> </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. <br /></td></tr>
|
|
<tr class="memitem:a8e1b547cd407c0774e63f0dc95cda9e7" id="r_a8e1b547cd407c0774e63f0dc95cda9e7"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#a8e1b547cd407c0774e63f0dc95cda9e7">checkBipartite</a> (const std::vector< std::vector< int64_t > > &graph, int64_t index, std::vector< int64_t > *visited)</td></tr>
|
|
<tr class="memdesc:a8e1b547cd407c0774e63f0dc95cda9e7"><td class="mdescLeft"> </td><td class="mdescRight">function to check whether the passed graph is bipartite or not <br /></td></tr>
|
|
<tr class="memitem:a84b0551489c613a681cc83b34450da4b" id="r_a84b0551489c613a681cc83b34450da4b"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#a84b0551489c613a681cc83b34450da4b">isBipartite</a> (const std::vector< std::vector< int64_t > > &graph)</td></tr>
|
|
<tr class="memdesc:a84b0551489c613a681cc83b34450da4b"><td class="mdescLeft"> </td><td class="mdescRight">returns true if the given graph is bipartite else returns false <br /></td></tr>
|
|
<tr class="memitem:af99fccdd19e8f223e8749561589a762b" id="r_af99fccdd19e8f223e8749561589a762b"><td class="memItemLeft" align="right" valign="top">std::uint32_t </td><td class="memItemRight" valign="bottom"><a class="el" href="#af99fccdd19e8f223e8749561589a762b">count_paths_dfs</a> (const std::vector< std::vector< std::uint32_t > > &A, std::uint32_t u, std::uint32_t v, std::uint32_t n, std::vector< bool > &visited)</td></tr>
|
|
<tr class="memdesc:af99fccdd19e8f223e8749561589a762b"><td class="mdescLeft"> </td><td class="mdescRight">Helper function to perform DFS and count the number of paths from node <span class="tt">u</span> to node <span class="tt">v</span> <br /></td></tr>
|
|
<tr class="memitem:a7c3adb1551bc527a7aa93f331b1c0987" id="r_a7c3adb1551bc527a7aa93f331b1c0987"><td class="memItemLeft" align="right" valign="top">std::uint32_t </td><td class="memItemRight" valign="bottom"><a class="el" href="#a7c3adb1551bc527a7aa93f331b1c0987">count_paths</a> (const std::vector< std::vector< std::uint32_t > > &A, std::uint32_t u, std::uint32_t v, std::uint32_t n)</td></tr>
|
|
<tr class="memdesc:a7c3adb1551bc527a7aa93f331b1c0987"><td class="mdescLeft"> </td><td class="mdescRight">Counts the number of paths from node <span class="tt">u</span> to node <span class="tt">v</span> in a directed graph using Depth First Search (DFS) <br /></td></tr>
|
|
<tr class="memitem:ab7706341d006e20d1ae58274187a3346" id="r_ab7706341d006e20d1ae58274187a3346"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ab7706341d006e20d1ae58274187a3346">TravellingSalesmanProblem</a> (std::vector< std::vector< uint32_t > > *cities, int32_t src, uint32_t V)</td></tr>
|
|
<tr class="memdesc:ab7706341d006e20d1ae58274187a3346"><td class="mdescLeft"> </td><td class="mdescRight">Function calculates the minimum path distance that will cover all the cities starting from the source. <br /></td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 id="header-details" 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 assert</p>
|
|
<p>Check whether a given graph is bipartite or not.</p>
|
|
<p>for std::vector</p>
|
|
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms.</p>
|
|
<p>for IO operations for std::set</p>
|
|
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms</p>
|
|
<p>A bipartite graph is the one whose nodes can be divided into two disjoint sets in such a way that the nodes in a set are not connected to each other at all, i.e. no intra-set connections. The only connections that exist are that of inter-set, i.e. the nodes from one set are connected to a subset of nodes in the other set. In this implementation, using a graph in the form of adjacency list, check whether the given graph is a bipartite or not.</p>
|
|
<p>References used: <a href="https://www.geeksforgeeks.org/bipartite-graph/" target="_blank">GeeksForGeeks</a> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/tushar2407" target="_blank">tushar2407</a> for assert for IO operations for queue data structure for vector data structure</dd></dl>
|
|
<p>Graphical algorithms</p>
|
|
<p>for std::vector for IO operations for assert for fixed-size integer types (e.g., std::uint32_t)</p>
|
|
<p>for std::min for IO operations for limits of integral types for std::vector</p>
|
|
<p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms </p>
|
|
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
|
|
<a id="a9125ceb66bfbec3093bba64c2c1e99e2" name="a9125ceb66bfbec3093bba64c2c1e99e2"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a9125ceb66bfbec3093bba64c2c1e99e2">◆ </a></span>addEdge() <span class="overload">[1/3]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void graph::addEdge </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< std::vector< int > > *</td> <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>u</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>v</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Function that add edge between two nodes or vertices of graph. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj</td><td>adjacency list of graph. </td></tr>
|
|
<tr><td class="paramname">u</td><td>any node or vertex of graph. </td></tr>
|
|
<tr><td class="paramname">v</td><td>any node or vertex of graph. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../df/ddd/connected__components_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../df/ddd/connected__components_8cpp_source.html">connected_components.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 46</span> {</div>
|
|
<div class="line"><span class="lineno"> 47</span> (*adj)[u - 1].push_back(v - 1);</div>
|
|
<div class="line"><span class="lineno"> 48</span> (*adj)[v - 1].push_back(u - 1);</div>
|
|
<div class="line"><span class="lineno"> 49</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ad4016cfc80485a43748895a2c26c7d08" name="ad4016cfc80485a43748895a2c26c7d08"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ad4016cfc80485a43748895a2c26c7d08">◆ </a></span>addEdge() <span class="overload">[2/3]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void graph::addEdge </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< std::vector< size_t > > *</td> <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>u</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>v</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Adds and edge between two vertices of graph say u and v in this case. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj</td><td>Adjacency list representation of graph </td></tr>
|
|
<tr><td class="paramname">u</td><td>first vertex </td></tr>
|
|
<tr><td class="paramname">v</td><td>second vertex </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html">depth_first_search.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 56</span> {</div>
|
|
<div class="line"><span class="lineno"> 57</span> <span class="comment">/*</span></div>
|
|
<div class="line"><span class="lineno"> 58</span><span class="comment"> *</span></div>
|
|
<div class="line"><span class="lineno"> 59</span><span class="comment"> * Here we are considering undirected graph that's the</span></div>
|
|
<div class="line"><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"><span class="lineno"> 61</span><span class="comment"> * and also adding u to the adjacency list representation of v</span></div>
|
|
<div class="line"><span class="lineno"> 62</span><span class="comment"> *</span></div>
|
|
<div class="line"><span class="lineno"> 63</span><span class="comment"> */</span></div>
|
|
<div class="line"><span class="lineno"> 64</span> (*adj)[u - 1].push_back(v - 1);</div>
|
|
<div class="line"><span class="lineno"> 65</span> (*adj)[v - 1].push_back(u - 1);</div>
|
|
<div class="line"><span class="lineno"> 66</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a0e30e0dca68cb6e4f671440819b35b6a" name="a0e30e0dca68cb6e4f671440819b35b6a"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a0e30e0dca68cb6e4f671440819b35b6a">◆ </a></span>addEdge() <span class="overload">[3/3]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void graph::addEdge </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< std::vector< std::pair< int, int > > > *</td> <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>u</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>v</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>w</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Function that add edge between two nodes or vertices of graph. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">u</td><td>any node or vertex of graph </td></tr>
|
|
<tr><td class="paramname">v</td><td>any node or vertex of graph </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html">dijkstra.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 49</span> {</div>
|
|
<div class="line"><span class="lineno"> 50</span> (*adj)[u - 1].push_back(std::make_pair(v - 1, w));</div>
|
|
<div class="line"><span class="lineno"> 51</span> <span class="comment">// (*adj)[v - 1].push_back(std::make_pair(u - 1, w));</span></div>
|
|
<div class="line"><span class="lineno"> 52</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a8e1b547cd407c0774e63f0dc95cda9e7" name="a8e1b547cd407c0774e63f0dc95cda9e7"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a8e1b547cd407c0774e63f0dc95cda9e7">◆ </a></span>checkBipartite()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool graph::checkBipartite </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< std::vector< int64_t > > &</td> <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>index</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::vector< int64_t > *</td> <td class="paramname"><span class="paramname"><em>visited</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>function to check whether the passed graph is bipartite or not </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">graph</td><td>is a 2D matrix whose rows or the first index signify the node and values in that row signify the nodes it is connected to </td></tr>
|
|
<tr><td class="paramname">index</td><td>is the valus of the node currently under observation </td></tr>
|
|
<tr><td class="paramname">visited</td><td>is the vector which stores whether a given node has been traversed or not yet </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>boolean </dd></dl>
|
|
<p>< stores the neighbouring node indexes in squence of being reached</p>
|
|
<p>insert the current node into the queue</p>
|
|
<p>mark the current node as travelled</p>
|
|
<p>< stores the neighbour of the current node</p>
|
|
<p>check whether the neighbour node is travelled already or not</p>
|
|
<p>colour the neighbouring node with different colour than the current node</p>
|
|
<p>insert the neighbouring node into the queue</p>
|
|
<p>if both the current node and its neighbour has the same state then it is not a bipartite graph</p>
|
|
<p>return true when all the connected nodes of the current nodes are travelled and satisify all the above conditions</p>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../dd/dc3/is__graph__bipartite2_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../dd/dc3/is__graph__bipartite2_8cpp_source.html">is_graph_bipartite2.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 38</span> {</div>
|
|
<div class="line"><span class="lineno"> 39</span> std::queue<int64_t> q; </div>
|
|
<div class="line"><span class="lineno"> 41</span> q.push(index); </div>
|
|
<div class="line"><span class="lineno"> 42</span> (*visited)[index] = 1; </div>
|
|
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">while</span> (q.size()) {</div>
|
|
<div class="line"><span class="lineno"> 44</span> int64_t u = q.front();</div>
|
|
<div class="line"><span class="lineno"> 45</span> q.pop();</div>
|
|
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[u].size(); i++) {</div>
|
|
<div class="line"><span class="lineno"> 47</span> int64_t v =</div>
|
|
<div class="line"><span class="lineno"> 48</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[u][i]; </div>
|
|
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">if</span> (!(*visited)[v]) </div>
|
|
<div class="line"><span class="lineno"> 51</span> {</div>
|
|
<div class="line"><span class="lineno"> 52</span> (*visited)[v] =</div>
|
|
<div class="line"><span class="lineno"> 53</span> ((*visited)[u] == 1)</div>
|
|
<div class="line"><span class="lineno"> 54</span> ? -1</div>
|
|
<div class="line"><span class="lineno"> 55</span> : 1; </div>
|
|
<div class="line"><span class="lineno"> 57</span> q.push(v); </div>
|
|
<div class="line"><span class="lineno"> 58</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*visited)[v] ==</div>
|
|
<div class="line"><span class="lineno"> 59</span> (*visited)[u]) </div>
|
|
<div class="line"><span class="lineno"> 62</span> {</div>
|
|
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><span class="lineno"> 64</span> }</div>
|
|
<div class="line"><span class="lineno"> 65</span> }</div>
|
|
<div class="line"><span class="lineno"> 66</span> }</div>
|
|
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> <span class="keyword">true</span>; </div>
|
|
<div class="line"><span class="lineno"> 69</span>}</div>
|
|
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a7c3adb1551bc527a7aa93f331b1c0987" name="a7c3adb1551bc527a7aa93f331b1c0987"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a7c3adb1551bc527a7aa93f331b1c0987">◆ </a></span>count_paths()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::uint32_t graph::count_paths </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< std::vector< std::uint32_t > > &</td> <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::uint32_t</td> <td class="paramname"><span class="paramname"><em>u</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::uint32_t</td> <td class="paramname"><span class="paramname"><em>v</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::uint32_t</td> <td class="paramname"><span class="paramname"><em>n</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Counts the number of paths from node <span class="tt">u</span> to node <span class="tt">v</span> in a directed graph using Depth First Search (DFS) </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">A</td><td>adjacency matrix representing the graph (1: edge exists, 0: no edge) </td></tr>
|
|
<tr><td class="paramname">u</td><td>the starting node </td></tr>
|
|
<tr><td class="paramname">v</td><td>the destination node </td></tr>
|
|
<tr><td class="paramname">n</td><td>the number of nodes in the graph </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>the number of paths from node <span class="tt">u</span> to node <span class="tt">v</span> </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d2/d32/number__of__paths_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d2/d32/number__of__paths_8cpp_source.html">number_of_paths.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 70</span> {</div>
|
|
<div class="line"><span class="lineno"> 71</span> <span class="comment">// Check for invalid nodes or empty graph</span></div>
|
|
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (u >= n || v >= n || A.empty() || A[0].empty()) {</div>
|
|
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> 0; <span class="comment">// No valid paths if graph is empty or nodes are out of bounds</span></div>
|
|
<div class="line"><span class="lineno"> 74</span> }</div>
|
|
<div class="line"><span class="lineno"> 75</span> </div>
|
|
<div class="line"><span class="lineno"> 76</span> std::vector<bool> visited(n, <span class="keyword">false</span>); <span class="comment">// Initialize a visited vector for tracking nodes</span></div>
|
|
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#af99fccdd19e8f223e8749561589a762b">count_paths_dfs</a>(A, u, v, n, visited); <span class="comment">// Start DFS</span></div>
|
|
<div class="line"><span class="lineno"> 78</span> }</div>
|
|
<div class="ttc" id="anamespacegraph_html_af99fccdd19e8f223e8749561589a762b"><div class="ttname"><a href="#af99fccdd19e8f223e8749561589a762b">graph::count_paths_dfs</a></div><div class="ttdeci">std::uint32_t count_paths_dfs(const std::vector< std::vector< std::uint32_t > > &A, std::uint32_t u, std::uint32_t v, std::uint32_t n, std::vector< bool > &visited)</div><div class="ttdoc">Helper function to perform DFS and count the number of paths from node u to node v</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d32/number__of__paths_8cpp_source.html#l00034">number_of_paths.cpp:34</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="af99fccdd19e8f223e8749561589a762b" name="af99fccdd19e8f223e8749561589a762b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#af99fccdd19e8f223e8749561589a762b">◆ </a></span>count_paths_dfs()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::uint32_t graph::count_paths_dfs </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< std::vector< std::uint32_t > > &</td> <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::uint32_t</td> <td class="paramname"><span class="paramname"><em>u</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::uint32_t</td> <td class="paramname"><span class="paramname"><em>v</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::uint32_t</td> <td class="paramname"><span class="paramname"><em>n</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::vector< bool > &</td> <td class="paramname"><span class="paramname"><em>visited</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Helper function to perform DFS and count the number of paths from node <span class="tt">u</span> to node <span class="tt">v</span> </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">A</td><td>adjacency matrix representing the graph (1: edge exists, 0: no edge) </td></tr>
|
|
<tr><td class="paramname">u</td><td>the starting node </td></tr>
|
|
<tr><td class="paramname">v</td><td>the destination node </td></tr>
|
|
<tr><td class="paramname">n</td><td>the number of nodes in the graph </td></tr>
|
|
<tr><td class="paramname">visited</td><td>a vector to keep track of visited nodes in the current DFS path </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>the number of paths from node <span class="tt">u</span> to node <span class="tt">v</span> </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d2/d32/number__of__paths_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d2/d32/number__of__paths_8cpp_source.html">number_of_paths.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 38</span> {</div>
|
|
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">if</span> (u == v) {</div>
|
|
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">return</span> 1; <span class="comment">// Base case: Reached the destination node</span></div>
|
|
<div class="line"><span class="lineno"> 41</span> }</div>
|
|
<div class="line"><span class="lineno"> 42</span> </div>
|
|
<div class="line"><span class="lineno"> 43</span> visited[u] = <span class="keyword">true</span>; <span class="comment">// Mark the current node as visited</span></div>
|
|
<div class="line"><span class="lineno"> 44</span> std::uint32_t path_count = 0; <span class="comment">// Count of all paths from `u` to `v`</span></div>
|
|
<div class="line"><span class="lineno"> 45</span> </div>
|
|
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">for</span> (std::uint32_t i = 0; i < n; i++) {</div>
|
|
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">if</span> (A[u][i] == 1 && !visited[i]) { <span class="comment">// Check if there is an edge and the node is not visited</span></div>
|
|
<div class="line"><span class="lineno"> 48</span> path_count += <a class="code hl_function" href="#af99fccdd19e8f223e8749561589a762b">count_paths_dfs</a>(A, i, v, n, visited); <span class="comment">// Recursively explore paths from `i` to `v`</span></div>
|
|
<div class="line"><span class="lineno"> 49</span> }</div>
|
|
<div class="line"><span class="lineno"> 50</span> }</div>
|
|
<div class="line"><span class="lineno"> 51</span> </div>
|
|
<div class="line"><span class="lineno"> 52</span> visited[u] = <span class="keyword">false</span>; <span class="comment">// Unmark the current node as visited (backtracking)</span></div>
|
|
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">return</span> path_count;</div>
|
|
<div class="line"><span class="lineno"> 54</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ab5428a3519267a28bba4b4310cfbb6ae" name="ab5428a3519267a28bba4b4310cfbb6ae"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ab5428a3519267a28bba4b4310cfbb6ae">◆ </a></span>depth_first_search()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void graph::depth_first_search </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< std::vector< size_t > > &</td> <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>start</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>initiates depth first search algorithm. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj</td><td>adjacency list of graph </td></tr>
|
|
<tr><td class="paramname">start</td><td>vertex from where DFS starts traversing. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html#l00099">99</a> of file <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html">depth_first_search.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 100</span> {</div>
|
|
<div class="line"><span class="lineno"> 101</span> <span class="keywordtype">size_t</span> vertices = adj.size();</div>
|
|
<div class="line"><span class="lineno"> 102</span> </div>
|
|
<div class="line"><span class="lineno"> 103</span> std::vector<bool> visited(vertices, <span class="keyword">false</span>);</div>
|
|
<div class="line"><span class="lineno"> 104</span> <a class="code hl_function" href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, start, &visited);</div>
|
|
<div class="line"><span class="lineno"> 105</span>}</div>
|
|
<div class="ttc" id="anamespacegraph_html_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><div class="ttname"><a href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">graph::explore</a></div><div class="ttdeci">void explore(const std::vector< std::vector< int > > *adj, int u, std::vector< bool > *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> <a href="../../df/ddd/connected__components_8cpp_source.html#l00059">connected_components.cpp:59</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="adc68cbc8ba09eb1142265935c0d45b84" name="adc68cbc8ba09eb1142265935c0d45b84"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#adc68cbc8ba09eb1142265935c0d45b84">◆ </a></span>dijkstra()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int graph::dijkstra </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< std::vector< std::pair< int, int > > > *</td> <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>t</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>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. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj</td><td>input graph </td></tr>
|
|
<tr><td class="paramname">s</td><td>source vertex </td></tr>
|
|
<tr><td class="paramname">t</td><td>target vertex</td></tr>
|
|
</table>
|
|
</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>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html">dijkstra.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 66</span> {</div>
|
|
<div class="line"><span class="lineno"> 68</span> <span class="keywordtype">int</span> n = adj->size();</div>
|
|
<div class="line"><span class="lineno"> 69</span></div>
|
|
<div class="line"><span class="lineno"> 71</span> std::vector<int64_t> dist(n, <a class="code hl_variable" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>);</div>
|
|
<div class="line"><span class="lineno"> 72</span></div>
|
|
<div class="line"><span class="lineno"> 76</span> std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>,</div>
|
|
<div class="line"><span class="lineno"> 77</span> std::greater<std::pair<int, int>>></div>
|
|
<div class="line"><span class="lineno"> 78</span> pq;</div>
|
|
<div class="line"><span class="lineno"> 79</span></div>
|
|
<div class="line"><span class="lineno"> 81</span> pq.push(std::make_pair(0, s));</div>
|
|
<div class="line"><span class="lineno"> 82</span></div>
|
|
<div class="line"><span class="lineno"> 84</span> dist[s] = 0;</div>
|
|
<div class="line"><span class="lineno"> 85</span> </div>
|
|
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">while</span> (!pq.empty()) {</div>
|
|
<div class="line"><span class="lineno"> 88</span> <span class="keywordtype">int</span> currentNode = pq.top().second;</div>
|
|
<div class="line"><span class="lineno"> 89</span></div>
|
|
<div class="line"><span class="lineno"> 91</span> <span class="keywordtype">int</span> currentDist = pq.top().first;</div>
|
|
<div class="line"><span class="lineno"> 92</span> </div>
|
|
<div class="line"><span class="lineno"> 93</span> pq.pop();</div>
|
|
<div class="line"><span class="lineno"> 94</span></div>
|
|
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">for</span> (std::pair<int, int> edge : (*adj)[currentNode]) {</div>
|
|
<div class="line"><span class="lineno"> 99</span> <span class="keywordflow">if</span> (currentDist + edge.second < dist[edge.first]) {</div>
|
|
<div class="line"><span class="lineno"> 100</span> dist[edge.first] = currentDist + edge.second;</div>
|
|
<div class="line"><span class="lineno"> 101</span> pq.push(std::make_pair(dist[edge.first], edge.first));</div>
|
|
<div class="line"><span class="lineno"> 102</span> }</div>
|
|
<div class="line"><span class="lineno"> 103</span> }</div>
|
|
<div class="line"><span class="lineno"> 104</span> }</div>
|
|
<div class="line"><span class="lineno"> 105</span> <span class="keywordflow">if</span> (dist[t] != <a class="code hl_variable" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>) {</div>
|
|
<div class="line"><span class="lineno"> 106</span> <span class="keywordflow">return</span> dist[t];</div>
|
|
<div class="line"><span class="lineno"> 107</span> }</div>
|
|
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><span class="lineno"> 109</span>}</div>
|
|
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a330a2b0a904f01802ada1f8f3b28e76c"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a></div><div class="ttdeci">constexpr int64_t INF</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00024">bidirectional_dijkstra.cpp:24</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a3ae80bc4c6a79d041b4f3a6589eb7fb8" name="a3ae80bc4c6a79d041b4f3a6589eb7fb8"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">◆ </a></span>explore() <span class="overload">[1/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void graph::explore </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< std::vector< int > > *</td> <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>u</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::vector< bool > *</td> <td class="paramname"><span class="paramname"><em>visited</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Utility function for depth first seach algorithm this function explores the vertex which is passed into. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj</td><td>adjacency list of graph. </td></tr>
|
|
<tr><td class="paramname">u</td><td>vertex or node to be explored. </td></tr>
|
|
<tr><td class="paramname">visited</td><td>already visited vertices. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../df/ddd/connected__components_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../df/ddd/connected__components_8cpp_source.html">connected_components.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 60</span> {</div>
|
|
<div class="line"><span class="lineno"> 61</span> (*visited)[u] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> v : (*adj)[u]) {</div>
|
|
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">if</span> (!(*visited)[v]) {</div>
|
|
<div class="line"><span class="lineno"> 64</span> <a class="code hl_function" href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, v, visited);</div>
|
|
<div class="line"><span class="lineno"> 65</span> }</div>
|
|
<div class="line"><span class="lineno"> 66</span> }</div>
|
|
<div class="line"><span class="lineno"> 67</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a64c1db5aad7502c6f08e4652f6edd463" name="a64c1db5aad7502c6f08e4652f6edd463"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a64c1db5aad7502c6f08e4652f6edd463">◆ </a></span>explore() <span class="overload">[2/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void graph::explore </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< std::vector< size_t > > &</td> <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>v</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::vector< bool > *</td> <td class="paramname"><span class="paramname"><em>visited</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj</td><td>garph </td></tr>
|
|
<tr><td class="paramname">v</td><td>vertex to be explored </td></tr>
|
|
<tr><td class="paramname">visited</td><td>already visited vertices </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html">depth_first_search.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 81</span> {</div>
|
|
<div class="line"><span class="lineno"> 82</span> std::cout << v + 1 << <span class="stringliteral">" "</span>;</div>
|
|
<div class="line"><span class="lineno"> 83</span> (*visited)[v] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : adj[v]) {</div>
|
|
<div class="line"><span class="lineno"> 85</span> <span class="keywordflow">if</span> (!(*visited)[x]) {</div>
|
|
<div class="line"><span class="lineno"> 86</span> <a class="code hl_function" href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, x, visited);</div>
|
|
<div class="line"><span class="lineno"> 87</span> }</div>
|
|
<div class="line"><span class="lineno"> 88</span> }</div>
|
|
<div class="line"><span class="lineno"> 89</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a83ab16e96cec644109a58dfc9329bc2b" name="a83ab16e96cec644109a58dfc9329bc2b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a83ab16e96cec644109a58dfc9329bc2b">◆ </a></span>getConnectedComponents()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int graph::getConnectedComponents </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< std::vector< int > > *</td> <td class="paramname"><span class="paramname"><em>adj</em></span></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Function that perfoms depth first search algorithm on graph and calculated the number of connected components. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">adj</td><td>adjacency list of graph.</td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>connected_components number of connected components in graph. </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../df/ddd/connected__components_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../df/ddd/connected__components_8cpp_source.html">connected_components.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 77</span> {</div>
|
|
<div class="line"><span class="lineno"> 78</span> <span class="keywordtype">int</span> n = adj->size();</div>
|
|
<div class="line"><span class="lineno"> 79</span> <span class="keywordtype">int</span> connected_components = 0;</div>
|
|
<div class="line"><span class="lineno"> 80</span> std::vector<bool> visited(n, <span class="keyword">false</span>);</div>
|
|
<div class="line"><span class="lineno"> 81</span> </div>
|
|
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
|
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">if</span> (!visited[i]) {</div>
|
|
<div class="line"><span class="lineno"> 84</span> <a class="code hl_function" href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, i, &visited);</div>
|
|
<div class="line"><span class="lineno"> 85</span> connected_components++;</div>
|
|
<div class="line"><span class="lineno"> 86</span> }</div>
|
|
<div class="line"><span class="lineno"> 87</span> }</div>
|
|
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">return</span> connected_components;</div>
|
|
<div class="line"><span class="lineno"> 89</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a84b0551489c613a681cc83b34450da4b" name="a84b0551489c613a681cc83b34450da4b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a84b0551489c613a681cc83b34450da4b">◆ </a></span>isBipartite()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool graph::isBipartite </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< std::vector< int64_t > > &</td> <td class="paramname"><span class="paramname"><em>graph</em></span></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>returns true if the given graph is bipartite else returns false </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">graph</td><td>is a 2D matrix whose rows or the first index signify the node and values in that row signify the nodes it is connected to </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>booleans </dd></dl>
|
|
<p>< stores boolean values which signify whether that node had been visited or not</p>
|
|
<p>if the current node is not visited then check whether the sub-graph of that node is a bipartite or not</p>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../dd/dc3/is__graph__bipartite2_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../dd/dc3/is__graph__bipartite2_8cpp_source.html">is_graph_bipartite2.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 76</span> {</div>
|
|
<div class="line"><span class="lineno"> 77</span> std::vector<int64_t> visited(</div>
|
|
<div class="line"><span class="lineno"> 78</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size()); </div>
|
|
<div class="line"><span class="lineno"> 81</span> </div>
|
|
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">for</span> (uint64_t i = 0; i < <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(); i++) {</div>
|
|
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">if</span> (!visited[i]) </div>
|
|
<div class="line"><span class="lineno"> 86</span> {</div>
|
|
<div class="line"><span class="lineno"> 87</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a8e1b547cd407c0774e63f0dc95cda9e7">checkBipartite</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, i, &visited)) {</div>
|
|
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><span class="lineno"> 89</span> }</div>
|
|
<div class="line"><span class="lineno"> 90</span> }</div>
|
|
<div class="line"><span class="lineno"> 91</span> }</div>
|
|
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><span class="lineno"> 93</span>}</div>
|
|
<div class="ttc" id="anamespacegraph_html_a8e1b547cd407c0774e63f0dc95cda9e7"><div class="ttname"><a href="#a8e1b547cd407c0774e63f0dc95cda9e7">graph::checkBipartite</a></div><div class="ttdeci">bool checkBipartite(const std::vector< std::vector< int64_t > > &graph, int64_t index, std::vector< int64_t > *visited)</div><div class="ttdoc">function to check whether the passed graph is bipartite or not</div><div class="ttdef"><b>Definition</b> <a href="../../dd/dc3/is__graph__bipartite2_8cpp_source.html#l00037">is_graph_bipartite2.cpp:37</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ab7706341d006e20d1ae58274187a3346" name="ab7706341d006e20d1ae58274187a3346"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ab7706341d006e20d1ae58274187a3346">◆ </a></span>TravellingSalesmanProblem()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int graph::TravellingSalesmanProblem </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< std::vector< uint32_t > > *</td> <td class="paramname"><span class="paramname"><em>cities</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int32_t</td> <td class="paramname"><span class="paramname"><em>src</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">uint32_t</td> <td class="paramname"><span class="paramname"><em>V</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Function calculates the minimum path distance that will cover all the cities starting from the source. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">cities</td><td>matrix representation of cities </td></tr>
|
|
<tr><td class="paramname">src</td><td><a class="el" href="../../d8/dc8/struct_point.html">Point</a> from where salesman is starting </td></tr>
|
|
<tr><td class="paramname">V</td><td>number of vertices in the graph </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../de/d88/travelling__salesman__problem_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../de/d88/travelling__salesman__problem_8cpp_source.html">travelling_salesman_problem.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 42</span> {</div>
|
|
<div class="line"><span class="lineno"> 44</span> std::vector<uint32_t> vtx;</div>
|
|
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">for</span> (uint32_t i = 0; i < V; i++) {</div>
|
|
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (i != src) {</div>
|
|
<div class="line"><span class="lineno"> 47</span> vtx.push_back(i);</div>
|
|
<div class="line"><span class="lineno"> 48</span> }</div>
|
|
<div class="line"><span class="lineno"> 49</span> }</div>
|
|
<div class="line"><span class="lineno"> 50</span></div>
|
|
<div class="line"><span class="lineno"> 52</span> int32_t min_path = 2147483647;</div>
|
|
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><span class="lineno"> 55</span> int32_t curr_weight = 0;</div>
|
|
<div class="line"><span class="lineno"> 56</span></div>
|
|
<div class="line"><span class="lineno"> 58</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = src;</div>
|
|
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : vtx) {</div>
|
|
<div class="line"><span class="lineno"> 60</span> curr_weight += (*cities)[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>][i];</div>
|
|
<div class="line"><span class="lineno"> 61</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = i;</div>
|
|
<div class="line"><span class="lineno"> 62</span> }</div>
|
|
<div class="line"><span class="lineno"> 63</span> curr_weight += (*cities)[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>][src];</div>
|
|
<div class="line"><span class="lineno"> 64</span></div>
|
|
<div class="line"><span class="lineno"> 66</span> min_path = std::min(min_path, curr_weight);</div>
|
|
<div class="line"><span class="lineno"> 67</span> </div>
|
|
<div class="line"><span class="lineno"> 68</span> } <span class="keywordflow">while</span> (next_permutation(vtx.begin(), vtx.end()));</div>
|
|
<div class="line"><span class="lineno"> 69</span> </div>
|
|
<div class="line"><span class="lineno"> 70</span> <span class="keywordflow">return</span> min_path;</div>
|
|
<div class="line"><span class="lineno"> 71</span>}</div>
|
|
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div id="page-nav" class="page-nav-panel">
|
|
<div id="page-nav-resize-handle"></div>
|
|
<div id="page-nav-tree">
|
|
<div id="page-nav-contents">
|
|
</div><!-- page-nav-contents -->
|
|
</div><!-- page-nav-tree -->
|
|
</div><!-- page-nav -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a 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.14.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|