Define prim's algorithm in data structure
Answers
Answered by
1
heyyaa...!!!
In computer science, Prim's algorithm is a greedyalgorithm that finds a minimum spanning tree for a weighted undirected graph. ... However, running Prim's algorithm separately for each connected component of the graph, it can also be used to find the minimum spanning forest.
mark as brainliest if this answer helps you out !! :)
In computer science, Prim's algorithm is a greedyalgorithm that finds a minimum spanning tree for a weighted undirected graph. ... However, running Prim's algorithm separately for each connected component of the graph, it can also be used to find the minimum spanning forest.
mark as brainliest if this answer helps you out !! :)
Answered by
0
In computer science, Prim's algorithmis a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. ... However, runningPrim's algorithm separately for each connected component of the graph, it can also be used to find the minimum spanning forest.
Similar questions