Yes - one of the classical ways of computing betweeness centrality is to calculate the number of shortest paths passing through each edge. In this case however,

Yes - one of the classical ways of computing betweeness centrality is to calculate the number of shortest paths passing through each edge. In this case however, he's only computing the shortest paths to/from a single vertex.