Your Practice Set – Applications and Interpretation for IBDP Mathematics
It is given that x � 42 .
( c ) By using the algorithm , find the minimum spanning tree .
( d ) Write down the cost of the minimum spanning tree .
[ 3 ]
[ 1 ]
3 . Consider the following weighted graph :
Kruskal ’ s algorithm is used to find the minimum spanning tree for this graph .
( a ) |
Write down the adjacency matrix M of the graph . |
( b ) |
State the edge of the smallest weight . |
( c ) |
By using the algorithm , find the minimum spanning tree . |
( d ) |
Write down the weight of the minimum spanning tree . |
[ 2 ]
[ 1 ]
[ 3 ]
[ 1 ]
130
SE Production Limited