[igraph] number of times a node is on the shortest path between two nodes otherwise disconnected for egonetworks

[dott. Agr. Umberto Medicamento]

> 
> Hi everybody and thank you for keeping update this help archive.
> I’d like to pose the following question:
> how can I get the number of times a node is on the shortest path between two 
> nodes otherwise disconnected?
> I’d like to calculate this "score" for all the egonetwork extracted from a 
> network as a list where each node presents its “name” and “score”.
> 
> Thank you, Umberto
> 
> dott. Agr. Umberto Medicamento
> PhD, MS
> 
>