Given the adjancency matrix of a graph A-draw the depthfirst spanning tree. B-draw the breadth first spanning tree. 1 2 3 4 5 6 1 2 0 0 1 0 0 0 1 3 4 5 6 7 8 9 10 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 7 8 9 10 1 0 10 000001 0 0 0 0 0 1 0 0 0 100 0 0 0 отооогоооо 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 1 0 0 0 010 0 0 0 1 1 тоотогоооо
Given the adjancency matrix of a graph A-draw the depthfirst spanning tree. B-draw the breadth first spanning tree. 1 2 3 4 5 6 1 2 0 0 1 0 0 0 1 3 4 5 6 7 8 9 10 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 7 8 9 10 1 0 10 000001 0 0 0 0 0 1 0 0 0 100 0 0 0 отооогоооо 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 1 0 0 0 010 0 0 0 1 1 тоотогоооо
Related questions
Question
draw in a paper
Transcribed Image Text:Given the adjancency matrix of a graph
A - draw the depthfirst spanning tree.
B-draw the breadth first spanning tree.
1
2
3
4
5
6
7
8
1
6
0
0
2 3 4 5 6
0
0
0
Ο Ο
1 0 0
0
0
0001
ο ο ο ο ο
0
0
0 0 0 1 0 0
ο
1 1 ο ο ο
ο ο 1 ο ο ο
1
0 0 1 0
0
0
0001
10 1
0 0 0 0 1
0
1
0
7 8 9 10
10
1 0
1 0 0 0
0 1
Ο Ο
0
ο
0
1
0 0
10
0
1
0
ο ο ο
0
ο ο ο 1
0 0 1 0
001
0 0 0 0
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
