Consider this undirected graph with seven vertices and eight edges. 3 1 6 4 2 7...

Transcribed Image Text:

Consider this undirected graph with seven vertices and eight edges. 3 1 6 4 2 7 5 Write the adjacency list representation of this graph. For example, you could write (though it would not be correct): 1, [2, 3] 2, [3, 4] 3, [4, 5] 4, [5, 6] 5, [6, 7] 6, [7] 7, [] You do not need to explain your answer. Enter your answer here Same graph. 3 1 60 4 2 7 5 Suppose we traverse the graph starting at vertex 1 using a depth-first search (DFS). If there are multiple unvisited adjacent nodes, we always choose the node with the smallest label. In what order will DFS visit (that is, recurse on) the vertices in the graph? For example, you could write (though it would not be correct) 1, 2, 3, 4, 5, 6, 7. You do not need to explain your answer. Enter your answer here Same graph. 3 1 6 4 2 7 5 Suppose we traverse the graph starting at vertex 1 using a breadth-first search (BFS). If there are multiple unvisited adjacent nodes, we always enqueue those with the smallest labels first. In what order will BFS visit (that is, remove from the queue) the vertices in the graph? For example, you could write (though it would not be correct) 1, 2, 3, 4, 5, 6, 7. You do not need to explain your answer. Enter your answer here Consider this undirected graph with seven vertices and eight edges. 3 1 6 4 2 7 5 Write the adjacency list representation of this graph. For example, you could write (though it would not be correct): 1, [2, 3] 2, [3, 4] 3, [4, 5] 4, [5, 6] 5, [6, 7] 6, [7] 7, [] You do not need to explain your answer. Enter your answer here Same graph. 3 1 60 4 2 7 5 Suppose we traverse the graph starting at vertex 1 using a depth-first search (DFS). If there are multiple unvisited adjacent nodes, we always choose the node with the smallest label. In what order will DFS visit (that is, recurse on) the vertices in the graph? For example, you could write (though it would not be correct) 1, 2, 3, 4, 5, 6, 7. You do not need to explain your answer. Enter your answer here Same graph. 3 1 6 4 2 7 5 Suppose we traverse the graph starting at vertex 1 using a breadth-first search (BFS). If there are multiple unvisited adjacent nodes, we always enqueue those with the smallest labels first. In what order will BFS visit (that is, remove from the queue) the vertices in the graph? For example, you could write (though it would not be correct) 1, 2, 3, 4, 5, 6, 7. You do not need to explain your answer. Enter your answer here