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
There are four data type groups:  Integer kepts whole numbers and signed numbers Floating-point Stores real numbers (fractional values). Perfect for storing bank deposit

In this section, we will discuss about Sequential file organization. Sequential files have data records stored in a particular sequence. A sequentially organized file might be stor

In a chained hash table, each table entry is a pointer to a collection of elements. It can be any collection that supports insert, remove, and find, but is commonly a linked list.

What do you mean by hashing? Hashing gives the direct access of record from the file no matter where the record is in the file. This is possible with the help of a hashing func

Define Minimum Spanning Tree A minimum spanning tree of a weighted linked graph is its spanning tree of the smallest weight, where the weight of a tree is explained as the sum

Define tractable and intractable problems Problems that can be solved in polynomial time are known as tractable problems, problems that cannot be solved in polynomial time are

Suppose there are exactly five packet switches (Figure 4) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure 4). The tr

The complexity of searching an element from a set of n elements using Binary search algorithm is   O(log n)

how to convert 12 hour format into 24 hour format using c program

DEPTH FIRST SEARCH (DFS) The approach adopted into depth first search is to search deeper whenever possible. This algorithm frequently searches deeper through visiting unvisite