See attached file for full problem description. Answer #13e.© BrainMass Inc. brainmass.com October 9, 2019, 8:00 pm ad1c9bdddf
Remember that with a depth first search (dfs) the main principle is to
visit all the children nodes of a node before visiting that node
itself. The instructions ask us to generate the list of nodes visited
in a DFS order on the graph A. We start at node B. Node B has only
one child, C, so we go to that child ...
This solution walks through a depth first search (DFS) on a directed graph.