Skip to main content

FactorGraph

Struct FactorGraph 

Source
pub struct FactorGraph { /* private fields */ }
Expand description

Factor graph representation for PGM.

Implementations§

Source§

impl FactorGraph

Source

pub fn new() -> Self

Create a new empty factor graph.

Source

pub fn add_variable(&mut self, name: String, domain: String)

Add a variable to the graph.

Source

pub fn add_variable_with_card( &mut self, name: String, domain: String, cardinality: usize, )

Add a variable with specific cardinality.

Source

pub fn add_factor(&mut self, factor: Factor) -> Result<()>

Add a factor to the graph.

Source

pub fn add_factor_from_predicate( &mut self, name: &str, var_names: &[String], ) -> Result<()>

Add a factor from predicate name and variables.

Source

pub fn get_variable(&self, name: &str) -> Option<&VariableNode>

Get variable node.

Source

pub fn get_factor(&self, id: &str) -> Option<&Factor>

Get factor by ID.

Source

pub fn get_factor_by_name(&self, name: &str) -> Option<&Factor>

Get factor by name.

Source

pub fn get_adjacent_factors(&self, var: &str) -> Option<&Vec<String>>

Get factors connected to a variable.

Source

pub fn get_adjacent_variables(&self, factor_id: &str) -> Option<&Vec<String>>

Get variables connected to a factor.

Source

pub fn num_variables(&self) -> usize

Get number of variables.

Source

pub fn num_factors(&self) -> usize

Get number of factors.

Source

pub fn is_empty(&self) -> bool

Check if graph is empty.

Source

pub fn variable_names(&self) -> impl Iterator<Item = &String>

Get all variable names.

Source

pub fn factor_ids(&self) -> impl Iterator<Item = &String>

Get all factor IDs.

Source

pub fn variables(&self) -> impl Iterator<Item = (&String, &VariableNode)>

Get all variables as an iterator.

Source

pub fn factors(&self) -> impl Iterator<Item = &Factor>

Get all factors as an iterator.

Source

pub fn get_all_factors(&self) -> Vec<&Factor>

Get all factors as a vector (for external use).

Trait Implementations§

Source§

impl Clone for FactorGraph

Source§

fn clone(&self) -> FactorGraph

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for FactorGraph

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Default for FactorGraph

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl QuantRSModelExport for FactorGraph

Source§

fn to_quantrs_model(&self) -> Result<ModelExport>

Export the model to a QuantRS-compatible format.
Source§

fn model_stats(&self) -> ModelStatistics

Get model statistics for QuantRS integration.
Source§

impl QuantumAnnealing for FactorGraph

Source§

fn to_qubo(&self) -> Result<QUBOProblem>

Convert the factor graph to a QUBO (Quadratic Unconstrained Binary Optimization) problem. Read more
Source§

fn anneal(&self, config: &AnnealingConfig) -> Result<QuantumSolution>

Run quantum annealing to find the optimal assignment. Read more
Source§

fn anneal_multiple( &self, config: &AnnealingConfig, num_runs: usize, ) -> Result<QuantumSolution>

Run multiple annealing runs and return the best solution. Read more
Source§

impl QuantumInference for FactorGraph

Source§

fn solve_qaoa(&self, num_layers: usize) -> Result<HashMap<String, usize>>

Solve the optimization problem using QAOA (Quantum Approximate Optimization Algorithm). Read more
Source§

fn quantum_marginals( &self, num_shots: usize, ) -> Result<HashMap<String, ArrayD<f64>>>

Compute marginal distributions using quantum sampling. Read more
Source§

fn quantum_partition_function(&self) -> Result<f64>

Compute the partition function using quantum amplitude estimation. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DynClone for T
where T: Clone,

Source§

fn __clone_box(&self, _: Private) -> *mut ()

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V