The Closeness Centrality

Let’s learn about a centrality measure that takes into account how close a node is to every other node in the network. For that, let’s learn about shortest path distances in a graph.

Shortest path distances

The concept of distance in a network usually talks about how many edges we need to walk on to go from one node to another. We call a path the sequence of edges we walk to traverse that distance.

So, for example, we can highlight a path between two nodes in the following graph: