pub struct MaxCutQAOA {
pub graph: Vec<Vec<usize>>,
pub weights: Option<Vec<Vec<f64>>>,
pub num_vertices: usize,
/* private fields */
}
Expand description
Specialized MaxCut problem solver using QAOA
Fields§
§graph: Vec<Vec<usize>>
Graph represented as adjacency list
weights: Option<Vec<Vec<f64>>>
Edge weights (if weighted graph)
num_vertices: usize
Number of vertices
Implementations§
Source§impl MaxCutQAOA
impl MaxCutQAOA
Sourcepub fn with_weights(self, weights: Vec<Vec<f64>>) -> Self
pub fn with_weights(self, weights: Vec<Vec<f64>>) -> Self
Create with weighted edges
Sourcepub fn build_circuit(&mut self, layers: usize) -> &mut Self
pub fn build_circuit(&mut self, layers: usize) -> &mut Self
Build the QAOA circuit for this MaxCut instance
Sourcepub fn evaluate_cut(&self, solution: &[bool]) -> f64
pub fn evaluate_cut(&self, solution: &[bool]) -> f64
Evaluate a cut solution
Sourcepub fn random_graph(num_vertices: usize, edge_probability: f64) -> Self
pub fn random_graph(num_vertices: usize, edge_probability: f64) -> Self
Create a random graph for testing
Trait Implementations§
Source§impl Clone for MaxCutQAOA
impl Clone for MaxCutQAOA
Source§fn clone(&self) -> MaxCutQAOA
fn clone(&self) -> MaxCutQAOA
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 MaxCutQAOA
impl RefUnwindSafe for MaxCutQAOA
impl Send for MaxCutQAOA
impl Sync for MaxCutQAOA
impl Unpin for MaxCutQAOA
impl UnwindSafe for MaxCutQAOA
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.