| 一种基于层次图模型的最优路径算法 |
| |
| 引用本文： | 吴一民,徐建闽,胡郁葱.一种基于层次图模型的最优路径算法[J].计算机工程与设计,2005,26(2):317-319. |
| |
| 作者姓名： | 吴一民 徐建闽 胡郁葱 |
| |
| 作者单位： | 华南理工大学,计算机学院,广东,广州,510640;华南理工大学交通学院,广东,广州,510640 |
| |
| 基金项目： | 广东省自然科学基金项目(020945)。 |
| |
| 摘 要： | 论述了一种新的基于层次图的最优路径算法，即将一个平面图划分若干子图，子图抽象为一个高层图。最短路径的计算首先在高层图中进行，缩小了最优路径的查找范围，降低了最优路径计算的时间开销。
|
| 关 键 词： | 最优路径 层次图模型 Dijkstra算法 |
| 文章编号： | 1000-7024(2005)02-0317-03 |
Shortest path algorithm based on hierarchical graph model |
| |
| WU Yi-min,XU Jian-min,HU Yu-cong.Shortest path algorithm based on hierarchical graph model[J].Computer Engineering and Design,2005,26(2):317-319. |
| |
| Authors: | WU Yi-min XU Jian-min HU Yu-cong |
| |
| Abstract: | A new algorithm for best path founding based on hierarchical graphs is discussed. The algorithm plots out a flat graph into some sub-graphs, which are abstracted as a high-level graph. Calculation for best path founding begins at high-level graph. This method shrinks searching range of best path and reduces time spending of calculating it. |
| |
| Keywords: | best path hierarchical graph dijkstra algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
