Search - Dynamic Binary Search Algorithm

Search - Dynamic Binary Search Algorithm - List

[Documents] Dijksta-algorithm DL : 0: 提出一种新型的Dijkstra改进算法，具有高效性．其改进分3个方面：采用邻接表作为道路网络拓扑的存储结构；利用二叉堆实现优先队列；根据节点的分布情况将搜索过程分为几个阶段，引入了动态限制搜索区域机制．最后在实际道路网络中的测试及仿真结果表明了改进算法的可行性和优越性． -Dijkstra proposes a new improved algorithm with high efficiency. Improved three aspects: the adjacent table as the storage structure of the road network topology using binary heap priority queue node distribution of the search process is divided into several stages, the introduction of dynamic limit the search to regional mechanisms. Finally, the actual road network testing and simulation results show the feasibility and advantages of the improved algorithm.
Date : 2025-12-20 Size : 306kb User : 请问