FindVertexIndependentPaths[g,s,t,k]
从图 g 的顶点 s 到顶点 t 找到至多 k 个与顶点无关的路径.
FindVertexIndependentPaths[{vw,…},…]
使用规则 vw 指定图 g.
FindVertexIndependentPaths
FindVertexIndependentPaths[g,s,t,k]
从图 g 的顶点 s 到顶点 t 找到至多 k 个与顶点无关的路径.
FindVertexIndependentPaths[{vw,…},…]
使用规则 vw 指定图 g.
更多信息
- 与顶点无关的路径也称作顶点不相交的路径.
- FindVertexIndependentPaths 返回从 s 到 t 的与顶点无关的路径列表.
- 每条路径都作为顶点的列表给出.
- FindVertexIndependentPaths 作用于无向图、有向图、多重图和混合图.
范例
打开所有单元 关闭所有单元基本范例 (1)
范围 (6)
FindVertexIndependentPaths 适用于无向图:
FindVertexIndependentPaths[[image], 1, 6, 2]FindVertexIndependentPaths[[image], 1, 6, 2]FindVertexIndependentPaths[[image], 1, 6, 2]FindVertexIndependentPaths[[image], 1, 6, 2]FindVertexIndependentPaths[{1 -> 2, 1 -> 5, 2 -> 3, 3 -> 4, 4 -> 5, 6 -> 3, 4 -> 6}, 1, 6, 2]FindVertexIndependentPaths 作用于大规模图:
g = GridGraph[{10, 10, 10, 10}];FindVertexIndependentPaths[g, 3, 10, 2]//Timing属性和关系 (2)
FindVertexIndependentPaths 只返回简单路径:
FindVertexIndependentPaths[[image], 1, 3, 3]VertexConnectivity 给出与顶点无关的路径的最大个数:
g = ExampleData[{"NetworkGraph", "ZacharyKarateClub"}];FindVertexIndependentPaths[g, 1, 32, Infinity]//LengthVertexConnectivity[g, 1, 32]相关指南
-
▪
- 路径、圈与流
文本
Wolfram Research (2014),FindVertexIndependentPaths,Wolfram 语言函数,https://reference.wolfram.com/language/ref/FindVertexIndependentPaths.html (更新于 2015 年).
CMS
Wolfram 语言. 2014. "FindVertexIndependentPaths." Wolfram 语言与系统参考资料中心. Wolfram Research. 最新版本 2015. https://reference.wolfram.com/language/ref/FindVertexIndependentPaths.html.
APA
Wolfram 语言. (2014). FindVertexIndependentPaths. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/ref/FindVertexIndependentPaths.html 年
BibTeX
@misc{reference.wolfram_2026_findvertexindependentpaths, author="Wolfram Research", title="{FindVertexIndependentPaths}", year="2015", howpublished="\url{https://reference.wolfram.com/language/ref/FindVertexIndependentPaths.html}", note=[Accessed: 14-November-2026]}
BibLaTeX
@online{reference.wolfram_2026_findvertexindependentpaths, organization={Wolfram Research}, title={FindVertexIndependentPaths}, year={2015}, url={https://reference.wolfram.com/language/ref/FindVertexIndependentPaths.html}, note=[Accessed: 14-November-2026]}