TravelingSalesman[g]
グラフ
における最適な巡回セールスマン経路を見付ける.
TravelingSalesman
TravelingSalesman[g]
グラフ
における最適な巡回セールスマン経路を見付ける.
詳細とオプション
- TravelingSalesmanを使うためには,まず Combinatorica パッケージをロードしなくてはならない.それにはNeeds["Combinatorica`"]を実行する必要がある.
テクニカルノート
テキスト
Wolfram Research (2012), TravelingSalesman, Wolfram言語関数, https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesman.html.
CMS
Wolfram Language. 2012. "TravelingSalesman." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesman.html.
APA
Wolfram Language. (2012). TravelingSalesman. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesman.html
BibTeX
@misc{reference.wolfram_2025_travelingsalesman, author="Wolfram Research", title="{TravelingSalesman}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesman.html}", note=[Accessed: 30-April-2026]}
BibLaTeX
@online{reference.wolfram_2025_travelingsalesman, organization={Wolfram Research}, title={TravelingSalesman}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesman.html}, note=[Accessed: 30-April-2026]}