Define prims algorithm, Data Structure & Algorithms

Define Prim's Algorithm

Prim's  algorithm  is  a  greedy  algorithm  for  constructing  a  minimum  spanning  tree  of  a  weighted linked graph. It works by attaching to a before constructed sub tree a vertex to the vertices already in the tree.

 

Posted Date: 7/27/2013 5:49:48 AM | Location : United States







Related Discussions:- Define prims algorithm, Assignment Help, Ask Question on Define prims algorithm, Get Answer, Expert's Help, Define prims algorithm Discussions

Write discussion on Define prims algorithm
Your posts are moderated
Related Questions

What do you understand by tree traversal? The algorithm walks by the tree data structure and performs some computation at everynode in the tree. This process of walking by the

solve the following relation by recursive method: T(n)=2T(n^1/2)+log n

In this unit, we have learned how the stacks are implemented using arrays and using liked list. Also, the advantages and disadvantages of using these two schemes were discussed. Fo

Q. Write down the algorithm for binary search. Which are the conditions under which sequential search of a list is preferred over the binary search?

Any binary search tree must contain following properties to be called as a red-black tree. 1. Each node of a tree should be either red or black. 2. The root node is always bl

what are the charaterstics to determine weather an algorithm is good or not? explain in detail

how multiple stacks can be implemented using one dimensional array

Beauty Salon is a system to be designed to manage the booking and the payment of a single beauty parlour. Beauty Therapists: A beauty parlour has a number of staff members mo

The following DNA sequences are extracted from promoter region of genes which are co-regulated by the same transcription factor (TF). The nucleotide segments capitalized in the giv