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. 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 below. Vertex Adjacent vertices 1 2 3 4 5 6 7 8 (2,3,4) (1,3,4) (1,2,4) (1,2,3,6) (6,7,8) (4,5,7) (5,6,8) (5,7) a) Draw Gb) Order the vertices as they are visited in a DFS traversal starting at vertex 1. c) Order the vertices as they are visited in a BFS traversal starting at vertex 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. Assume that, in a traversal of G, the adjacent vertices of a given...

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.

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 below.

Vertex	Adjacent vertices
1 2 3 4 5 6 7 8	(2,3,4) (1,3,4) (1,2,4) (1,2,3,6) (6,7,8) (4,5,7) (5,6,8) (5,7)

a) Draw G
b) Order the vertices as they are visited in a DFS traversal starting at vertex 1.

c) Order the vertices as they are visited in a BFS traversal starting at vertex 1.

Jun 07, 2022