topic badge

7.015 Prim's algorithm

Interactive practice questions

Create a distance table for the weighted network shown.

If there is no edge connecting two particular vertices, represent this with an $X$X.

 

  $A$A $B$B $C$C
$A$A $X$X $\editable{}$ $\editable{}$
$B$B $\editable{}$ $X$X $\editable{}$
$C$C $\editable{}$ $\editable{}$ $X$X
Easy
< 1min

Complete the distance table for the weighted network shown.

Easy
2min

Complete the distance table for the weighted network shown.

Easy
2min

The distance table for a weighted network is shown below. Complete the network by labelling the vertices.

Easy
< 1min
Sign up to access Practice Questions
Get full access to our content with a Mathspace account

Outcomes

4.3.1.1

understand the meaning of the terms tree and spanning tree

4.3.1.2

identify practical examples

4.3.1.3

identify a minimum spanning tree in a weighted connected graph, e.g. using Prim’s algorithm

4.3.1.4

use minimal spanning trees to solve minimal connector problems, e.g. minimising the length of cable needed to provide power from a single power station to substations in several towns

What is Mathspace

About Mathspace