Shortest path algorithm based on hierarchical graph model
Yucong Hu · Jisuanji gongcheng yu sheji · 2005
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.