单源最短路问题高效算法探究

单源最短路问题是算法研究中由来已久的一个问题,在算法领域早期已经得到了较好的解决,但是在应用计算机语言实现的过程中往往不够优化,导致较高的时间复杂度和空间复杂度。从原始的迪杰斯特拉算法入手,进行透彻分析,在算法思想和实现方式上提出一种全面优化的算法方案,并给出了核心代码。实现过程中使用了堆的数据结构,并在具体的实现过程中进行灵活的优化。经过理论的算法复杂度分析,以及实际的数据测试,都证明全新优化后地单源最短路算法计算耗时非常少,空间复杂度也得到很大程度的降低,应用价值更强。

Research for More Effective Algorithm to Solve the Single-source Shortest Path Problem

The Single-source shortest path problem is a classical problem for the algorithm research,which is solved properly in the early period of algorithm area,but the algorithm implemented by computer language is usually not so optimized,which costs long running time and large memory.To consider the Dijkstra algorithm,analysis it completely,then come up with an optimized algorithm by improving the theory and implementation,and give the key code.Using the data structure of heap,the code is optimized properly.By an...