Question: Problem 2: Graph Traversal. (1) Consider the following given graph. Get the order of vising nodes in breadth first search (BFS), starting with node 3.
Problem 2: Graph Traversal. (1) Consider the following given graph. Get the order of vising nodes in breadth first search (BFS), starting with node 3. (7pts)

6 Vertices visited in order 3 Vertices visited in order 2 (2) Consider the above graph. Get the order of vising nodes in depth first search (DFS), starting with node 2. (7pts)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
