Explore BrainMass

Explore BrainMass

    Doing a depth first search (DFS) on a directed graph

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    See attached file for full problem description. Answer #13e.

    © BrainMass Inc. brainmass.com October 9, 2019, 8:00 pm ad1c9bdddf


    Solution Preview

    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 ...

    Solution Summary

    This solution walks through a depth first search (DFS) on a directed graph.