1. Describe the difference between depth-first searching and breadth-first searching in a tree, then describe the difference between depth-first and breadth-first searching in a general graph.
2. What are the differences between using stacks and using queues to hold unvisited vertices that need to be visited in the future during graph searching?
Hi there! Click one of our representatives below and we will get back to you as soon as possible.