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
Result of edge_betweenness_community.
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: u32Number 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
impl Clone for EdgeBetweennessResult
Source§fn clone(&self) -> EdgeBetweennessResult
fn clone(&self) -> EdgeBetweennessResult
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read more