中文说明：求出一个网络的所有最短路径，并根据最短路径求出所有节点和边的介数。适用于有向图和无向图。
English Description：
All the shortest paths of a network are found, and the betweens of all nodes and edges are calculated according to the shortest path. It is suitable for digraphs and undirected graphs.