We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 48879af commit c2b26c5Copy full SHA for c2b26c5
gtsam/discrete/DiscreteBayesNet.cpp
@@ -71,7 +71,7 @@ DiscreteValues DiscreteBayesNet::sample(DiscreteValues result) const {
71
72
/* ************************************************************************* */
73
// The implementation is: build the entire joint into one factor and then prune.
74
-// NOTE: This can be quite expensive *unless* the factors have already
+// NOTE(Frank): This can be quite expensive *unless* the factors have already
75
// been pruned before. Another, possibly faster approach is branch and bound
76
// search to find the K-best leaves and then create a single pruned conditional.
77
DiscreteBayesNet DiscreteBayesNet::prune(
0 commit comments