Title: Research for More Effective Algorithm to Solve the Single-source Shortest Path Problem
Abstract: 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 analysis of theory and ran-dom data tests,the new single-source shortest path algorithm is proved to be using very less time and memory,which is more practical.
Publication Year: 2009
Publication Date: 2009-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot