pub struct MaxCutProblem {
pub n_vertices: usize,
pub edges: Vec<(usize, usize, f64)>,
}Expand description
Weighted MaxCut problem instance.
The MaxCut cost function is: C = Σ_{(i,j)∈E} w_{ij} * (1 - ⟨Z_i Z_j⟩) / 2
Fields§
§n_vertices: usizeNumber of vertices
edges: Vec<(usize, usize, f64)>Weighted edges: (vertex_i, vertex_j, weight)
Implementations§
Source§impl MaxCutProblem
impl MaxCutProblem
Sourcepub fn new(n_vertices: usize, edges: Vec<(usize, usize, f64)>) -> Self
pub fn new(n_vertices: usize, edges: Vec<(usize, usize, f64)>) -> Self
Create a new MaxCut problem.
Sourcepub fn cost_function(&self, state: &Statevector) -> QcResult<f64>
pub fn cost_function(&self, state: &Statevector) -> QcResult<f64>
Compute the cost function value: C = Σ w_ij * (1 - ⟨Z_i Z_j⟩) / 2
This is the expected number of edges in the cut, which we want to maximize.
Trait Implementations§
Source§impl Clone for MaxCutProblem
impl Clone for MaxCutProblem
Source§fn clone(&self) -> MaxCutProblem
fn clone(&self) -> MaxCutProblem
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for MaxCutProblem
impl RefUnwindSafe for MaxCutProblem
impl Send for MaxCutProblem
impl Sync for MaxCutProblem
impl Unpin for MaxCutProblem
impl UnsafeUnpin for MaxCutProblem
impl UnwindSafe for MaxCutProblem
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.