What is spanning tree in prims algorithm?
Answers
Answered by
8
hyyy....
⭐Prim's algorithmis a greedy algorithm that finds a minimum● spanning tree for a weighted undirected graph.
☆This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
___
hope it helps!!✔✔✔
⭐Prim's algorithmis a greedy algorithm that finds a minimum● spanning tree for a weighted undirected graph.
☆This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
___
hope it helps!!✔✔✔
Answered by
0
Answer:
The idea behind Prim's algorithm is simple, a spanning tree means all vertices must be connected. So the two disjoint subsets (discussed above) of vertices must be connected to make a Spanning Tree. And they must be connected with the minimum weight edge to make it a Minimum Spanning Tree.
Similar questions