Consider the following graph. Design a Depth First Search Algorithm and show that your pre-order graph traversal is matched with your stack order. (Don't need to write pseudo code. Show how to push and pop elements to/from the stack and draw your DFS, then compare it with pre-order traversal.) Explain how one can identify connected components of a graph by using depth-first search.
Design a Breadth First Search Algorithm and show that your level-order graph traversal is matched with your queue. (Don't need to write pseudo code. Show how to insert elements to the queue and draw your BFS, then compare it with level-order traversal.) Explain how one can check a graph's acyclicity by using breadth-first search.