pub struct SumProductAlgorithm {
pub max_iterations: usize,
pub tolerance: f64,
pub damping: f64,
}Expand description
Sum-product algorithm (belief propagation).
Computes exact marginal probabilities for tree-structured graphs. For loopy graphs, runs loopy belief propagation with optional damping.
Fields§
§max_iterations: usizeMaximum iterations for loopy graphs
tolerance: f64Convergence threshold
damping: f64Damping factor (0.0 = no damping, 1.0 = full damping)
Implementations§
Trait Implementations§
Source§impl Default for SumProductAlgorithm
impl Default for SumProductAlgorithm
Auto Trait Implementations§
impl Freeze for SumProductAlgorithm
impl RefUnwindSafe for SumProductAlgorithm
impl Send for SumProductAlgorithm
impl Sync for SumProductAlgorithm
impl Unpin for SumProductAlgorithm
impl UnwindSafe for SumProductAlgorithm
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.