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 108
- Downloads 0
Analysis Study of Fuzzy Logic Using Blood Pressure Readings
Fuzzy logic is a form of many-valued logic or probabilistic logic; it deals with reasoning that is approximate rather than fixed and exact. Compared to traditional binary sets (where variables may take on true or false v...
Robust Data Clustering Algorithms for Network Intrusion Detection
IDS (Intrusion Detection system) is an active and driving defense technology. Intrusion detection is to detect attacks against a computer system. This project mainly focuses on intrusion detection based on data min...
Detection Of Brain Tumor Using Kernel Induced Possiblistic C-Means Clustering
Brain tumor is a major health problem throughout the world. Magnetic resonance imaging (MRI) scan can be used to produce image of any part of the body and it provides an efficient and fast way for diagnosis of the brain...
A Knowledge discovery Approach in Shopping Complex Database (ASCD)
Data mining and Knowledge Discovery (KD) has been widely accepted as a key technology for enterprises to improve their abilities in data analysis, decision support and the automatic extraction of knowledge from dat...
Pattern Recognition for Finding Similarity of Webpages
We proposed a functional technique for identifying similar Web pages that is based on measuring tree similarity. In this paper we introduce an experiment with two methods for evaluating the similarity of web pages. The r...