Struct NeighborDegree 

pub struct NeighborDegree {
    pub knn: Vec<f64>,
    pub knnk: Vec<f64>,
}

Result of Graph::avg_nearest_neighbor_degree.

Fields

knn: Vec<f64>

knn[i] is the (possibly weighted) average degree of the neighbors of the i-th selected vertex; NaN for isolated vertices (with weights: for vertices of zero strength).

knnk: Vec<f64>

The k_nn(k) degree correlation function: knnk[k - 1] is the mean of knn over the selected vertices of degree k (with weights, the mean weighted by their strengths), NaN for degrees that do not occur. Note the shift: the first element is for degree one. Its length is the maximum degree (according to mode) of the whole graph.

Trait Implementations

impl Clone for NeighborDegree

fn clone(&self) -> NeighborDegree

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for NeighborDegree

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for NeighborDegree

fn eq(&self, other: &NeighborDegree) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for NeighborDegree