mst_tsp3.txt

来自「collective processing environment for mo」· 文本 代码 · 共 16 行

TXT
16
字号
************************************************
* Solutions By Minimum Spanning Tree Algorithm *
************************************************

Number of cities...: 3

Distances between cities...:
Istanbul - Adana ...: 707.7584902888083
Istanbul - Afyon ...: 287.4463162827713
Adana - Afyon ...: 461.113150069221

Shortest tour is...:
Istanbul - Afyon - Adana - Istanbul
Minimum distance is...: 1456.3179566407807
Time elapsed...: 0.0 seconds

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?