摘要
In this paper,based on the adjacency matrix of the network and its powers,the formulas are derived for theshortest path and the average path length,and an effective algorithm is presented.Furthermore,an example is providedto demonstrate the proposed method.
基金
National Natural Science Foundation of China under the Key Project under Grant Nos.10635040 and 60774073
the Natural Science Foundation of Jiangsu Province of China under Grant No.BK2007075
