pub struct QuantumGraph { /* private fields */ }Expand description
Graph structure for quantum processing
Implementations§
Source§impl QuantumGraph
impl QuantumGraph
Sourcepub fn new(
num_nodes: usize,
edges: Vec<(usize, usize)>,
node_features: Array2<f64>,
) -> Self
pub fn new( num_nodes: usize, edges: Vec<(usize, usize)>, node_features: Array2<f64>, ) -> Self
Create a new quantum graph
Sourcepub fn with_edge_features(
self,
edge_features: HashMap<(usize, usize), Array1<f64>>,
) -> Self
pub fn with_edge_features( self, edge_features: HashMap<(usize, usize), Array1<f64>>, ) -> Self
Add edge features
Sourcepub fn with_graph_features(self, graph_features: Array1<f64>) -> Self
pub fn with_graph_features(self, graph_features: Array1<f64>) -> Self
Add graph-level features
Sourcepub fn normalized_laplacian(&self) -> Array2<f64>
pub fn normalized_laplacian(&self) -> Array2<f64>
Compute normalized Laplacian
Trait Implementations§
Source§impl Clone for QuantumGraph
impl Clone for QuantumGraph
Source§fn clone(&self) -> QuantumGraph
fn clone(&self) -> QuantumGraph
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 QuantumGraph
impl RefUnwindSafe for QuantumGraph
impl Send for QuantumGraph
impl Sync for QuantumGraph
impl Unpin for QuantumGraph
impl UnwindSafe for QuantumGraph
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.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.