Effective Searching Shortest Path In Graph Using Prim’s Algorithm
Journal Title: International Journal of Computer & organization Trends(IJCOT) - Year 2013, Vol 3, Issue 8
Abstract
Prims algorithm is studied the shortest path problem in the greedy method which is used to select a subset of the edge such that spanning tree is formed and the weight of the edges is minimal. There are various shortest path methods available. An algorithm is designed based on which, a new method in greedy method is proposed which is more effective and efficient than other well-known method. At each stage of the undirected graph it make a decision that appear to be best at the time, also made at one stage is not changed in a later stage, so each decision should assure feasibility.
Authors and Affiliations
D. Kalpanadevi
Keywords
Related Articles
- EP ID EP162300
- DOI -
- Views 104
- Downloads 0
ALL-EMBRACING REVIEW OF WIRELESS NETWORK PROTOCOL,OPTIMUM NETWORK SIMULATOR
Wireless connectivity is the new murmur utterance in computer networks. It involves connecting laptops, mobile libraries and even fridges to computer networks, without physical wire connections. Wireless connectivi...
Pre-eminent Multi-path routing with maximum resource utilization in traffic engineering approach
the main objective of the proposed system is providing optimal path and extreme utilization with link state routing. This aims to provide best contribution of traffic engineering with effective load balancing. Eliminatio...
Data Mining Machine Learning Approaches and Medical Diagnose Systems : A Survey
Data mining technology provides a user- oriented approach to novel and hidden patterns in the data. Data mining is a process which finds useful patterns from large amount of data. This technology has been succes...
Ajax Complexity
For century, This paper discuss the new era of Internet application and user experience, Ajax is a new technology and this paper address the Software system complexity and Algorithms for better feature and performa...
Modified Ant Colony Based Routing Algorithm in Manet
In MANET, without the aid of any established infrastructure or centralized administration, a temporary network needs to be established whenever a node tries to send data to another node. Each node in MANET acts as an end...