DepthFirstTraversal
DepthFirstTraversal[g,v]
performs a depth-first traversal of graph g starting from vertex v, and gives a list of vertices in the order in which they were encountered.
DepthFirstTraversal[g,v,Edge]
returns the edges of the graph that are traversed by the depth-first traversal in the order in which they are traversed.
DepthFirstTraversal[g,v,Tree]
returns the depth-first tree of the graph.
Details and Options
- DepthFirstTraversal functionality is now available in the built-in Wolfram Language function DepthFirstScan.
- To use DepthFirstTraversal, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Examples
Basic Examples (2)
DepthFirstTraversal has been superseded by DepthFirstScan:
Text
Wolfram Research (2012), DepthFirstTraversal, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/DepthFirstTraversal.html.
CMS
Wolfram Language. 2012. "DepthFirstTraversal." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/DepthFirstTraversal.html.
APA
Wolfram Language. (2012). DepthFirstTraversal. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/DepthFirstTraversal.html