DominatorTreeGraph
DominatorTreeGraph[g,r]
从根顶点 r 出发,给出有向图 g 的支配树.
更多信息和选项
- DominatorTreeGraph 亦称为最近支配树.
- 通常用于分析和检测流图中的依赖关系.
- DominatorTreeGraph[g,v] 给出一棵树, 含有从顶点 u 到它直接支配的顶点x w 的有向边. 从 v 到 w 的每个路径都经过 u.
- DominatorTreeGraph 接受与 TreeGraph相同的选项.
所有选项的列表
范例
打开所有单元 关闭所有单元相关指南
-
▪
- 图的操作与修改
文本
Wolfram Research (2021),DominatorTreeGraph,Wolfram 语言函数,https://reference.wolfram.com/language/ref/DominatorTreeGraph.html.
CMS
Wolfram 语言. 2021. "DominatorTreeGraph." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/ref/DominatorTreeGraph.html.
APA
Wolfram 语言. (2021). DominatorTreeGraph. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/ref/DominatorTreeGraph.html 年
BibTeX
@misc{reference.wolfram_2025_dominatortreegraph, author="Wolfram Research", title="{DominatorTreeGraph}", year="2021", howpublished="\url{https://reference.wolfram.com/language/ref/DominatorTreeGraph.html}", note=[Accessed: 15-April-2026]}
BibLaTeX
@online{reference.wolfram_2025_dominatortreegraph, organization={Wolfram Research}, title={DominatorTreeGraph}, year={2021}, url={https://reference.wolfram.com/language/ref/DominatorTreeGraph.html}, note=[Accessed: 15-April-2026]}