A OE Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs - Computer Science > Data Structures and AlgorithmsReport as inadecuate




A OE Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs - Computer Science > Data Structures and Algorithms - Download this document for free, or read online. Document in PDF available to download.

Abstract: In most of the shortest path problems like vehicle routing problems andnetwork routing problems, we only need an efficient path between two pointssource and destination, and it is not necessary to calculate the shortest pathfrom source to all other nodes. This paper concentrates on this very idea andpresents an algorithm for calculating shortest path for i nonnegativeweighted undirected graphs ii unweighted undirected graphs. The algorithmcompletes its execution in OE for all graphs except few in which longer pathin terms of number of edges from source to some node makes it best selectionfor that node. The main advantage of the algorithms is its simplicity and itdoes not need complex data structures for implementations.



Author: Muhammad Aasim Qureshi, Dr. Fadzil B. Hassan, Sohail Safdar, Rehan Akbar

Source: https://arxiv.org/







Related documents