Question

Consider the following directed graph, which is given in adjacency list form and where vertexes have numerical labels: 1: 2, 4, 6 2: 4, 5 3: 1, 2, 6, 9 4: 5 5: 4, 7 6: 1, 5, 7 7: 3, 5 8: 2, 6, 7 9: 1, 7 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. List the nodes that have a degree of 3. List the nodes in the order they're visited by depth-first search starting at vertex 3. When choosing successors, use the 367 convention of increasing numerical order. Show the corresponding breadth-first search spanning tree for the graph above starting at vertex 8. When choosing successors, use the 367 convention of increasing numerical order. Draw your tree either graphically or in the same manner using characters as done in prior assignments. Verify that your trees in the pdf file looks okay before submitting. Consider the following directed graph, which is given in adjacency list form as described above and where vertexes have numerical labels: 1: 9 2: 3, 5 3: 7, 9 4: 2, 4, 6 5: 6: 5 7: 5 8: 2, 3, 4 9: 7 Show the topological ordering for the graph above using the iterative method covered in lecture (rather than the recursive method in the readings). Use the 367 convention of choosing vertexes in increasing numerical order.