Combinatorica`
Combinatorica`

MinimumSpanningTree

バージョン10で，Combinatorica パッケージの機能のほとんどがWolframシステムに組み込まれた． »

MinimumSpanningTree[g]

クラスカル(Kruskal)のアルゴリズムを用いて，グラフ g の最小全域木を見付ける．

詳細とオプション

例題

例  (2)

MinimumSpanningTreeの代りにFindSpanningTreeが使われるようになった：

Wolfram Research (2012), MinimumSpanningTree, Wolfram言語関数， https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html.

テキスト

Wolfram Research (2012), MinimumSpanningTree, Wolfram言語関数， https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html.

CMS

Wolfram Language. 2012. "MinimumSpanningTree." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html.

APA

Wolfram Language. (2012). MinimumSpanningTree. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html

BibTeX

@misc{reference.wolfram_2024_minimumspanningtree, author="Wolfram Research", title="{MinimumSpanningTree}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html}", note=[Accessed: 17-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_minimumspanningtree, organization={Wolfram Research}, title={MinimumSpanningTree}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/MinimumSpanningTree.html}, note=[Accessed: 17-November-2024 ]}