Consider the following directed graph, which is given in adjacency list form and
ID: 3692728 • Letter: C
Question
Consider the following directed graph, which is given in adjacency list form and where vertexes have numerical labels:
The first line indicates that the graph contains a directed edge from vertex 1 to vertex 2, from 1 to vertex 4, and 1 to 6, and likewise for subsequent lines.
A. List the nodes that have a degree of 3.
B. List the nodes in the order they're visited by depth-first search starting at vertex 3. When choosing successors, use the convention of increasing numerical order.
C. Show the corresponding breadth-first search spanning tree for the graph above starting at vertex 8. When choosing successors, use the convention of increasing numerical order. Draw your tree graphically
Explanation / Answer
A)nodes with degree 3 are : 5,7,9
B) 3, 7 , 9
C) 6,2,4,