Closeness is a radial measure of centrality that favors actors who are connected with many others via short paths. Intuitively, if the graph represents a transportation network, then a node with high closeness would make a good location for a warehouse since the average distance to all other locations (i.e., all other nodes in the graph) is relatively short. In information-spreading networks, a node with high closeness centrality would be a good choice to start a rumor since many others can be reached with relatively few intermediates.
Definition (simple case)
On directed, unweighted graphs that are strongly connected, the closeness centrality of a node is defined as
Edge weights and distances
If a link strength has been selected, the length of an -path is the sum of the corresponding attribute values of all links in the path.