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
#question. merging 4 sorted files containing 50,10,25,15 records will take time?

c++ To calculate the amount to be paid by a customer buying yummy cupcakes for his birth day party

System defined data types:- These are data types that have been defined by the compiler of any program. The C language contains 4 basic data types:- Int, float,  char and doubl

Explain Space Complexity Space Complexity :- The space complexity of an algorithm is the amount of memory it requires to run to completion. Some of the reasons to study space

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

how to write an algorithm for unions & intersection of two linklists?

algorithm for multiplication of two sparse matrices using linked lists..

Program segment for All pairs shortest paths algorithm AllPairsShortestPaths(int N, Matrix C, Matrix P, Matrix D) { int i, j, k if i = j then C[i][j] = 0  for ( i =

explain the prims''s algorithm with suitable example?

What is complexity of an algorithm? What is the basic relation between the time and space complexities of an algorithm? Justify your answer by giving an example.