<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<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.8.5"/>
<title>Eigen: SparseColEtree.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="eigendoxy.css" rel="stylesheet" type="text/css">
<!-- -->
<script type="text/javascript" src="eigen_navtree_hacks.js"></script>
<!-- <script type="text/javascript"> -->
<!-- </script> -->
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<!-- <a name="top"></a> -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="Eigen_Silly_Professor_64x64.png"/></td>
<td style="padding-left: 0.5em;">
<div id="projectname"><a href="http://eigen.tuxfamily.org">Eigen</a>
 <span id="projectnumber">3.2.0</span>
</div>
</td>
<td> <div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
</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">
$(document).ready(function(){initNavTree('SparseColEtree_8h_source.html','');});
</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)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark"> </span>Groups</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark"> </span>Pages</a></div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">SparseColEtree.h</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// This file is part of Eigen, a lightweight C++ template library</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// for linear algebra.</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">//</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@inria.fr></span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// This Source Code Form is subject to the terms of the Mozilla</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// Public License v. 2.0. If a copy of the MPL was not distributed</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">/* </span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> </span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * NOTE: This file is the modified version of sp_coletree.c file in SuperLU </span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> </span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * -- SuperLU routine (version 3.1) --</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * Univ. of California Berkeley, Xerox Palo Alto Research Center,</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * and Lawrence Berkeley National Lab.</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * August 1, 2008</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * Copyright (c) 1994 by Xerox Corporation. All rights reserved.</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK.</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * Permission is hereby granted to use or copy this program for any</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * purpose, provided the above notices are retained on all copies.</span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Permission to modify the code and to distribute modified code is</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * granted, provided the above notices are retained, and a notice that</span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * the code was modified is included with the above copyright notice.</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#ifndef SPARSE_COLETREE_H</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor"></span><span class="preprocessor">#define SPARSE_COLETREE_H</span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">namespace </span>Eigen {</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">namespace </span>internal {</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">template</span><<span class="keyword">typename</span> Index, <span class="keyword">typename</span> IndexVector></div>
<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="namespaceEigen_1_1internal.html#af1daa938f6414254cc9a754f1ef2490b"> 40</a></span> Index <a class="code" href="namespaceEigen_1_1internal.html#af1daa938f6414254cc9a754f1ef2490b">etree_find</a> (Index i, IndexVector& pp)</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> {</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  Index p = pp(i); <span class="comment">// Parent </span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  Index gp = pp(p); <span class="comment">// Grand parent </span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">while</span> (gp != p) </div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  {</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  pp(i) = gp; <span class="comment">// Parent pointer on find path is changed to former grand parent</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  i = gp; </div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  p = pp(i);</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  gp = pp(p);</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  }</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">return</span> p; </div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> }</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="keyword">template</span> <<span class="keyword">typename</span> MatrixType, <span class="keyword">typename</span> IndexVector></div>
<div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="namespaceEigen_1_1internal.html#a22b184331e5fb270a37d1305e95cb064"> 61</a></span> <span class="keywordtype">int</span> <a class="code" href="namespaceEigen_1_1internal.html#a22b184331e5fb270a37d1305e95cb064">coletree</a>(<span class="keyword">const</span> MatrixType& mat, IndexVector& parent, IndexVector& firstRowElt, <span class="keyword">typename</span> MatrixType::Index *perm=0)</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> MatrixType::Index Index;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  Index nc = mat.cols(); <span class="comment">// Number of columns </span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  Index m = mat.rows();</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  IndexVector root(nc); <span class="comment">// root of subtree of etree </span></div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  root.setZero();</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  IndexVector pp(nc); <span class="comment">// disjoint sets </span></div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  pp.setZero(); <span class="comment">// Initialize disjoint sets </span></div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  parent.resize(mat.cols());</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">//Compute first nonzero column in each row </span></div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  Index row,col; </div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  firstRowElt.resize(m);</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  firstRowElt.setConstant(nc);</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  firstRowElt.segment(0, nc).setLinSpaced(nc, 0, nc-1);</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordtype">bool</span> found_diag;</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">for</span> (col = 0; col < nc; col++)</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  {</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  Index pcol = col;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span>(perm) pcol = perm[col];</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> MatrixType::InnerIterator it(mat, pcol); it; ++it)</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  { </div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  row = it.row();</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  firstRowElt(row) = (std::min)(firstRowElt(row), col);</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  }</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">/* Compute etree by Liu's algorithm for symmetric matrices,</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> except use (firstRowElt[r],c) in place of an edge (r,c) of A.</span></div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> Thus each row clique in A'*A is replaced by a star</span></div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> centered at its first vertex, which has the same fill. */</span></div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  Index rset, cset, rroot; </div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">for</span> (col = 0; col < nc; col++) </div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  {</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  found_diag = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  pp(col) = col; </div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  cset = col; </div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  root(cset) = col; </div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  parent(col) = nc; </div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">/* The diagonal element is treated here even if it does not exist in the matrix</span></div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> * hence the loop is executed once more */</span> </div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  Index pcol = col;</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">if</span>(perm) pcol = perm[col];</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> MatrixType::InnerIterator it(mat, pcol); it||!found_diag; ++it)</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  { <span class="comment">// A sequence of interleaved find and union is performed </span></div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  Index i = col;</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span>(it) i = it.index();</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">if</span> (i == col) found_diag = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  row = firstRowElt(i);</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (row >= col) <span class="keywordflow">continue</span>; </div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  rset = <a class="code" href="namespaceEigen_1_1internal.html#af1daa938f6414254cc9a754f1ef2490b">internal::etree_find</a>(row, pp); <span class="comment">// Find the name of the set containing row</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  rroot = root(rset);</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">if</span> (rroot != col) </div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  {</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  parent(rroot) = col; </div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  pp(cset) = rset; </div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  cset = rset; </div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  root(cset) = col; </div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  }</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> 0; </div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> }</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Index, <span class="keyword">typename</span> IndexVector></div>
<div class="line"><a name="l00129"></a><span class="lineno"><a class="line" href="namespaceEigen_1_1internal.html#a7150eab4e0ac838770d1a2c43e41d92c"> 129</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceEigen_1_1internal.html#a7150eab4e0ac838770d1a2c43e41d92c">nr_etdfs</a> (Index n, IndexVector& parent, IndexVector& first_kid, IndexVector& next_kid, IndexVector& post, Index postnum)</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> {</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  Index current = n, first, next;</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">while</span> (postnum != n) </div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  {</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// No kid for the current node</span></div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  first = first_kid(current);</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  </div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// no kid for the current node</span></div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">if</span> (first == -1) </div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  {</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// Numbering this node because it has no kid </span></div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  post(current) = postnum++;</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  </div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// looking for the next kid </span></div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  next = next_kid(current); </div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">while</span> (next == -1) </div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  {</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// No more kids : back to the parent node</span></div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  current = parent(current); </div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// numbering the parent node </span></div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  post(current) = postnum++;</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  </div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// Get the next kid </span></div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  next = next_kid(current); </div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// stopping criterion </span></div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (postnum == n+1) <span class="keywordflow">return</span>; </div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  </div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// Updating current node </span></div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  current = next; </div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">else</span> </div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  {</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  current = first; </div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  }</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> }</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Index, <span class="keyword">typename</span> IndexVector></div>
<div class="line"><a name="l00176"></a><span class="lineno"><a class="line" href="namespaceEigen_1_1internal.html#a6afa7df34de3dce07b21194168118456"> 176</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceEigen_1_1internal.html#a6afa7df34de3dce07b21194168118456">treePostorder</a>(Index n, IndexVector& parent, IndexVector& post)</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> {</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  IndexVector first_kid, next_kid; <span class="comment">// Linked list of children </span></div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  Index postnum; </div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// Allocate storage for working arrays and results </span></div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  first_kid.resize(n+1); </div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  next_kid.setZero(n+1);</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  post.setZero(n+1);</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  </div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// Set up structure describing children</span></div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  Index v, dad; </div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  first_kid.setConstant(-1); </div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">for</span> (v = n-1; v >= 0; v--) </div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  {</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  dad = parent(v);</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  next_kid(v) = first_kid(dad); </div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  first_kid(dad) = v; </div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// Depth-first search from dummy root vertex #n</span></div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  postnum = 0; </div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="code" href="namespaceEigen_1_1internal.html#a7150eab4e0ac838770d1a2c43e41d92c">internal::nr_etdfs</a>(n, parent, first_kid, next_kid, post, postnum);</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> }</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> } <span class="comment">// end namespace internal</span></div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> } <span class="comment">// end namespace Eigen</span></div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> </div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="preprocessor">#endif // SPARSE_COLETREE_H</span></div>
<div class="ttc" id="namespaceEigen_1_1internal_html_af1daa938f6414254cc9a754f1ef2490b"><div class="ttname"><a href="namespaceEigen_1_1internal.html#af1daa938f6414254cc9a754f1ef2490b">Eigen::internal::etree_find</a></div><div class="ttdeci">Index etree_find(Index i, IndexVector &pp)</div><div class="ttdef"><b>Definition:</b> SparseColEtree.h:40</div></div>
<div class="ttc" id="namespaceEigen_1_1internal_html_a7150eab4e0ac838770d1a2c43e41d92c"><div class="ttname"><a href="namespaceEigen_1_1internal.html#a7150eab4e0ac838770d1a2c43e41d92c">Eigen::internal::nr_etdfs</a></div><div class="ttdeci">void nr_etdfs(Index n, IndexVector &parent, IndexVector &first_kid, IndexVector &next_kid, IndexVector &post, Index postnum)</div><div class="ttdef"><b>Definition:</b> SparseColEtree.h:129</div></div>
<div class="ttc" id="namespaceEigen_1_1internal_html_a22b184331e5fb270a37d1305e95cb064"><div class="ttname"><a href="namespaceEigen_1_1internal.html#a22b184331e5fb270a37d1305e95cb064">Eigen::internal::coletree</a></div><div class="ttdeci">int coletree(const MatrixType &mat, IndexVector &parent, IndexVector &firstRowElt, typename MatrixType::Index *perm=0)</div><div class="ttdef"><b>Definition:</b> SparseColEtree.h:61</div></div>
<div class="ttc" id="namespaceEigen_1_1internal_html_a6afa7df34de3dce07b21194168118456"><div class="ttname"><a href="namespaceEigen_1_1internal.html#a6afa7df34de3dce07b21194168118456">Eigen::internal::treePostorder</a></div><div class="ttdeci">void treePostorder(Index n, IndexVector &parent, IndexVector &post)</div><div class="ttdoc">Post order a tree. </div><div class="ttdef"><b>Definition:</b> SparseColEtree.h:176</div></div>
</div><!-- fragment --></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="dir_e49d68e3078f12dfcf157021597ad168.html">Eigen</a></li><li class="navelem"><a class="el" href="dir_64b228556dc7f9fe757d43bb57fbfc24.html">src</a></li><li class="navelem"><a class="el" href="dir_b9d06f6d5303777cc8c118a3df19eb22.html">SparseCore</a></li><li class="navelem"><b>SparseColEtree.h</b></li>
<li class="footer">Generated on Mon Oct 28 2013 11:04:25 for Eigen by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.5 </li>
</ul>
</div>
<!-- Piwik -->
<!--
<script type="text/javascript">
var pkBaseURL = (("https:" == document.location.protocol) ? "https://stats.sylphide-consulting.com/piwik/" : "http://stats.sylphide-consulting.com/piwik/");
document.write(unescape("%3Cscript src='" + pkBaseURL + "piwik.js' type='text/javascript'%3E%3C/script%3E"));
</script><script type="text/javascript">
try {
var piwikTracker = Piwik.getTracker(pkBaseURL + "piwik.php", 20);
piwikTracker.trackPageView();
piwikTracker.enableLinkTracking();
} catch( err ) {}
</script><noscript><p><img src="http://stats.sylphide-consulting.com/piwik/piwik.php?idsite=20" style="border:0" alt="" /></p></noscript>
-->
<!-- End Piwik Tracking Code -->
</body>
</html>
