7. Let G be an undirected graph whose vertices are the integers 1 through 8, and let the adjacent vertices of each vertex be given by the table below: Adjacent vertices (2, 3, 4) (1, 3, 4) (1, 2, 4) (1, 2, 3, 6) (6, 7, 8) (4, 5, 7) (5, 6, 8) (5, 7) Vertex 2 3 4 6 7 8. 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. a. Draw G. b. Give the sequence of vertices of G visited using a DFS traversal starting at vertex

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Answer only number 7

6. Draw the graph for the following adjacency matrix.
A B C D E F
| 1 1
1
A
B
--
--
--
--
--
C11
--
--
--
D
1
--
--
--
E
--
F
1
7. Let G be an undirected graph whose vertices are the integers 1 through 8, and let the
adjacent vertices of each vertex be given by the table below:
Adjacent vertices
(2, 3, 4)
(1, 3, 4)
(1, 2, 4)
(1, 2, 3, 6)
(6, 7, 8)
(4, 5, 7)
(5, 6, 8)
(5, 7)
Vertex
1
2
3
4
6
8
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.
a. Draw G.
b. Give the sequence of vertices of G visited using a DFS traversal starting at vertex
1.
c. Give the sequence of vertices visited using a BFS traversal starting at vertex 1.
Transcribed Image Text:6. Draw the graph for the following adjacency matrix. A B C D E F | 1 1 1 A B -- -- -- -- -- C11 -- -- -- D 1 -- -- -- E -- F 1 7. Let G be an undirected graph whose vertices are the integers 1 through 8, and let the adjacent vertices of each vertex be given by the table below: Adjacent vertices (2, 3, 4) (1, 3, 4) (1, 2, 4) (1, 2, 3, 6) (6, 7, 8) (4, 5, 7) (5, 6, 8) (5, 7) Vertex 1 2 3 4 6 8 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. a. Draw G. b. Give the sequence of vertices of G visited using a DFS traversal starting at vertex 1. c. Give the sequence of vertices visited using a BFS traversal starting at vertex 1.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 17 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY