backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-11 11:07:27 +08:00
Code Issues Projects Releases Wiki Activity
Files
14583a2f33720eba2e2786d75e8e2312b85fa667
C-Plus-Plus/d9/d23/classgraph_1_1_lowest_common_ancestor.html
realstealthninja 14583a2f33 Documentation for c26eea874d
2025-05-19 11:38:33 +00:00

371 lines
24 KiB
HTML
Raw Blame History

<!-- 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.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: graph::LowestCommonAncestor Class 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="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/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">&#160;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.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d9/d23/classgraph_1_1_lowest_common_ancestor.html','../../'); initResizable(true); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pub-attribs">Public Attributes</a> &#124;
<a href="#pro-methods">Protected Member Functions</a> &#124;
<a href="../../da/d73/classgraph_1_1_lowest_common_ancestor-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">graph::LowestCommonAncestor Class Reference</div></div>
</div><!--header-->
<div class="contents">
<div class="dynheader">
Collaboration diagram for graph::LowestCommonAncestor:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg" width="414" height="436"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a80825a4fd4c41860b689d253dd2c8e93" id="r_a80825a4fd4c41860b689d253dd2c8e93"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a80825a4fd4c41860b689d253dd2c8e93">LowestCommonAncestor</a> (const <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> &amp;tree_)</td></tr>
<tr class="memdesc:a80825a4fd4c41860b689d253dd2c8e93"><td class="mdescLeft">&#160;</td><td class="mdescRight">Stores the tree and precomputs "up lifts". <br /></td></tr>
<tr class="separator:a80825a4fd4c41860b689d253dd2c8e93"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a60151e19512b48cc0b14ea121df00488" id="r_a60151e19512b48cc0b14ea121df00488"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a60151e19512b48cc0b14ea121df00488">lowest_common_ancestor</a> (int u, int v) const</td></tr>
<tr class="memdesc:a60151e19512b48cc0b14ea121df00488"><td class="mdescLeft">&#160;</td><td class="mdescRight">Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid indices of vertices. Iterativelly modifies ("lifts") u an v until it finnds their lowest common ancestor. <br /></td></tr>
<tr class="separator:a60151e19512b48cc0b14ea121df00488"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:ad6ae1f39c3ce27fc009970e6aa3c022a" id="r_ad6ae1f39c3ce27fc009970e6aa3c022a"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad6ae1f39c3ce27fc009970e6aa3c022a">tree</a></td></tr>
<tr class="separator:ad6ae1f39c3ce27fc009970e6aa3c022a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a46d10f669791e3da9a4809bd8ff8d3ad" id="r_a46d10f669791e3da9a4809bd8ff8d3ad"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a></td></tr>
<tr class="memdesc:a46d10f669791e3da9a4809bd8ff8d3ad"><td class="mdescLeft">&#160;</td><td class="mdescRight">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element of the corresponding list contains the index of its parent. The i-th element of the list is an index of the (2^i)-th ancestor of the vertex. <br /></td></tr>
<tr class="separator:a46d10f669791e3da9a4809bd8ff8d3ad"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-methods" name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:a42589cc39d6bbff6c997152f1b96e356" id="r_a42589cc39d6bbff6c997152f1b96e356"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a42589cc39d6bbff6c997152f1b96e356">populate_up</a> ()</td></tr>
<tr class="separator:a42589cc39d6bbff6c997152f1b96e356"><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 structure that holds a rooted tree and allow for effecient queries of the lowest common ancestor of two given vertices in the tree. </p>
<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00145">145</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a80825a4fd4c41860b689d253dd2c8e93" name="a80825a4fd4c41860b689d253dd2c8e93"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a80825a4fd4c41860b689d253dd2c8e93">&#9670;&#160;</a></span>LowestCommonAncestor()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">graph::LowestCommonAncestor::LowestCommonAncestor </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> &amp;</td> <td class="paramname"><span class="paramname"><em>tree_</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel explicit">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Stores the tree and precomputs "up lifts". </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">tree_</td><td>rooted tree. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00151">151</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 151</span> : tree(tree_) {</div>
<div class="line"><span class="lineno"> 152</span> <a class="code hl_function" href="#a42589cc39d6bbff6c997152f1b96e356">populate_up</a>();</div>
<div class="line"><span class="lineno"> 153</span> }</div>
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a42589cc39d6bbff6c997152f1b96e356"><div class="ttname"><a href="#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor::populate_up</a></div><div class="ttdeci">void populate_up()</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00212">lowest_common_ancestor.cpp:212</a></div></div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a60151e19512b48cc0b14ea121df00488" name="a60151e19512b48cc0b14ea121df00488"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a60151e19512b48cc0b14ea121df00488">&#9670;&#160;</a></span>lowest_common_ancestor()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int graph::LowestCommonAncestor::lowest_common_ancestor </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>&#160;) const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid indices of vertices. Iterativelly modifies ("lifts") u an v until it finnds their lowest common ancestor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">u</td><td>index of one of the queried vertex </td></tr>
<tr><td class="paramname">v</td><td>index of the other queried vertex </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>index of the vertex which is the lowet common ancestor of u and v </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00164">164</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 164</span> {</div>
<div class="line"><span class="lineno"> 165</span> <span class="comment">// Ensure u is the deeper (higher level) of the two vertices</span></div>
<div class="line"><span class="lineno"> 166</span> <span class="keywordflow">if</span> (tree.level[v] &gt; tree.level[u]) {</div>
<div class="line"><span class="lineno"> 167</span> std::swap(u, v);</div>
<div class="line"><span class="lineno"> 168</span> }</div>
<div class="line"><span class="lineno"> 169</span> </div>
<div class="line"><span class="lineno"> 170</span> <span class="comment">// &quot;Lift&quot; u to the same level as v.</span></div>
<div class="line"><span class="lineno"> 171</span> <span class="keywordtype">int</span> level_diff = tree.level[u] - tree.level[v];</div>
<div class="line"><span class="lineno"> 172</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; (1 &lt;&lt; i) &lt;= level_diff; ++i) {</div>
<div class="line"><span class="lineno"> 173</span> <span class="keywordflow">if</span> (level_diff &amp; (1 &lt;&lt; i)) {</div>
<div class="line"><span class="lineno"> 174</span> u = <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][i];</div>
<div class="line"><span class="lineno"> 175</span> }</div>
<div class="line"><span class="lineno"> 176</span> }</div>
<div class="line"><span class="lineno"> 177</span> assert(tree.level[u] == tree.level[v]);</div>
<div class="line"><span class="lineno"> 178</span> </div>
<div class="line"><span class="lineno"> 179</span> <span class="keywordflow">if</span> (u == v) {</div>
<div class="line"><span class="lineno"> 180</span> <span class="keywordflow">return</span> u;</div>
<div class="line"><span class="lineno"> 181</span> }</div>
<div class="line"><span class="lineno"> 182</span> </div>
<div class="line"><span class="lineno"> 183</span> <span class="comment">// &quot;Lift&quot; u and v to their 2^i th ancestor if they are different</span></div>
<div class="line"><span class="lineno"> 184</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u].size()) - 1; i &gt;= 0; --i) {</div>
<div class="line"><span class="lineno"> 185</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][i] != <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[v][i]) {</div>
<div class="line"><span class="lineno"> 186</span> u = <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][i];</div>
<div class="line"><span class="lineno"> 187</span> v = <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[v][i];</div>
<div class="line"><span class="lineno"> 188</span> }</div>
<div class="line"><span class="lineno"> 189</span> }</div>
<div class="line"><span class="lineno"> 190</span> </div>
<div class="line"><span class="lineno"> 191</span> <span class="comment">// As we regressed u an v such that they cannot further be lifted so</span></div>
<div class="line"><span class="lineno"> 192</span> <span class="comment">// that their ancestor would be different, the only logical</span></div>
<div class="line"><span class="lineno"> 193</span> <span class="comment">// consequence is that their parent is the sought answer.</span></div>
<div class="line"><span class="lineno"> 194</span> assert(<a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][0] == <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[v][0]);</div>
<div class="line"><span class="lineno"> 195</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][0];</div>
<div class="line"><span class="lineno"> 196</span> }</div>
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a46d10f669791e3da9a4809bd8ff8d3ad"><div class="ttname"><a href="#a46d10f669791e3da9a4809bd8ff8d3ad">graph::LowestCommonAncestor::up</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; up</div><div class="ttdoc">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00206">lowest_common_ancestor.cpp:206</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a42589cc39d6bbff6c997152f1b96e356" name="a42589cc39d6bbff6c997152f1b96e356"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a42589cc39d6bbff6c997152f1b96e356">&#9670;&#160;</a></span>populate_up()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void graph::LowestCommonAncestor::populate_up </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel protected">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Populate the "up" structure. See above. </p>
<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00212">212</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 212</span> {</div>
<div class="line"><span class="lineno"> 213</span> <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>.resize(tree.number_of_vertices());</div>
<div class="line"><span class="lineno"> 214</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vertex = 0; vertex &lt; tree.number_of_vertices(); ++vertex) {</div>
<div class="line"><span class="lineno"> 215</span> <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex].push_back(tree.parent[vertex]);</div>
<div class="line"><span class="lineno"> 216</span> }</div>
<div class="line"><span class="lineno"> 217</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = 0; (1 &lt;&lt; level) &lt; tree.number_of_vertices(); ++level) {</div>
<div class="line"><span class="lineno"> 218</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vertex = 0; vertex &lt; tree.number_of_vertices(); ++vertex) {</div>
<div class="line"><span class="lineno"> 219</span> <span class="comment">// up[vertex][level + 1] = 2^(level + 1) th ancestor of vertex =</span></div>
<div class="line"><span class="lineno"> 220</span> <span class="comment">// = 2^level th ancestor of 2^level th ancestor of vertex =</span></div>
<div class="line"><span class="lineno"> 221</span> <span class="comment">// = 2^level th ancestor of up[vertex][level]</span></div>
<div class="line"><span class="lineno"> 222</span> <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex].push_back(<a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[<a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex][level]][level]);</div>
<div class="line"><span class="lineno"> 223</span> }</div>
<div class="line"><span class="lineno"> 224</span> }</div>
<div class="line"><span class="lineno"> 225</span> }</div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="ad6ae1f39c3ce27fc009970e6aa3c022a" name="ad6ae1f39c3ce27fc009970e6aa3c022a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad6ae1f39c3ce27fc009970e6aa3c022a">&#9670;&#160;</a></span>tree</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">const <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a>&amp; graph::LowestCommonAncestor::tree</td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00199">199</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
</div>
</div>
<a id="a46d10f669791e3da9a4809bd8ff8d3ad" name="a46d10f669791e3da9a4809bd8ff8d3ad"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a46d10f669791e3da9a4809bd8ff8d3ad">&#9670;&#160;</a></span>up</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; graph::LowestCommonAncestor::up</td>
</tr>
</table>
</div><div class="memdoc">
<p>for every vertex stores a list of its ancestors by powers of two For each vertex, the first element of the corresponding list contains the index of its parent. The i-th element of the list is an index of the (2^i)-th ancestor of the vertex. </p>
<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00206">206</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>graph/<a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></li><li class="navelem"><a class="el" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</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.13.2 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink