wrap and test dot method
parent
d41ab8addb
commit
352268448c
|
@ -91,6 +91,8 @@ class DiscreteBayesNet {
|
||||||
double operator()(const gtsam::DiscreteValues& values) const;
|
double operator()(const gtsam::DiscreteValues& values) const;
|
||||||
gtsam::DiscreteValues optimize() const;
|
gtsam::DiscreteValues optimize() const;
|
||||||
gtsam::DiscreteValues sample() const;
|
gtsam::DiscreteValues sample() const;
|
||||||
|
string dot(const gtsam::KeyFormatter& keyFormatter =
|
||||||
|
gtsam::DefaultKeyFormatter) const;
|
||||||
};
|
};
|
||||||
|
|
||||||
#include <gtsam/discrete/DiscreteBayesTree.h>
|
#include <gtsam/discrete/DiscreteBayesTree.h>
|
||||||
|
|
|
@ -135,7 +135,7 @@ TEST(DiscreteBayesNet, Asia) {
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ************************************************************************* */
|
/* ************************************************************************* */
|
||||||
TEST_UNSAFE(DiscreteBayesNet, Sugar) {
|
TEST(DiscreteBayesNet, Sugar) {
|
||||||
DiscreteKey T(0, 2), L(1, 2), E(2, 2), C(8, 3), S(7, 2);
|
DiscreteKey T(0, 2), L(1, 2), E(2, 2), C(8, 3), S(7, 2);
|
||||||
|
|
||||||
DiscreteBayesNet bn;
|
DiscreteBayesNet bn;
|
||||||
|
@ -149,6 +149,23 @@ TEST_UNSAFE(DiscreteBayesNet, Sugar) {
|
||||||
bn.add(C | S = "1/1/2 5/2/3");
|
bn.add(C | S = "1/1/2 5/2/3");
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/* ************************************************************************* */
|
||||||
|
TEST_UNSAFE(DiscreteBayesNet, Dot) {
|
||||||
|
DiscreteKey Asia(0, 2), Smoking(4, 2), Tuberculosis(3, 2), LungCancer(6, 2),
|
||||||
|
Either(5, 2);
|
||||||
|
|
||||||
|
DiscreteBayesNet fragment;
|
||||||
|
fragment.add(Asia % "99/1");
|
||||||
|
fragment.add(Smoking % "50/50");
|
||||||
|
|
||||||
|
fragment.add(Tuberculosis | Asia = "99/1 95/5");
|
||||||
|
fragment.add(LungCancer | Smoking = "99/1 90/10");
|
||||||
|
fragment.add((Either | Tuberculosis, LungCancer) = "F T T T");
|
||||||
|
|
||||||
|
string actual = fragment.dot();
|
||||||
|
EXPECT(actual == "digraph G{\n3->5\n6->5\n4->6\n0->3\n}");
|
||||||
|
}
|
||||||
|
|
||||||
/* ************************************************************************* */
|
/* ************************************************************************* */
|
||||||
int main() {
|
int main() {
|
||||||
TestResult tr;
|
TestResult tr;
|
||||||
|
|
Loading…
Reference in New Issue