Abstract
While technological revolution has active role to the increase of computer information, growing computational capabilities of devices, and raise the level of knowledge abilities, and skills. Increase developments in science and technology. In graph used the shortest path algorithms for solving the shortest path problem. The shortest path can be single pair shortest path problem or all pairs shortest path problem. This paper discuss briefly the shortest path algorithms such as Dijkstra's algorithm, Bellman-Ford algorithm,Floyd- Warshall algorithm, and johnson's algorithm. It describes the previous algorithms for solving the shortest path problem. The goal of this paper is to investigate and comparison the impacts of different shortest path algorithms. The study shows that the efficiency varies among algorithms, helps to suggest which one of them ought to be used to solve a specific variant of the shortest path problem.
Highlights
Today, we live in a rapid technological revolution and rapid development in the technical age
High speed routing has become more important in a process transferring packets from source node to destination node with minimum cost
Johnson's algorithm: Is a way to find the shortest paths between all pairs of vertices in a graph, whose edges may have positive or negative weights
Summary
We live in a rapid technological revolution and rapid development in the technical age. Technological revolution have active role to the increase of computer information. Computer networks are considered one of the important elements that broke all barriers and develop many communication systems. High speed routing has become more important in a process transferring packets from source node to destination node with minimum cost. Routing is the act of moving information across an internetwork from a source to a destination [3]. There are two main concepts of the routing: routing protocols and routing algorithms. The protocol defines rules and conventions for communication between network devices. While algorithm is a procedure or formula for solve problem. Algorithm usually means a small procedure that solves a recurrent problem
Sign-in/Register to view highlights & summary 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 callMore From: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
Disclaimer: 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.
