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

3.3.3

construct an adjacency matrix from a given graph or digraph and use the matrix to solve associated problems

4.3.1

identify practical examples that can be represented by trees and spanning trees

4.3.2

identify a minimum spanning tree in a weighted connected graph, either by inspection or by using Prim’s algorithm

4.3.3

use minimal spanning trees to solve minimal connector problems

What is Mathspace

About Mathspace