pub struct BetweennessCentrality;Expand description
Betweenness Centrality algorithm implementation.
Betweenness centrality quantifies the number of times a node acts as a bridge along the shortest path between two other nodes.
Implementations§
Source§impl BetweennessCentrality
impl BetweennessCentrality
Sourcepub fn compute<T: Transaction>(
tx: &T,
config: &BetweennessCentralityConfig,
) -> GraphResult<CentralityResult>
pub fn compute<T: Transaction>( tx: &T, config: &BetweennessCentralityConfig, ) -> GraphResult<CentralityResult>
Sourcepub fn compute_for_nodes<T: Transaction>(
tx: &T,
nodes: &[EntityId],
config: &BetweennessCentralityConfig,
) -> GraphResult<CentralityResult>
pub fn compute_for_nodes<T: Transaction>( tx: &T, nodes: &[EntityId], config: &BetweennessCentralityConfig, ) -> GraphResult<CentralityResult>
Compute betweenness centrality for a subset of nodes.
Only considers shortest paths within the specified subgraph.
§Arguments
tx- The transaction to use for graph accessnodes- The nodes to include in the computationconfig- Configuration parameters for the algorithm
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