closeness {igraph} | R Documentation |
Cloness centrality measures how many steps is required to access every other vertex from a given vertex.
closeness(graph, v=V(graph), mode = "all")
graph |
The graph to analyze. |
v |
The vertices for which closeness will be calculated. |
mode |
Character string, defined the types of the paths used for measuring the distance in directed graphs. “in” measures the paths to a vertex, “out” measures paths from a vertex, all uses undirected paths. This argument is ignored for undirected graphs. |
The closeness centrality of a vertex is defined by the inverse of the average length of the shortest paths to/from all the other vertices in the graph:
(|V|-1)/sum( d(v,i), i != v)
If there is no (directed) path between vertex v
and
i
then the total number of vertices is used in the
formula instead of the path length.
Numeric vector with the closeness values of all the vertices in
v
.
Gabor Csardi csardi@rmki.kfki.hu
Freeman, L.C. (1979). Centrality in Social Networks I: Conceptual Clarification. Social Networks, 1, 215-239.
g <- graph.ring(10) g2 <- graph.star(10) closeness(g) closeness(g2, mode="in") closeness(g2, mode="out") closeness(g2, mode="all")