DFS mechanics. Run the strongly-connected components algorithm on this graph. Show the DFS forest, including discovery and finishing times, for both runs of the DFS algorithm. Draw the resulting component graph. As usual, when faced with a choice among vertices, pick the one that is alphabetically first. DFS mechanics. Run the strongly-connected components algorithm on this graph. Show the DFS forest, including discovery and finishing times, for both runs of the DFS algorithm. Draw the resulting component graph. As usual, when faced with a choice among vertices, pick the one that is alphabetically first