The greedy approach is the foundation of the Prim's algorithm. We choose the edge with the least weight at each step, assuming that the final node hasn't been reached yet.
The spanning tree would appear like this. All the names are written in shorthand. Kindly corelate.
What is spanning tree?
A spanning tree is a sub-graph of an undirected connected graph that contains all of the graph's vertices and the fewest number of edges possible between them. It is not a spanning tree if a vertex is missed. Weights may or may not be applied to the edges.
What is minimum spanning tree?
A minimum spanning tree is one in which the weight of the edges added together is as small as it can be.
To know more about spanning tree, check out:
https://brainly.com/question/13148966
#SPJ1
