13 . The following weight adjacency matrix shows the information of a graph with five vertices A , B , C , D and E :
A B C D E A - 30 20 10 32 B 30 - 25 28 22 C 20 25 - 26 36 D 10 28 26 - 24 E 32 22 36 24 -
Prim ’ s algorithm , starting at E , is used to find the minimum spanning tree for this graph .
( a ) State the edge of the greatest weight .
( b ) By using the algorithm , find the minimum spanning tree .
( c ) Write down the weight of the minimum spanning tree .
[ 1 ]
[ 3 ]
[ 1 ]
© SE Production Limited 21 All Rights Reserved 2021