3.3 Applying Prim's algorithm to a distance matrix (DECISION 1 - Chapter 3: Algorithms on graphs)

#hindsmaths How to apply Prim's algorithm to a distance matrix

0:00 Intro
2:42 Example 4
6:13 Example 5
16:51 End/Recap

[JamieCroll]

In example 4 it says ''find a minimum spanning tree''. Does this want me to draw a MST or can I just list the order of the arcs added to the MST and find the weight of the MST? What have I got to do to get the marks (what can I leave out of my answer e.g not having to draw it, not having to find the weight of it etc.)

[kalanbhakta]

Thanks for that really helped me out 👍🏽

[probably]

in an n^2 matrix, the kth row and kth columns cell will always be blank, would this affect the number of comparisons for the answer of 5 b?

[grrizi]

If we get a question asking for the number of comparisons like Ex 5 a) can we just use the derived equation for nxn distance matrix or do we have to show working like the way you solved it in question Ex 5a)

[ProletarianNuklearWarrior]

How likely are we to get these n*n comparisons questions? any easy way to remember this 😭😭😭😭