中文说明：
求复杂网络中两节点的距离、平均最短路径长度以及节点间最短路径条数。采用Floyd算法计算任意两节点的距离,并求最短路径条数用于计算介数。
English Description：
Find the distance between two nodes, the average shortest path length and the number of shortest paths between nodes in complex network. Floyd algorithm is used to calculate the distance between any two nodes, and the shortest path number is used to calculate the betweenness.