updated docs to better describe nrAssignments
parent
6aa7d667f3
commit
1818695664
|
|
@ -304,6 +304,26 @@ namespace gtsam {
|
||||||
* This includes counts removed from implicit pruning hence,
|
* This includes counts removed from implicit pruning hence,
|
||||||
* it will always be >= nrLeaves().
|
* it will always be >= nrLeaves().
|
||||||
*
|
*
|
||||||
|
* E.g. we have a decision tree as below, where each node has 2 branches:
|
||||||
|
*
|
||||||
|
* Choice(m1)
|
||||||
|
* 0 Choice(m0)
|
||||||
|
* 0 0 Leaf 0.0
|
||||||
|
* 0 1 Leaf 0.0
|
||||||
|
* 1 Choice(m0)
|
||||||
|
* 1 0 Leaf 1.0
|
||||||
|
* 1 1 Leaf 2.0
|
||||||
|
*
|
||||||
|
* In the unpruned form, the tree will have 4 assignments, 2 for each key, and 4 leaves.
|
||||||
|
*
|
||||||
|
* In the pruned form, the number of assignments is still 4 but the number of leaves is now 3, as below:
|
||||||
|
*
|
||||||
|
* Choice(m1)
|
||||||
|
* 0 Leaf 0.0
|
||||||
|
* 1 Choice(m0)
|
||||||
|
* 1 0 Leaf 1.0
|
||||||
|
* 1 1 Leaf 2.0
|
||||||
|
*
|
||||||
* @return size_t
|
* @return size_t
|
||||||
*/
|
*/
|
||||||
size_t nrAssignments() const;
|
size_t nrAssignments() const;
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue