Prajyotraikar
On this page, you find all documents, package deals, and flashcards offered by seller prajyotraikar.
- 2
- 0
- 0
Community
- Followers
- Following
2 items
Dsa notes
Prims Algorithm is an algorithm to find minimum spanning tree. It is a greedy apporach which means you are greedy for something good for a short term This approach is known as Greedy Approach. The cost of the spanning tree is a sum of the weights of all the edges in the tree. Minimum spanning tree that where minimum cost is involved is a tree with minimum cost involved Now we have a spanning tree which spans every node. The Cost of MST = 1+2+3 = 6 6 would be the cost minimum spanning tree here S...
- Class notes
- • 1 pages •
Prims Algorithm is an algorithm to find minimum spanning tree. It is a greedy apporach which means you are greedy for something good for a short term This approach is known as Greedy Approach. The cost of the spanning tree is a sum of the weights of all the edges in the tree. Minimum spanning tree that where minimum cost is involved is a tree with minimum cost involved Now we have a spanning tree which spans every node. The Cost of MST = 1+2+3 = 6 6 would be the cost minimum spanning tree here S...