pub struct BetweennessCentrality<'a> {
pub graph: &'a str,
}Expand description
Betweenness centrality via Brandes algorithm.
For unweighted directed graphs, the per-vertex betweenness is
sum over s != v != t of (sigma_st(v) / sigma_st). Scores are
normalized by (N-1)*(N-2) and clamped into [0, 1].
Fields§
§graph: &'a strImplementations§
Source§impl<'a> BetweennessCentrality<'a>
impl<'a> BetweennessCentrality<'a>
pub fn new(graph: &'a str) -> Self
pub fn execute<G: GraphStore>( &self, store: &G, ) -> GraphStoreResult<GraphPostingList>
Auto Trait Implementations§
impl<'a> Freeze for BetweennessCentrality<'a>
impl<'a> RefUnwindSafe for BetweennessCentrality<'a>
impl<'a> Send for BetweennessCentrality<'a>
impl<'a> Sync for BetweennessCentrality<'a>
impl<'a> Unpin for BetweennessCentrality<'a>
impl<'a> UnsafeUnpin for BetweennessCentrality<'a>
impl<'a> UnwindSafe for BetweennessCentrality<'a>
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