21.1. Design and Analysis of Algorithms

Try these first

1. 1.

   What does DFS stand for?

   Hint

   Think about how it explores graphs.

2. 2.

   What is the primary strategy of DFS?

   Hint

   Consider how it contrasts with BFS.

3. 3.

   What does DFS explore first?

   • All nodes at the same level
   • The deepest node available
   • The shortest path

   Hint

   Remember the keyword 'Depth'.

4. 4.

   True or False: DFS guarantees the shortest path in a graph.

   • True
   • False

   Hint

   Think about how the two strategies differ.

5. 5.

   Given a directed graph, how would you modify DFS to count the number of strongly connected components?

   Hint

   Think about how connections are established backwards.

6. 6.

   Implement a DFS algorithm that returns the path taken from the starting vertex to a target vertex.

   Hint

   How would you track the path taken during recursion?