摘要
详细讨论一类标准层次图的分段算法及其在最短路径上的应用,分段算法及应用在机器上得到了实现,算法的综合时间复杂度为O(e),较一些传统方法要好.
In this paper,we discussed piecewise algorithm of a kind of standard Graphs and its application in the shortest path problem in detail, piecewise algorithm and its application has been achieved in computer, a comprehensive algorithm time complexity is O （e）, better than traditional methods.
出处
《赣南师范学院学报》
2009年第6期81-83,共3页
Journal of Gannan Teachers' College(Social Science(2))
关键词
标准层次图
分段算法
最短路径
sub-standard level map
piecewise algorithm
shortest path
