... 最小支撑树问题(The Minimum Spanning Tree Problem) 最短路问题(The Shortest-Path Problem) 最大流问题(The Maximum Flow Problem) ...
基于20个网页-相关网页
The shortest path problem is a principal issue in the field of Geographic Information System (GIS).
最短路径是GIS应用中的主要问题之一。
参考来源 - GIS领域最短路径的算法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
Based on the shortest path problem and classical absolute center model, an algorithm of absolute center problem is discussed, by using the least distance matrix and the optimum path matrix.
在最短路算法和传统的绝对中心点模型的基础上介绍了一种利用最小距离矩阵和最优路径矩阵求取绝对中心点的算法。
The shortest path problem is an important and elementary content in optimum network.
最短路问题是网络最优化中重要和基本的内容。
The shortest path problem in complex networks and graphs can be easily solved by labeling the distance between current point and start point during depth- first- search.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
应用推荐