Question
1.Let G be a graph whose vertices are the integers 1 through 8, and let the adjacent vertices of each vertex be given by the
1.Let G be a graph whose vertices are the integers 1 through 8, and let the adjacent vertices of each vertex be given by the table below.
vertex | adjacent vertices |
1 | (2,3,4) |
2 | (1,3,4) |
3 | (1,2,4) |
4 | (1,2,3,6) |
5 | (6,7,8) |
6 | (4,5,7) |
7 | (5,6,8) |
8 | (5,7) |
Assume that, in a traversal of G, the adjacent vertices of a given vertex are returned in the same order as they are listed in the table above. You need to:
A.Draw graph G.
B.Give the sequence of the vertices of G visited using the depth-first search traversal starting at vertex 1.
C.Give the sequence of vertices visited using the breadth-first search traversal starting at vertex 1.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started