A simple implementation of the algorithm Variable Elimination (VE) in Bayesian networks. This implementation supports only discrete variables and proposes a simple file format for describing the Directed acyclic graph (DAG) and the Conditional Probability Tables (CPTs). The primary intention of this implementation is to count computations and find elimination orderings. Future works inlcude really computing the tables during VE.
jhonatanoliveira/counting-variable-elimination-computations
A simple implementation of Variable Elimination in Bayesian networks for discrete variables
C++