机构地区: 华南理工大学计算机科学与工程学院
出 处: 《计算机工程与设计》 2005年第2期317-319,共3页
摘 要: 论述了一种新的基于层次图的最优路径算法,即将一个平面图划分若干子图,子图抽象为一个高层图。最短 路径的计算首先在高层图中进行,缩小了最优路径的查找范围,降低了最优路径计算的时间开销。 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.