针对具有幂律度分布的复杂网络的平均最短路径长度进行了研究。
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.
提出了一种基于边界路由器的远程路由计算和查找方法，以边界路由器为核心计算远程路由信息，查找时通过路径长度比较实现最短路径的选择。
A new method which computes remote routing based on the border routers, was presented and finds the appropriate route by comparing the length of routing.
最后，全面阐述图的最短路径算法，提出改进算法，有效地解决了含有多条相同长度的单源点最短路径问题；
A new algorithm is proposed, which solves the shortest path in a graph with the same length of the edges.
为来访客人提供景点的问路查询，即已知一个景点，查询到某景点之间的一条最短路径及长度。
Attractions for the visiting guests ask queries that are known to an attraction, a query to a shortest path between sites and length.
为来访客人提供景点的问路查询，即已知一个景点，查询到某景点之间的一条最短路径及长度。
Attractions for the visiting guests ask queries that are known to an attraction, a query to a shortest path between sites and length.
应用推荐