A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs

Details A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs

2009-11-02

arxiv.org/abs/0911.0174v1

International Journal of Computer Science and Information Security, IJCSIS, Vol. 6, No. 1, pp. 040-046, October 2009, USA

Computer Science

Data Structures and Algorithms

7 pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS 2009, ISSN 1947 5500, Impact F

Scientific paper

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 algorithm 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. The main advantage of the algorithms is its simplicity and it does not need complex data structures for implementations.

Affiliated with

Also associated with

No associations

Rating

A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-255412