pub struct Graph<F: Float> {
pub n_nodes: usize,
pub adjacency: Vec<Vec<(usize, F)>>,
pub node_features: Option<Array2<F>>,
}Expand description
Graph representation for clustering algorithms
Fields§
§n_nodes: usizeNumber of nodes in the graph
adjacency: Vec<Vec<(usize, F)>>Adjacency list representation: node_id -> [(neighbor_id, weight), …]
node_features: Option<Array2<F>>Optional node labels/features
Implementations§
Source§impl<F: Float + FromPrimitive + Debug + ScalarOperand + Sum + Eq + Hash + 'static> Graph<F>
impl<F: Float + FromPrimitive + Debug + ScalarOperand + Sum + Eq + Hash + 'static> Graph<F>
Sourcepub fn from_adjacencymatrix(_adjacencymatrix: ArrayView2<'_, F>) -> Result<Self>
pub fn from_adjacencymatrix(_adjacencymatrix: ArrayView2<'_, F>) -> Result<Self>
Create a graph from an adjacency matrix
Sourcepub fn from_knngraph(data: ArrayView2<'_, F>, k: usize) -> Result<Self>
pub fn from_knngraph(data: ArrayView2<'_, F>, k: usize) -> Result<Self>
Create a k-nearest neighbor_ graph from data points
Sourcepub fn add_edge(&mut self, node1: usize, node2: usize, weight: F) -> Result<()>
pub fn add_edge(&mut self, node1: usize, node2: usize, weight: F) -> Result<()>
Add an edge between two nodes
Sourcepub fn weighted_degree(&self, node: usize) -> F
pub fn weighted_degree(&self, node: usize) -> F
Get the weighted degree of a node (sum of edge weights)
Sourcepub fn neighbor_s(&self, node: usize) -> &[(usize, F)]
pub fn neighbor_s(&self, node: usize) -> &[(usize, F)]
Get all neighbor_s of a node
Sourcepub fn modularity(&self, communities: &[usize]) -> F
pub fn modularity(&self, communities: &[usize]) -> F
Calculate modularity of a given community assignment
Trait Implementations§
Source§impl<'de, F> Deserialize<'de> for Graph<F>where
F: Deserialize<'de> + Float,
impl<'de, F> Deserialize<'de> for Graph<F>where
F: Deserialize<'de> + Float,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl<F> Freeze for Graph<F>
impl<F> RefUnwindSafe for Graph<F>where
F: RefUnwindSafe,
impl<F> Send for Graph<F>where
F: Send,
impl<F> Sync for Graph<F>where
F: Sync,
impl<F> Unpin for Graph<F>where
F: Unpin,
impl<F> UnwindSafe for Graph<F>where
F: RefUnwindSafe + UnwindSafe,
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.