pub struct BetweennessCentrality;Expand description
Betweenness centrality computation using Brandes’ algorithm
Betweenness centrality measures how often a node lies on shortest paths. High betweenness nodes are chokepoints - critical for network flow.
Implementations§
Source§impl BetweennessCentrality
impl BetweennessCentrality
Sourcepub fn compute(graph: &GraphStore, normalize: bool) -> BetweennessResult
pub fn compute(graph: &GraphStore, normalize: bool) -> BetweennessResult
Compute betweenness centrality for all nodes
Uses Brandes’ algorithm: O(V*E) time, O(V) space
Auto Trait Implementations§
impl Freeze for BetweennessCentrality
impl RefUnwindSafe for BetweennessCentrality
impl Send for BetweennessCentrality
impl Sync for BetweennessCentrality
impl Unpin for BetweennessCentrality
impl UnsafeUnpin for BetweennessCentrality
impl UnwindSafe for BetweennessCentrality
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T in a tonic::Request