Dynamic route choice is one of the essential functions in n car navigation system. The deifciencies of classic Dijkstra algorithm are analyzed, and on this basis, the problems of obstacles-existed shortest path are discussed by using optimized adjacency matrix storage structure. The dynamic shortest path algorithm with the obstacles existing is realized by using VC++ and MapX. Experimental results show that the proposed algorithm can effectively work out the shortest path with the obstacles existing.%车载导航系统中的动态路线选择是其必备功能之一，文中分析了经典Dijkstra算法存在的不足，并在此基础上，采用优化的邻接矩阵存储结构，讨论了有障碍物存在情况下的最短路径问题。同时用VC++与MapX实现了有障碍物存在的动态最短路径算法。实验结果表明，该算法能有效求出有障碍物存在时的最短路径。
展开▼
