21.1.6. Example of DFS Pre and Post Numbers

Try these first

1. 1.

   What does DFS stand for?

   Hint

   Think about how the algorithm processes nodes—deeply.

2. 2.

   What data structure does DFS commonly use?

   Hint

   Remember the acronym for keeping track of elements last added.

3. 3.

   What is the primary method of exploration used in DFS?

   • Level Order
   • Depth First
   • Breadth First

   Hint

   Recall the acronym when considering the strategy employed.

4. 4.

   True or False: DFS guarantees the shortest path between two vertices.

   • True
   • False

   Hint

   Remember how the algorithm focuses on depth over breadth.

5. 5.

   Given a graph with vertices and edges, implement DFS and identify the pre and post numbers for each vertex. How do these numbers help in identifying cycles?

   Hint

   Look for revisits in your traversal log.

6. 6.

   Consider a scenario where you have to analyze a social network graph for strong connectivity. Use DFS with pre and post numbers to determine critical nodes whose removal would disconnect the network.

   Hint

   Check which nodes are revisited and how their removal affects connectivity in your DFS traversal.