求出一个网络的所有最短路径，并根据最短路径求出所有节点和边的介数。适用于有向图和无向图。-All the shortest path in a network is obtained, the dielectric number of all the nodes and edges and was determined according to the shortest path. Applicable to a directed graph and no directed graph.

一个很有用的计算网络中每个节点介数的程序，对网络分析很有用-Computing network a very useful medium for each node in the number of procedures, network analysis is useful