Question

prims algorithm for minimum spanning tree with an example​

Answer 1

Answer:

Construct a minimum spanning tree of the graph given in the following figure by using prim's algorithm. o Step 1 : Choose a starting vertex B. o Step 2: Add the vertices that are adjacent to A. ... The graph produces in the step 4 is the minimum spanning tree of the graph shown in the above figure.

Answer 2

Answer:

HI

Explanation:

Example : Construct a minimum spanning tree of the graph given in the following figure by using prim's algorithm. o Step 1 : Choose a starting vertex B. o Step 2: Add the vertices that are adjacent to A. ... The graph produces in the step 4 is the minimum spanning tree of the graph shown in the above figure.

MARK THE QUESTION AS BRAINLIEST