Struct BetweennessCentrality 

pub struct BetweennessCentrality { /* private fields */ }

How much of the selected topology’s shortest routing passes through one node.

The raw score sums, over every ordered pair of other nodes, the fraction of that pair’s shortest routes this node sits inside. The normalized score divides it by how many such pairs a graph this size can state at all.

Implementations

impl BetweennessCentrality

pub fn node(self) -> GraphNodeId

The node this score describes.

pub fn raw(self) -> f64

The summed share of shortest routes passing through it.

pub fn normalized(self) -> f64

That share against every ordered pair a graph this size can state, or zero when it can state none.

Trait Implementations

impl Clone for BetweennessCentrality

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for BetweennessCentrality

impl Debug for BetweennessCentrality

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

Formats the value using the given formatter.