CePa (version 0.7.0)

reach: Calculate largest reach centrality

Description

Calculate largest reach centrality

Usage

reach(graph, weights=E(graph)$weight, mode=c("all", "in", "out"))

Arguments

graph

an igraph object

mode

mode of the centrality

weights

If the edges in the graph have weight, then by default, the weight is used to calculate the length of the shortest path. Set it to NULL to supress the weight.

Details

The largest reach centrality measures how far a node can send or receive the information in the network. It is defined as the largest length of the shortest path from all the other nodes in the network.

Examples

# NOT RUN {
# There is no example
NULL

# }