摘要
In this paper, based oil the adjacency matrix of the network and its powers, the formulas are derived For the shortest path and the average path length, and an effective algorithm is presented. Furthermore, an example is provided to demonstrate the proposed method.
- 出版日期2008-10-15
- 单位扬州大学