Skip to main content

EdgeBetweennessResult

Struct EdgeBetweennessResult 

Source
pub struct EdgeBetweennessResult {
    pub membership: Vec<u32>,
    pub nb_clusters: u32,
    pub removed_edges: Vec<u32>,
    pub edge_betweenness: Vec<f64>,
    pub merges: Vec<[u32; 2]>,
    pub bridges: Vec<u32>,
    pub modularity: Vec<f64>,
}
Expand description

Fields§

§membership: Vec<u32>

Per-vertex community label of the best partition along the dendrogram (the one maximising modularity). Labels are densely numbered in 0..nb_clusters.

§nb_clusters: u32

Number of distinct communities in membership.

§removed_edges: Vec<u32>

Edge IDs in the order they were removed (length = ecount). Suitable as input to a separate dendrogram replay if a caller wants to recompute partitions at other cut points.

§edge_betweenness: Vec<f64>

Betweenness of each removed edge at the moment of removal (same length and order as removed_edges). Halved for undirected graphs to match the centrality convention. For directed graphs this is left un-halved, matching the upstream if (!directed) eb /= 2.0; rule.

§merges: Vec<[u32; 2]>

Merges in dendrogram order. Each row [c1, c2] means clusters c1 and c2 are merged into the new cluster n + i (where i is the merge index and n is vcount). Same encoding as igraph_community_eb_get_merges() / Walktrap.

§bridges: Vec<u32>

bridges[i] is the index into removed_edges of the edge whose removal triggered the i-th merge (i.e. the edge that disconnected the network into one more component). Reverse-order count: equal to the number of merges.

§modularity: Vec<f64>

Modularity at each level of the dendrogram. modularity[0] is the modularity of the all-singletons partition, then one entry per merge. Length = merges.len() + 1.

Trait Implementations§

Source§

impl Clone for EdgeBetweennessResult

Source§

fn clone(&self) -> EdgeBetweennessResult

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for EdgeBetweennessResult

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.