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
Double Linked List In a doubly linked list, also known as 2 way lists, each node is separated into 3 parts. The first part is called last pointer field. It has the address of t

how I can easily implement the bubble,selection,linear,binary searth algorithms?

An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorithm depends upon following cons

Binary tree creation struct NODE { struct NODE *left; int value; struct NODE *right; }; create_tree( struct NODE *curr, struct NODE *new ) { if(new->val

An adjacency matrix representation of a graph cannot having information of : Parallel edges

INSERT FUNCTION /*prototypes of insert & find functions */ list * insert_list(list *); list * find(list *, int); /*definition of  anyinsert function */ list * inser

Q. Explain the various memory allocation strategies.                                                            Ans. M e m ory Allocation Strategies are given as follow

Complexity is the rate at which the needed storage or consumed time rise as a function of the problem size. The absolute growth based on the machine utilized to execute the program

In this example, suppose the statements are simple unless illustrious otherwise. if-then-else statements if (cond) { sequence of statements 1 } else { sequence of st