Let G be the graph below. The edges are labeled by integers. a L 1 10 20 8 b 2 1 с 12 13 3 If 18 g 17 19 7 d 14 15 h 16 4 e 5 6 l 1. List the edges of the spanning tree of G obtained by the breadth-first search with the vertex ordering a, b, c,..., l. (The answer should be a list of integers (edge labels). The order in the list does not matter.) 2. List the edges of the spanning tree of G obtained by the depth-first search with the vertex ordering a, b, c,..., l.
Let G be the graph below. The edges are labeled by integers. a L 1 10 20 8 b 2 1 с 12 13 3 If 18 g 17 19 7 d 14 15 h 16 4 e 5 6 l 1. List the edges of the spanning tree of G obtained by the breadth-first search with the vertex ordering a, b, c,..., l. (The answer should be a list of integers (edge labels). The order in the list does not matter.) 2. List the edges of the spanning tree of G obtained by the depth-first search with the vertex ordering a, b, c,..., l.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Transcribed Image Text:Let G be the graph below. The edges are labeled by integers.
a
1
10
b
8
=
/20 19
2
J
C
12 13
If 18 g 17
3
7
d
14 15
h
16
k
4
6
e
UT
l
1. List the edges of the spanning tree of G obtained by the breadth-first search with the vertex ordering a, b, c, . . . , l. (The answer should be a list
of integers (edge labels). The order in the list does not matter.)
2. List the edges of the spanning tree of G obtained by the depth-first search with the vertex ordering a, b, c, ..., l.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step 1: First we create the empty queues and visited array .
VIEWStep 2: The adjacent nodes of the starting node will be pushed into the queue.
VIEWStep 3: We do the save process until the nodes from the graphs is visited.
VIEWStep 4: We reached at the final visited array.
VIEWStep 5: We create the empty queues and visited array.
VIEWStep 6: Stack is used to mark the unvisited nodes .we repeat the process until all the element is visited.
VIEWSolution
VIEW
Step by step
Solved in 7 steps with 6 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
