Скачать или смотреть Graph - 19: Prim's Algo | Minimum Spanning Tree in weighted Graph (Min Distance to cover all nodes)

Source Code: https://thecodingsimplified.com/minim...
Solution:
We'll solve it using Priority Queue (Min Heap)
as it's weighted graph, so we'll create graph in Adjcency list, where list will contain all neighbours
Each entry in list will be Edge (index, distance from index)
We'll take Priority queue & boolean array
Mark source as true in visited array
We'll all edges from it in minHeap
Now we'll poll top element from heap & mark this value as visited
We'll update the minDistance
At last return the minDistance

Time Complexity: O(Elog(E))
Space Complexity: O(E)

CHECK OUT CODING SIMPLIFIED
   / codingsimplified  

★☆★ VIEW THE BLOG POST: ★☆★
http://thecodingsimplified.com

I started my YouTube channel, Coding Simplified, during Dec of 2015.
Since then, I've published over 400+ videos.

★☆★ SUBSCRIBE TO ME ON YOUTUBE: ★☆★
https://www.youtube.com/codingsimplif...

★☆★ Send us mail at: ★☆★
Email: [email protected]