Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Prim's algorithm

An extra step

Report a typo

What step is not included to the Prim's algorithm?

Select one option from the list

Choosing any arbitrary node as a root node and growing the tree by one edge.

Initialization of a tree with a starting node.

Removing all loops and parallel edges.

Checking outgoing edges and selecting the one with the least cost.

___

Create a free account to access the full topic