Minimal Spanning Trees (HSC SSCE Mathematics Standard): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
How many edges does a tree with vertices have?
How many edges does a tree with vertices have?
edges
What is a tree in graph theory?
What is a tree in graph theory?
A connected graph with no cycles
What is a spanning tree?
What is a spanning tree?
A tree connecting all vertices
What is a minimum spanning tree?
What is a minimum spanning tree?
A spanning tree of minimum length
A graph has vertices. How many edges will its spanning tree have?
A graph has vertices. How many edges will its spanning tree have?
edges
In Prim's algorithm, what is the first step?
In Prim's algorithm, what is the first step?
Choose any starting vertex
In Prim's algorithm, which edge should be selected at each step?
In Prim's algorithm, which edge should be selected at each step?
Lowest weight edge, avoiding cycles
A spanning tree has edges with weights , , , and . What is its total length?
A spanning tree has edges with weights , , , and . What is its total length?
units
Which property means a graph is NOT a tree?
Which property means a graph is NOT a tree?
It contains a cycle
When using Prim's algorithm, why do we ignore some edges?
When using Prim's algorithm, why do we ignore some edges?
They would create a cycle