1. Write down the order in which nodes are visited if Depth First Search (DFS) is called on the above graph with S as the source node.

2. Write down the order in which nodes are visited if Breadth First Search (BFS) is called on the above graph with S as the source node.

 

S O F A E 00