pub struct BayesianNetwork { /* private fields */ }Expand description
Bayesian Network builder.
Provides a convenient API for constructing directed acyclic graphical models with conditional probability distributions.
Implementations§
Source§impl BayesianNetwork
impl BayesianNetwork
Sourcepub fn add_variable(&mut self, name: String, cardinality: usize) -> &mut Self
pub fn add_variable(&mut self, name: String, cardinality: usize) -> &mut Self
Add a variable node to the network.
Sourcepub fn add_cpd(
&mut self,
child: String,
parents: Vec<String>,
cpd: ArrayD<f64>,
) -> Result<&mut Self>
pub fn add_cpd( &mut self, child: String, parents: Vec<String>, cpd: ArrayD<f64>, ) -> Result<&mut Self>
Add a conditional probability distribution P(child | parents).
§Arguments
child- The dependent variableparents- Parent variables that child depends oncpd- Conditional probability table (dimensions: [parent1_card, …, child_card])
Sourcepub fn add_prior(
&mut self,
variable: String,
prior: ArrayD<f64>,
) -> Result<&mut Self>
pub fn add_prior( &mut self, variable: String, prior: ArrayD<f64>, ) -> Result<&mut Self>
Add a prior probability P(variable) for a root node.
Sourcepub fn graph(&self) -> &FactorGraph
pub fn graph(&self) -> &FactorGraph
Get the underlying factor graph.
Sourcepub fn is_acyclic(&self) -> bool
pub fn is_acyclic(&self) -> bool
Check if the network is acyclic (DAG property).
Sourcepub fn topological_order(&self) -> Result<Vec<String>>
pub fn topological_order(&self) -> Result<Vec<String>>
Get topological ordering of variables (ancestors before descendants).
Trait Implementations§
Auto Trait Implementations§
impl Freeze for BayesianNetwork
impl RefUnwindSafe for BayesianNetwork
impl Send for BayesianNetwork
impl Sync for BayesianNetwork
impl Unpin for BayesianNetwork
impl UnwindSafe for BayesianNetwork
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.