Q4 Back to the classics 0.3 Points Recall: before learning shortest paths and MST finding, we learned about how to take

[answerhappygod]

Q4 Back To The Classics 0 3 Points Recall Before Learning Shortest Paths And Mst Finding We Learned About How To Take 1 (101.99 KiB) Viewed 27 times

Q4 Back to the classics 0.3 Points Recall: before learning shortest paths and MST finding, we learned about how to take our tree traversals and apply them to general graphs. BFS and DFS are two methods of traversing graphs that do not consider edge weights. Answer the three questions below about the following graph. D E А. G С B וד F If there is a tie in which vertex to visit next, break ties in alphabetical order. Q4.1 BFS 0.1 Points Suppose we run BFS from A. What is the order that vertices are visited? Format your answer as a space separated list, e.g. ABCDEFG. Enter your answer here Save Answer Q4.2 0.1 Points What is the DFS preordering of the vertices? Format your answer as a space separated list, e.g. ABCDEFG. Enter your answer here Save Answer Q4.3 0.1 Points What is the DFS postordering of the vertices? Format your answer as a space separated list, e.g. ABCDEFG. Enter your answer here Save Answer