Abstract
The growing amount of data generated from the increasingly sophisticated network connections requires greater accuracy and higher efficiency in pinpointing the shortest paths concerned. Therefore, the earlier classical exact algorithms are no longer 100 percent suitable for large-scale data processing, for their known great time complexity during calculation. In this paper, We present an updated shortest distance matrix (SDM) algorithm. Evidence to the operation's properties is provided and the properties are used in subsequent optimizations. Compared with Dijkstra's algorithm and Floyd's algorithm, the optimized SDM algorithm with parallel mode makes a great improvement in shortening the running time. The data test shows that the new algorithm improves the efficiency in processing a large amount of data.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
