（c）最短路径长度（shortest path length）．： 。两点的最短路径长度‘定义为网络中所有连通（i，J）的通路中，所经过的其它顶点最少的一条路径的长度。
基于20个网页-相关网页
针对具有幂律度分布的复杂网络的平均最短路径长度进行了研究。
The average path length of Internet with power law degree distribution is studied in this paper.
由此构造的P 2 P网络具有较小的平均最短路径长度、良好的可扩展性和鲁棒性。
This P2P network has less average shortest path length with better scalability and robustness.
为了求解上述模型，首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度，然后设计了捕食搜索算法对模型进行求解。
To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution.
应用推荐