Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Prim's algorithm

Theory

Find the min cost spanning tree

Report a typo

Given below is an undirected weighted graph:

Undirected weighted graph

Using Prim's algorithm, build a minimum spanning tree starting with the node A. Which of the trees below corresponds to the MST?

Select one option from the list
___

Create a free account to access the full topic