Inheritance diagram for gtsam::DecisionTree< L, Y >::Choice< L, Y >:

Public Member Functions
	Choice ()
	Default constructor for serialization.
bool	isLeaf () const override
	Choice (const L &label, size_t count)
	Constructor, given choice label and mandatory expected branch count.
	Choice (const Choice &f, const Choice &g, const Binary &op)
	Construct from applying binary op to two Choice nodes.
const L &	label () const
	Return the label of this choice node.
size_t	nrChoices () const
const std::vector< NodePtr > &	branches () const
std::vector< NodePtr > &	branches ()
void	push_back (NodePtr &&node)
	add a branch: TODO merge into constructor
void	print (const std::string &s, const LabelFormatter &labelFormatter, const ValueFormatter &valueFormatter) const override
	print (as a tree).
void	dot (std::ostream &os, const LabelFormatter &labelFormatter, const ValueFormatter &valueFormatter, bool showZero) const override
	output to graphviz (as a a graph)
bool	sameLeaf (const Leaf &q) const override
	Choice-Leaf equality: always false.
bool	sameLeaf (const Node &q) const override
	polymorphic equality: if q is a leaf, could be...
bool	equals (const Node &q, const CompareFunc &compare) const override
	equality
const Y &	operator() (const Assignment< L > &x) const override
	evaluate
	Choice (const L &label, const Choice &f, const Unary &op)
	Construct from applying unary op to a Choice node.
	Choice (const L &label, const Choice &f, const UnaryAssignment &op, const Assignment< L > &assignment)
	Constructor which accepts a UnaryAssignment op and the corresponding assignment.
NodePtr	apply (const Unary &op) const override
	apply unary operator.
NodePtr	apply (const UnaryAssignment &op, const Assignment< L > &assignment) const override
	Apply unary operator with assignment.
NodePtr	apply_f_op_g (const Node &g, const Binary &op) const override
NodePtr	apply_g_op_fL (const Leaf &fL, const Binary &op) const override
NodePtr	apply_g_op_fC (const Choice &fC, const Binary &op) const override
template<typename OP>
NodePtr	apply_fC_op_gL (const Leaf &gL, OP op) const
NodePtr	choose (const L &label, size_t index) const override
	choose a branch, recursively
Public Member Functions inherited from gtsam::DecisionTree< L, Y >::Node
const void *	id () const

Static Public Member Functions
static NodePtr	Unique (const NodePtr &node)
	Merge branches with equal leaf values for every choice node in a decision tree.

Public Attributes
L	label_
	the label of the variable on which we split
std::vector< NodePtr >	branches_
	The children of this Choice node.

Additional Inherited Members
Public Types inherited from gtsam::DecisionTree< L, Y >::Node
using	Ptr = std::shared_ptr<Node>

Constructor & Destructor Documentation

◆ Choice()

template<typename L, typename Y>

gtsam::DecisionTree< L, Y >::Choice< L, Y >::Choice	(	const L &	label,
		const Choice< L, Y > &	f,
		const UnaryAssignment &	op,
		const Assignment< L > &	assignment )

inline

Constructor which accepts a UnaryAssignment op and the corresponding assignment.

Parameters

label	The label for this node.
f	The original choice node to apply the op on.
op	Function to apply on the choice node. Takes Assignment and value as arguments.
assignment	The Assignment that will go to op.

Member Function Documentation

◆ apply() [1/2]

template<typename L, typename Y>

NodePtr gtsam::DecisionTree< L, Y >::Choice< L, Y >::apply ( const Unary & op ) const

inlineoverridevirtual

apply unary operator.

Implements gtsam::DecisionTree< L, Y >::Node.

◆ apply() [2/2]

template<typename L, typename Y>

NodePtr gtsam::DecisionTree< L, Y >::Choice< L, Y >::apply	(	const UnaryAssignment &	op,
		const Assignment< L > &	assignment ) const

inlineoverridevirtual

Apply unary operator with assignment.

Implements gtsam::DecisionTree< L, Y >::Node.

◆ apply_f_op_g()

template<typename L, typename Y>

NodePtr gtsam::DecisionTree< L, Y >::Choice< L, Y >::apply_f_op_g	(	const Node &	g,
		const Binary &	op ) const

inlineoverridevirtual

Implements gtsam::DecisionTree< L, Y >::Node.

◆ apply_g_op_fC()

template<typename L, typename Y>

