mrpt::math::CDirectedTree< TYPE_EDGES >::Visitor Struct Reference

---

Detailed Description

template<class TYPE_EDGES = uint8_t>
struct mrpt::math::CDirectedTree< TYPE_EDGES >::Visitor

Virtual base class for user-defined visitors.

Definition at line 245 of file graphs.h.

#include <mrpt/math/graphs.h>

List of all members.

Public Types
typedef CDirectedTree< TYPE_EDGES >	tree_t
Public Member Functions
virtual void	OnVisitNode (const TNodeID parent, const typename tree_t::TEdgeInfo &edge_to_child, const size_t depth_level)=0
	Virtual method to be implemented by the user and which will be called during the visit to a graph with visitDepthFirst or visitBreadthFirst Specifically, the method will be called once for each edge in the tree.

---

Member Typedef Documentation

template<class TYPE_EDGES = uint8_t>

typedef CDirectedTree<TYPE_EDGES> mrpt::math::CDirectedTree< TYPE_EDGES >::Visitor::tree_t

Definition at line 247 of file graphs.h.

---

Member Function Documentation

template<class TYPE_EDGES = uint8_t>

virtual void mrpt::math::CDirectedTree< TYPE_EDGES >::Visitor::OnVisitNode	(	const TNodeID	parent,
		const typename tree_t::TEdgeInfo &	edge_to_child,
		const size_t	depth_level
	)		[pure virtual]

Virtual method to be implemented by the user and which will be called during the visit to a graph with visitDepthFirst or visitBreadthFirst Specifically, the method will be called once for each edge in the tree.

Parameters:

parent	[IN] The ID of the parent node.
edge_to_child	[IN] The edge information from the parent to "edge_to_child.id"
depth_level	[IN] The "depth level" of the child node "edge_to_child.id" (root node is at 0, its children are at 1, etc.).

Referenced by mrpt::math::CDirectedTree< TYPE_EDGES >::visitBreadthFirst(), and mrpt::math::CDirectedTree< TYPE_EDGES >::visitDepthFirst().