Minimum Spanning Trees and Prim’s Algorithm (AQA A-Level Further Maths): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
How many edges are in an MST for a network with vertices?
How many edges are in an MST for a network with vertices?
Why is Prim's algorithm better than Kruskal's for matrices?
Why is Prim's algorithm better than Kruskal's for matrices?
Avoids cycle-checking complexity
What type of algorithm is Prim's algorithm?
What type of algorithm is Prim's algorithm?
Greedy algorithm
Which vertex should you start from when using Prim's algorithm?
Which vertex should you start from when using Prim's algorithm?
Any vertex
How does Prim's algorithm avoid forming cycles?
How does Prim's algorithm avoid forming cycles?
Connects only to unconnected vertices
In the matrix method, what do you do with the row of a chosen vertex?
In the matrix method, what do you do with the row of a chosen vertex?
Cross it out
If two arcs have equal minimum weights in Prim's, what should you do?
If two arcs have equal minimum weights in Prim's, what should you do?
Choose one at random
How does Prim's growth pattern differ from Kruskal's?
How does Prim's growth pattern differ from Kruskal's?
Grows one connected tree
Do Prim's and Kruskal's always produce MSTs with the same total weight?
Do Prim's and Kruskal's always produce MSTs with the same total weight?
Yes, same minimum weight
In matrix method, where do you find the minimum to select the next vertex?
In matrix method, where do you find the minimum to select the next vertex?
In numbered columns only