Logo

A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs

Qureshi, M.A. and Hassan, M.F. and Safdar, S. and Akhbar, R. (2010) A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs. International Journal on Computer Science and Information Security (IJSIS), Volume 6 (No 1). pp. 40-46. ISSN 1947-5500

[img] Other (WinRAR) - Published Version
Restricted to Registered users only
Available under License Creative Commons Attribution.

630Kb

Abstract

In most of the shortest path problems like vehicle routing problems and network routing problems, we only need an efficient path between two points—source and destination, and it is not necessary to calculate the shortest path from source to all other nodes. This paper concentrates on this very idea and presents an algorithms for calculating shortest path for (i) nonnegative weighted undirected graphs (ii) unweighted undirected graphs. The algorithm completes its execution in O(|E|) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node.

Item Type:Article
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Departments / MOR / COE:Departments > Computer Information Sciences
ID Code:2122
Deposited By: Dr Mohd Fadzil Hassan
Deposited On:12 May 2010 00:57
Last Modified:25 Oct 2013 02:45

Repository Staff Only: item control page

Document Downloads

More statistics for this item...