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.
更多信息和选项
- 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`"].
范例
基本范例 (2)
DepthFirstTraversal has been superseded by DepthFirstScan:
文本
Wolfram Research (2012)，DepthFirstTraversal，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/DepthFirstTraversal.html.
CMS
Wolfram 语言. 2012. "DepthFirstTraversal." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/DepthFirstTraversal.html.
APA
Wolfram 语言. (2012). DepthFirstTraversal. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/DepthFirstTraversal.html 年