Sec 7.10 1. Create a spanning tree using the breadth

Sec 7.10
10 – Minimum Spanning Trees
Networks & Graphs
1. Create a spanning tree using the
breadth-first
first search algorithm. Start at
A (i.e. 0) and label each vertex with
the correct number after A and show
your path.
Name:
C
B
A
H
E
G
I
How many edges were used to create
a spanning tree?
F
J
C
2. Create a spanning tree using the
breadth-first
first search algorithm. Start at
G (i.e. 0) and label each vertex with
the correct number after A and show
your path.
D
D
B
A
H
E
G
I
F
How many edges were used too create
a spanning tree?
3. Create a spanning tree using the
breadth-first
first search algorithm. Start at
J (i.e. 0) and label each vertex with
the correct number after J and show
your path.
J
C
D
B
A
H
E
G
I
How many edges were used to create
a spanning tree?
Student Worksheets Created by Matthew M. Winking at Phoenix High School
F
J
SECTION 7-10
p.104
4. Create a spanning tree using the
breadth-first search algorithm. Start at
A (i.e. 0) and label each vertex with
the correct number after A and show
your path.
A
G
H
B
I
C
E
D
J
5. The minimum cost spanning tree found using
Kruskal’s algorithm for the following graph has
a cost of____.
6. Create a minimum spanning tree
using the Kruskal’s algorithm. What
is the total minimum length of the
spanning tree?
Student Worksheets Created by Matthew M. Winking at Phoenix High School
SECTION 7-10
p.105

Download Report