TIME COMPLEXITY ANALYSIS OF SINGLE SOURCE SHORTEST PATH (SSSP) ALGORITHMS
DOI:
https://doi.org/10.71146/kjmr750Keywords:
Single-Source Shortest Path (SSSP), Computational Complexity Analysis, Graph Algorithms, Network OptimizationAbstract
There are real-world complex networks formed by people, roads, communication network nodes, genes, file Servers and financial transactions etc based on their interdependent associations. Often, there exist multiple paths to connect one of the network nodes to another in the networks. Various situations demand shortest path to reach from one node to another. To find shortest path between a pair of the nodes is challenging in terms of computational cost, therefore, competing algorithms for Shortest Path problem are analyzed to predict their greediness for the computing resources such as memory, bandwidth, or hardware but most often its computational time. The scope of this work is to provide comprehensive knowledge on single-source shortest path problem and analyze time complexity of the prominent single-source shortest path algorithms.
Downloads
Downloads
Published
Issue
Section
Categories
License
Copyright (c) 2025 Khalid Nooruddin Charan, Saad Akbar, Raza Hussain Shah, Mohammad Ayub Latif, Abdul Razaque (Author)
This work is licensed under a Creative Commons Attribution 4.0 International License.
The Kashf Journal of Multidisciplinary Research (KJMR) distributes all published articles under an open access license to ensure wide dissemination and reuse of scholarly work.
Unless otherwise stated, articles published in KJMR are licensed under the Creative Commons Attribution License (CC BY 4.0). Under this license:
-
Permissions Granted
Readers and users are free to:-
Share — copy and redistribute the material in any medium or format
-
Adapt — remix, transform, and build upon the material for any purpose, including commercial use
-
-
Conditions of Use
-
Appropriate credit must be given to the original author(s), the article title, and the Kashf Journal of Multidisciplinary Research.
-
A link to the license must be provided.
-
Any changes made to the original work must be clearly indicated.
-
The use must not imply endorsement by the author(s) or the journal.
-
-
Author Rights
-
Authors retain full copyright of their work.
-
Authors grant KJMR the non-exclusive right to publish, archive, and distribute the article in electronic and print forms.
-
Authors are permitted to deposit the final published version of their article in institutional or subject repositories without embargo.
-
-
Third-Party Material
-
Any third-party content included in an article must be clearly credited and may be subject to separate licensing terms.
-
It is the responsibility of the author(s) to obtain necessary permissions for such material.
-
-
Long-Term Accessibility
-
KJMR ensures permanent availability of published content through its official website and archiving partners, supporting long-term scholarly access.
-
These distribution license terms align with international open access standards and support the journal’s mission to promote ethical, transparent, and wide dissemination of multidisciplinary research.
How to Cite
