In the ________ traversal we process all of a vertex's descendants before we move to an adjacent vertex.
The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.
64.3k questions
77.9k answers
244k comments
80.0k users