<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>The MRPT project: mrpt::math::CDirectedTree< TYPE_EDGES > Class Template Reference</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<div align="left"><a href="http://www.mrpt.org/">Main MRPT website</a> > <b>C++ reference</b> </div>
<div align="right">
<a href="index.html"><img border="0" src="mrpt_logo.png" alt="MRPT logo"></a>
</div>
<!-- Generated by Doxygen 1.7.2 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'Search');
--></script>
<div class="navigation" id="top">
<div class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li id="searchli">
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<form id="FSearchBox" action="search.php" method="get">
<img id="MSearchSelect" src="search/mag.png" alt=""/>
<input type="text" id="MSearchField" name="query" value="Search" size="20" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"/>
</form>
</span><span class="right"></span>
</div>
</li>
</ul>
</div>
<div class="tabs2">
<ul class="tablist">
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="classes.html"><span>Class Index</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
<div class="navpath">
<ul>
<li><a class="el" href="namespacemrpt.html">mrpt</a> </li>
<li><a class="el" href="namespacemrpt_1_1math.html">math</a> </li>
<li><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html">CDirectedTree</a> </li>
</ul>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> |
<a href="#pub-types">Public Types</a> </div>
<div class="headertitle">
<h1>mrpt::math::CDirectedTree< TYPE_EDGES > Class Template Reference</h1> </div>
</div>
<div class="contents">
<!-- doxytag: class="mrpt::math::CDirectedTree" --><hr/><a name="_details"></a><h2>Detailed Description</h2>
<h3>template<class TYPE_EDGES = uint8_t><br/>
class mrpt::math::CDirectedTree< TYPE_EDGES ></h3>
<p>A special kind of graph in the form of a tree with directed edges and optional edge annotations of templatized type "TYPE_EDGES". </p>
<p>The tree is represented by means of:</p>
<ul>
<li><em>root:</em> The ID of the root node.</li>
<li><em>edges_to_children:</em> A map from node ID to all the edges to its children.</li>
</ul>
<p>This class is less general than <a class="el" href="classmrpt_1_1math_1_1_c_directed_graph.html" title="A directed graph with the argument of the template specifying the type of the annotations in the edge...">CDirectedGraph</a> but more efficient to traverse (see <em>visitDepthFirst</em> and <em>visitBreadthFirst</em>).</p>
<p>If annotations in edges are not required, you can leave TYPE_EDGES to its default type "uint8_t". </p>
<dl class="see"><dt><b>See also:</b></dt><dd><a class="el" href="classmrpt_1_1math_1_1_c_directed_graph.html" title="A directed graph with the argument of the template specifying the type of the annotations in the edge...">CDirectedGraph</a>, <a class="el" href="classmrpt_1_1math_1_1_c_dijkstra.html" title="The Dijkstra algorithm for finding the shortest path between a given source node in a (weighted) dire...">CDijkstra</a>, <a class="el" href="classmrpt_1_1poses_1_1_c_network_of_poses.html" title="A directed graph of pose constraints, with edges being the relative pose between pairs of nodes inden...">mrpt::poses::CNetworkOfPoses</a>, </dd></dl>
<p>Definition at line <a class="el" href="graphs_8h_source.html#l00220">220</a> of file <a class="el" href="graphs_8h_source.html">graphs.h</a>.</p>
<p><code>#include <<a class="el" href="graphs_8h_source.html">mrpt/math/graphs.h</a>></code></p>
<p><a href="classmrpt_1_1math_1_1_c_directed_tree-members.html">List of all members.</a></p>
<table class="memberdecls">
<tr><td colspan="2"><h2><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structmrpt_1_1math_1_1_c_directed_tree_1_1_t_edge_info.html">TEdgeInfo</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structmrpt_1_1math_1_1_c_directed_tree_1_1_visitor.html">Visitor</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Virtual base class for user-defined visitors. <a href="structmrpt_1_1math_1_1_c_directed_tree_1_1_visitor.html#_details">More...</a><br/></td></tr>
<tr><td colspan="2"><h2><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef std::list< <a class="el" href="structmrpt_1_1math_1_1_c_directed_tree_1_1_t_edge_info.html">TEdgeInfo</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#ab486749dd64c9fce763f33703d19f8fc">TListEdges</a></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef std::map< <a class="el" href="namespacemrpt_1_1utils.html#a718b4f99645b7e9f6501c9b7bb2a2fe7">TNodeID</a>, <br class="typebreak"/>
<a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#ab486749dd64c9fce763f33703d19f8fc">TListEdges</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a8152e4f2881a8d1add118680d942a8ff">TMapNode2ListEdges</a></td></tr>
<tr><td colspan="2"><h2><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr><td colspan="2"><div class="groupHeader">Utilities</div></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#afcefeb1137419321a59ffdd8b2ea6c68">clear</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Empty all edge data and set "root" to INVALID_NODEID. <a href="#afcefeb1137419321a59ffdd8b2ea6c68"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a0ccdcbc479aa7058866024317d189dad">visitDepthFirst</a> (const <a class="el" href="namespacemrpt_1_1utils.html#a718b4f99645b7e9f6501c9b7bb2a2fe7">TNodeID</a> <a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a7d13aee78abd49b5b081019992f69b7d">root</a>, <a class="el" href="structmrpt_1_1math_1_1_c_directed_tree_1_1_visitor.html">Visitor</a> &user_visitor, const size_t root_depth_level=0) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Depth-first visit of all children nodes of a given root (itself excluded from the visit), invoking a user-provided function for each node/edge. <a href="#a0ccdcbc479aa7058866024317d189dad"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#ac7692a018cb79aa404d05ae043ff1f25">visitBreadthFirst</a> (const <a class="el" href="namespacemrpt_1_1utils.html#a718b4f99645b7e9f6501c9b7bb2a2fe7">TNodeID</a> <a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a7d13aee78abd49b5b081019992f69b7d">root</a>, <a class="el" href="structmrpt_1_1math_1_1_c_directed_tree_1_1_visitor.html">Visitor</a> &user_visitor, const size_t root_depth_level=0) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Breadth-first visit of all children nodes of a given root (itself excluded from the visit), invoking a user-provided function for each node/edge. <a href="#ac7692a018cb79aa404d05ae043ff1f25"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">std::string </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#ad966ce934bfa674ef6be0c69f4c3dd97">getAsTextDescription</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return a text representation of the tree spanned in a depth-first view, as in this example: <a href="#ad966ce934bfa674ef6be0c69f4c3dd97"></a><br/></td></tr>
<tr><td colspan="2"><h2><a name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr><td colspan="2"><div class="groupHeader">Data</div></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="namespacemrpt_1_1utils.html#a718b4f99645b7e9f6501c9b7bb2a2fe7">TNodeID</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a7d13aee78abd49b5b081019992f69b7d">root</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The root of the tree. <a href="#a7d13aee78abd49b5b081019992f69b7d"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a8152e4f2881a8d1add118680d942a8ff">TMapNode2ListEdges</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a450308f4c992097e94b16faac245f6ce">edges_to_children</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The edges of each node. <a href="#a450308f4c992097e94b16faac245f6ce"></a><br/></td></tr>
</table>
<hr/><h2>Member Typedef Documentation</h2>
<a class="anchor" id="ab486749dd64c9fce763f33703d19f8fc"></a><!-- doxytag: member="mrpt::math::CDirectedTree::TListEdges" ref="ab486749dd64c9fce763f33703d19f8fc" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class TYPE_EDGES = uint8_t> </div>
<table class="memname">
<tr>
<td class="memname">typedef std::list<<a class="el" href="structmrpt_1_1math_1_1_c_directed_tree_1_1_t_edge_info.html">TEdgeInfo</a>> <a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html">mrpt::math::CDirectedTree</a>< TYPE_EDGES >::<a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#ab486749dd64c9fce763f33703d19f8fc">TListEdges</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Definition at line <a class="el" href="graphs_8h_source.html#l00229">229</a> of file <a class="el" href="graphs_8h_source.html">graphs.h</a>.</p>
</div>
</div>
<a class="anchor" id="a8152e4f2881a8d1add118680d942a8ff"></a><!-- doxytag: member="mrpt::math::CDirectedTree::TMapNode2ListEdges" ref="a8152e4f2881a8d1add118680d942a8ff" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class TYPE_EDGES = uint8_t> </div>
<table class="memname">
<tr>
<td class="memname">typedef std::map<<a class="el" href="namespacemrpt_1_1utils.html#a718b4f99645b7e9f6501c9b7bb2a2fe7">TNodeID</a>,<a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#ab486749dd64c9fce763f33703d19f8fc">TListEdges</a>> <a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html">mrpt::math::CDirectedTree</a>< TYPE_EDGES >::<a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a8152e4f2881a8d1add118680d942a8ff">TMapNode2ListEdges</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Definition at line <a class="el" href="graphs_8h_source.html#l00230">230</a> of file <a class="el" href="graphs_8h_source.html">graphs.h</a>.</p>
</div>
</div>
<hr/><h2>Member Function Documentation</h2>
<a class="anchor" id="afcefeb1137419321a59ffdd8b2ea6c68"></a><!-- doxytag: member="mrpt::math::CDirectedTree::clear" ref="afcefeb1137419321a59ffdd8b2ea6c68" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class TYPE_EDGES = uint8_t> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html">mrpt::math::CDirectedTree</a>< TYPE_EDGES >::clear </td>
<td>(</td>
<td class="paramname"> )</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Empty all edge data and set "root" to INVALID_NODEID. </p>
<p>Definition at line <a class="el" href="graphs_8h_source.html#l00242">242</a> of file <a class="el" href="graphs_8h_source.html">graphs.h</a>.</p>
<p>References <a class="el" href="graphs_8h_source.html#l00235">mrpt::math::CDirectedTree< TYPE_EDGES >::edges_to_children</a>, <a class="el" href="base_2include_2mrpt_2utils_2types_8h_source.html#l00322">INVALID_NODEID</a>, and <a class="el" href="graphs_8h_source.html#l00234">mrpt::math::CDirectedTree< TYPE_EDGES >::root</a>.</p>
<p>Referenced by <a class="el" href="dijkstra_8h_source.html#l00303">mrpt::math::CDijkstra< TYPE_EDGES, MAPS_IMPLEMENTATION >::getTreeGraph()</a>.</p>
</div>
</div>
<a class="anchor" id="ad966ce934bfa674ef6be0c69f4c3dd97"></a><!-- doxytag: member="mrpt::math::CDirectedTree::getAsTextDescription" ref="ad966ce934bfa674ef6be0c69f4c3dd97" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class TYPE_EDGES = uint8_t> </div>
<table class="memname">
<tr>
<td class="memname">std::string <a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html">mrpt::math::CDirectedTree</a>< TYPE_EDGES >::getAsTextDescription </td>
<td>(</td>
<td class="paramname"> )</td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Return a text representation of the tree spanned in a depth-first view, as in this example: </p>
<div class="fragment"><pre class="fragment"> 0
-> 1
-> 2
-> 4
-> 5
-> 3
</pre></div>
<p>Definition at line <a class="el" href="graphs_8h_source.html#l00295">295</a> of file <a class="el" href="graphs_8h_source.html">graphs.h</a>.</p>
<p>References <a class="el" href="graphs_8h_source.html#l00225">mrpt::math::CDirectedTree< TYPE_EDGES >::TEdgeInfo::id</a>, <a class="el" href="graphs_8h_source.html#l00226">mrpt::math::CDirectedTree< TYPE_EDGES >::TEdgeInfo::reverse</a>, <a class="el" href="graphs_8h_source.html#l00234">mrpt::math::CDirectedTree< TYPE_EDGES >::root</a>, and <a class="el" href="graphs_8h_source.html#l00259">mrpt::math::CDirectedTree< TYPE_EDGES >::visitDepthFirst()</a>.</p>
</div>
</div>
<a class="anchor" id="ac7692a018cb79aa404d05ae043ff1f25"></a><!-- doxytag: member="mrpt::math::CDirectedTree::visitBreadthFirst" ref="ac7692a018cb79aa404d05ae043ff1f25" args="(const TNodeID root, Visitor &user_visitor, const size_t root_depth_level=0) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class TYPE_EDGES = uint8_t> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html">mrpt::math::CDirectedTree</a>< TYPE_EDGES >::visitBreadthFirst </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="namespacemrpt_1_1utils.html#a718b4f99645b7e9f6501c9b7bb2a2fe7">TNodeID</a> </td>
<td class="paramname"> <em>root</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structmrpt_1_1math_1_1_c_directed_tree_1_1_visitor.html">Visitor</a> & </td>
<td class="paramname"> <em>user_visitor</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const size_t </td>
<td class="paramname"> <em>root_depth_level</em> = <code>0</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Breadth-first visit of all children nodes of a given root (itself excluded from the visit), invoking a user-provided function for each node/edge. </p>
<dl class="see"><dt><b>See also:</b></dt><dd><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a0ccdcbc479aa7058866024317d189dad" title="Depth-first visit of all children nodes of a given root (itself excluded from the visit)...">visitDepthFirst</a> </dd></dl>
<p>Definition at line <a class="el" href="graphs_8h_source.html#l00273">273</a> of file <a class="el" href="graphs_8h_source.html">graphs.h</a>.</p>
<p>References <a class="el" href="graphs_8h_source.html#l00235">mrpt::math::CDirectedTree< TYPE_EDGES >::edges_to_children</a>, <a class="el" href="structmrpt_1_1math_1_1_c_directed_tree_1_1_visitor.html#ade8e18cbde582907f5930f88885a0b7c">mrpt::math::CDirectedTree< TYPE_EDGES >::Visitor::OnVisitNode()</a>, and <a class="el" href="graphs_8h_source.html#l00259">mrpt::math::CDirectedTree< TYPE_EDGES >::visitDepthFirst()</a>.</p>
</div>
</div>
<a class="anchor" id="a0ccdcbc479aa7058866024317d189dad"></a><!-- doxytag: member="mrpt::math::CDirectedTree::visitDepthFirst" ref="a0ccdcbc479aa7058866024317d189dad" args="(const TNodeID root, Visitor &user_visitor, const size_t root_depth_level=0) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class TYPE_EDGES = uint8_t> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html">mrpt::math::CDirectedTree</a>< TYPE_EDGES >::visitDepthFirst </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="namespacemrpt_1_1utils.html#a718b4f99645b7e9f6501c9b7bb2a2fe7">TNodeID</a> </td>
<td class="paramname"> <em>root</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structmrpt_1_1math_1_1_c_directed_tree_1_1_visitor.html">Visitor</a> & </td>
<td class="paramname"> <em>user_visitor</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const size_t </td>
<td class="paramname"> <em>root_depth_level</em> = <code>0</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Depth-first visit of all children nodes of a given root (itself excluded from the visit), invoking a user-provided function for each node/edge. </p>
<dl class="see"><dt><b>See also:</b></dt><dd><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#ac7692a018cb79aa404d05ae043ff1f25" title="Breadth-first visit of all children nodes of a given root (itself excluded from the visit)...">visitBreadthFirst</a> </dd></dl>
<p>Definition at line <a class="el" href="graphs_8h_source.html#l00259">259</a> of file <a class="el" href="graphs_8h_source.html">graphs.h</a>.</p>
<p>References <a class="el" href="graphs_8h_source.html#l00235">mrpt::math::CDirectedTree< TYPE_EDGES >::edges_to_children</a>, and <a class="el" href="structmrpt_1_1math_1_1_c_directed_tree_1_1_visitor.html#ade8e18cbde582907f5930f88885a0b7c">mrpt::math::CDirectedTree< TYPE_EDGES >::Visitor::OnVisitNode()</a>.</p>
<p>Referenced by <a class="el" href="graphs_8h_source.html#l00295">mrpt::math::CDirectedTree< TYPE_EDGES >::getAsTextDescription()</a>, and <a class="el" href="graphs_8h_source.html#l00273">mrpt::math::CDirectedTree< TYPE_EDGES >::visitBreadthFirst()</a>.</p>
</div>
</div>
<hr/><h2>Member Data Documentation</h2>
<a class="anchor" id="a450308f4c992097e94b16faac245f6ce"></a><!-- doxytag: member="mrpt::math::CDirectedTree::edges_to_children" ref="a450308f4c992097e94b16faac245f6ce" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class TYPE_EDGES = uint8_t> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a8152e4f2881a8d1add118680d942a8ff">TMapNode2ListEdges</a> <a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html">mrpt::math::CDirectedTree</a>< TYPE_EDGES >::<a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a450308f4c992097e94b16faac245f6ce">edges_to_children</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>The edges of each node. </p>
<p>Definition at line <a class="el" href="graphs_8h_source.html#l00235">235</a> of file <a class="el" href="graphs_8h_source.html">graphs.h</a>.</p>
<p>Referenced by <a class="el" href="graphs_8h_source.html#l00242">mrpt::math::CDirectedTree< TYPE_EDGES >::clear()</a>, <a class="el" href="dijkstra_8h_source.html#l00303">mrpt::math::CDijkstra< TYPE_EDGES, MAPS_IMPLEMENTATION >::getTreeGraph()</a>, <a class="el" href="graphs_8h_source.html#l00273">mrpt::math::CDirectedTree< TYPE_EDGES >::visitBreadthFirst()</a>, and <a class="el" href="graphs_8h_source.html#l00259">mrpt::math::CDirectedTree< TYPE_EDGES >::visitDepthFirst()</a>.</p>
</div>
</div>
<a class="anchor" id="a7d13aee78abd49b5b081019992f69b7d"></a><!-- doxytag: member="mrpt::math::CDirectedTree::root" ref="a7d13aee78abd49b5b081019992f69b7d" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<class TYPE_EDGES = uint8_t> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="namespacemrpt_1_1utils.html#a718b4f99645b7e9f6501c9b7bb2a2fe7">TNodeID</a> <a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html">mrpt::math::CDirectedTree</a>< TYPE_EDGES >::<a class="el" href="classmrpt_1_1math_1_1_c_directed_tree.html#a7d13aee78abd49b5b081019992f69b7d">root</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>The root of the tree. </p>
<p>Definition at line <a class="el" href="graphs_8h_source.html#l00234">234</a> of file <a class="el" href="graphs_8h_source.html">graphs.h</a>.</p>
<p>Referenced by <a class="el" href="graphs_8h_source.html#l00242">mrpt::math::CDirectedTree< TYPE_EDGES >::clear()</a>, <a class="el" href="graphs_8h_source.html#l00295">mrpt::math::CDirectedTree< TYPE_EDGES >::getAsTextDescription()</a>, and <a class="el" href="dijkstra_8h_source.html#l00303">mrpt::math::CDijkstra< TYPE_EDGES, MAPS_IMPLEMENTATION >::getTreeGraph()</a>.</p>
</div>
</div>
</div>
<br><hr><br> <table border="0" width="100%"> <tr> <td> Page generated by <a href="http://www.doxygen.org" target="_blank">Doxygen 1.7.2</a> for MRPT 0.9.4 SVN: at Mon Jan 10 22:30:30 UTC 2011</td><td></td> <td width="100"> </td> <td width="150"> </td></tr> </table> </body></html>
