Prim's algorithm
Interactive practice questions
The direct flight routes between $5$5 major cities of the same country are shown in the graph below. Each edge is marked with the distance (in km) travelled on each route.
To optimise the investment put into these routes, the operating airline wants to find the minimum spanning tree for the graph.
How many edges will be a part of a spanning tree for this graph?
Using Prim's algorithm or otherwise, find a minimum spanning tree for the graph.
Which of the following edges are part of this spanning tree? Select all that apply.
$DE$DE
$AB$AB
$BC$BC
$AE$AE
$BD$BD
$CE$CE
Select the diagram which represents the minimum spanning tree.
Using these flight routes, what is the minimum distance connecting these major cities?
At the university, there is a new plan to connect all the campus buildings using underground fiber optic cables. The network to the right was suggested by the engineer.
In a certain area, new underground cables need to be laid to connect electric substations. The graph to the right displays the current connection layout.