pub struct GraphData {
pub node_features: Vec<Vec<f64>>,
pub adjacency: Vec<Vec<usize>>,
pub labels: Option<Vec<usize>>,
}Expand description
Node features and graph structure for GraphSAGE
Fields§
§node_features: Vec<Vec<f64>>Node feature matrix: node_features[i] = feature vector for node i
adjacency: Vec<Vec<usize>>Adjacency list: adjacency[i] = list of neighbor indices
labels: Option<Vec<usize>>Optional node labels for supervised training
Implementations§
Source§impl GraphData
impl GraphData
Sourcepub fn new(features: Vec<Vec<f64>>, adjacency: Vec<Vec<usize>>) -> Result<Self>
pub fn new(features: Vec<Vec<f64>>, adjacency: Vec<Vec<usize>>) -> Result<Self>
Create a new graph from node features and adjacency list.
Validates that all adjacency indices are within bounds.
Sourcepub fn feature_dim(&self) -> usize
pub fn feature_dim(&self) -> usize
Dimensionality of node features
Sourcepub fn sample_neighbors(
&self,
node: usize,
k: usize,
rng: &mut SimpleLcg,
) -> Vec<usize>
pub fn sample_neighbors( &self, node: usize, k: usize, rng: &mut SimpleLcg, ) -> Vec<usize>
Sample up to k neighbors uniformly at random using a simple LCG PRNG
Sourcepub fn with_labels(self, labels: Vec<usize>) -> Result<Self>
pub fn with_labels(self, labels: Vec<usize>) -> Result<Self>
Set node labels for supervised training
Trait Implementations§
Auto Trait Implementations§
impl Freeze for GraphData
impl RefUnwindSafe for GraphData
impl Send for GraphData
impl Sync for GraphData
impl Unpin for GraphData
impl UnsafeUnpin for GraphData
impl UnwindSafe for GraphData
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
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.