compute_targbetween: Compute Targeted Betweenness Centrality from Shortest Paths

In bcbritt/targbetween: Targeted Betweenness Centrality

Description

This helper function takes the list of shortest paths, as retrieved by either one_to_many or assorted_dyads, and uses it to finish the computation of targeted betwenness centrality.

Usage

compute_targbetween(network, paths, num_dyads, update = 0)

Arguments

network	An igraph network graph
paths	Shortest paths retrieved by all_shortest_paths
num_dyads	Number of dyads used in the analysis that generated paths
update	A numeric value indicating how many loop iterations should elapse between progress updates (default = 0, which suppresses output)

Details

This function should not be called directly. Instead, provide the network and the set of dyads that you want to analyze to targbetween_alldyads or targbetween. Each of those functions calls compute_targbetween as needed.

Value

A data.frame with the results for targeted betweenness centrality

bcbritt/targbetween documentation built on April 21, 2021, 6:12 p.m.