Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Prim's algorithm

Theory

Telephone network between cities

Report a typo

Given below is an undirected weighted graph with nodes representing cities and edges corresponding to telephone links between two cities:

Undirected weighted graph

Your task is to find a set of edges of the minimum cost that connect all the cities to one telephone network. Use Prim's algorithm to build such a network. Start with the node A. Choose one of the options below that corresponds to the weight of the found network.

Select one option from the list
___

Create a free account to access the full topic