NodePtr gtsam::DecisionTree< L, Y >::Choice< L, Y >::apply_g_op_fC	(	const Choice< L, Y > &	fC,
		const Binary &	op ) const

inlineoverridevirtual

Implements gtsam::DecisionTree< L, Y >::Node.

◆ apply_g_op_fL()

template<typename L, typename Y>

NodePtr gtsam::DecisionTree< L, Y >::Choice< L, Y >::apply_g_op_fL	(	const Leaf &	fL,
		const Binary &	op ) const

inlineoverridevirtual

Implements gtsam::DecisionTree< L, Y >::Node.

◆ choose()

template<typename L, typename Y>

NodePtr gtsam::DecisionTree< L, Y >::Choice< L, Y >::choose	(	const L &	label,
		size_t	index ) const

inlineoverridevirtual

choose a branch, recursively

Implements gtsam::DecisionTree< L, Y >::Node.

◆ dot()

template<typename L, typename Y>

void gtsam::DecisionTree< L, Y >::Choice< L, Y >::dot	(	std::ostream &	os,
		const LabelFormatter &	labelFormatter,
		const ValueFormatter &	valueFormatter,
		bool	showZero ) const

inlineoverridevirtual

output to graphviz (as a a graph)

Implements gtsam::DecisionTree< L, Y >::Node.

◆ equals()

template<typename L, typename Y>

bool gtsam::DecisionTree< L, Y >::Choice< L, Y >::equals	(	const Node &	q,
		const CompareFunc &	compare ) const

inlineoverridevirtual

equality

Implements gtsam::DecisionTree< L, Y >::Node.

◆ isLeaf()

template<typename L, typename Y>

bool gtsam::DecisionTree< L, Y >::Choice< L, Y >::isLeaf ( ) const

inlineoverridevirtual

Implements gtsam::DecisionTree< L, Y >::Node.

◆ operator()()

template<typename L, typename Y>

const Y & gtsam::DecisionTree< L, Y >::Choice< L, Y >::operator() ( const Assignment< L > & x ) const

inlineoverridevirtual

evaluate

Implements gtsam::DecisionTree< L, Y >::Node.

◆ print()

template<typename L, typename Y>

void gtsam::DecisionTree< L, Y >::Choice< L, Y >::print	(	const std::string &	s,
		const LabelFormatter &	labelFormatter,
		const ValueFormatter &	valueFormatter ) const

inlineoverridevirtual

print (as a tree).

Implements gtsam::DecisionTree< L, Y >::Node.

◆ sameLeaf() [1/2]

template<typename L, typename Y>

bool gtsam::DecisionTree< L, Y >::Choice< L, Y >::sameLeaf ( const Leaf & q ) const

inlineoverridevirtual

Choice-Leaf equality: always false.

Implements gtsam::DecisionTree< L, Y >::Node.

◆ sameLeaf() [2/2]

template<typename L, typename Y>

bool gtsam::DecisionTree< L, Y >::Choice< L, Y >::sameLeaf ( const Node & q ) const

inlineoverridevirtual

polymorphic equality: if q is a leaf, could be...

Implements gtsam::DecisionTree< L, Y >::Node.

◆ Unique()

template<typename L, typename Y>

NodePtr gtsam::DecisionTree< L, Y >::Choice< L, Y >::Unique ( const NodePtr & node )

inlinestatic

Merge branches with equal leaf values for every choice node in a decision tree.

If all branches are the same (i.e. have the same leaf value), replace the choice node with the equivalent leaf node.

This function applies the branch merging (if enabled) recursively on the decision tree represented by the root node passed in as the argument. It recurses to the leaf nodes and merges branches with equal leaf values in a bottom-up fashion.

Thus, if all branches of a choice node f are the same, just return a single branch at each recursion step.

Parameters

node	The root node of the decision tree.

Returns: NodePtr

The documentation for this struct was generated from the following file:

/tmp/gtsam-4.3.0-doxygen.rsXPUS/source/gtsam/discrete/DecisionTree-inl.h

Public Member Functions

Static Public Member Functions

Public Attributes

Additional Inherited Members

Constructor & Destructor Documentation

◆ Choice()

Member Function Documentation

◆ apply() [1/2]

◆ apply() [2/2]

◆ apply_f_op_g()

◆ apply_g_op_fC()

◆ apply_g_op_fL()

◆ choose()

◆ dot()

◆ equals()

◆ isLeaf()

◆ operator()()

◆ print()

◆ sameLeaf() [1/2]

◆ sameLeaf() [2/2]

◆ Unique()