Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
3 @6 `& ~2 l) f$ O- V以下是lingo的代码
; `) ^) V7 d5 [( a0 Tsets:
nodes/A,B,C,D,E,F,G,H,I,J,K,L/;
arcs(nodes,nodes)/
A,B A,E
B,C B,E B,F
C,B C,D
D,C D,H
E,A E,F
F,B F,E F,G F,I F,J
2 v# y. A( ?% k" w7 i5 tG,C G,F G,H G,K
H,D H,K H,L
; Z1 j, y) I: O* i# z2 K) O' I8 RI,E I,J
8 U/ |% t# w9 WJ,F J,G
% O9 Z0 l; y* ~K,G K,J
# Q9 F9 @4 ^% e2 N; ~# yL,K
/: c, x;
7 _9 k0 D, g# ?8 d3 s; v- _6 kendsets
4 }5 p$ N2 Q* Z2 r; T8 H1 idata:
7 a- v( a: V6 \. O5 o* u  Fc=
# W4 z/ R3 m$ ]1 b: q6 e150 165
/ b$ K& F" a; J9 R( O130 230 160
4 i4 E! s5 D% l+ d140 100
100 190
/ T0 v9 m' e! W165 144
) @2 z4 n& L" S5 a% J. C" O170 144 128 218 174
% ?: J9 D8 e' |200 122 109 185
180 141 190
( M. Q8 A5 z7 g/ A194 148
0 G( o, A/ r' R) ]% e: L5 q, F174 233
. [( a  m! _- p9 E* @185 135
110;
6 |* u0 V8 d/ jenddata
n = @size(nodes);
min = @sum(arcs: c * x);
# l7 M3 ]5 |9 t4 {@for(nodes(i):
( a7 x4 G8 z  M  U5 q@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
8 ^( n% E2 @8 z);
1 N* i0 u  x* L) Z. ?& E@for(arcs: @bnd(1,x,9));

它只能算出路径的步数和路程，并不能得到线路。希望能用mma解决这个问题。

---------------------------------------------------------------------

自己用mma写的程序对于四点还可以，但是扩展到12点实在繁琐：

P11 = {2, 5}; P12 = {150, 165};

P21 = {5, 6}; P22 = {230, 160};

P51 = {1, 6}; P52 = {165, 144};

P61 = {2, 5}; P62 = {170, 144};(*只考虑1、2、5、6四点，P11为第一点“可去往的点”，P12表述对应的路程*)

open[q_] :=

Module[{i = 1, randomD, randomP, D, randomreal, p1, p2, p5, p6, c, u,

Df = 80000, uf, path = {1}, pathf = {1}, pb},(*随机搜索*)

For[r = 0, r < q, r++,

{p1 = {}; p2 = {}; p5 = {}; p6 = {}; u = 0; D = 0; i = 1;

randomP = P11; randomD = P12;

While[

Length[p1] != 2 || Length[p2] != 2 || Length[p5] != 2 ||

Length[p6] != 2 || i != 1,

randomreal = RandomInteger[{1, Length[randomP]}];

c = randomP[[randomreal]]; AppendTo[path, c];(*Print[path];*)

Which[

i == 1 &&

Product[If[p1[] != c, 1, 0], {i, 1, Length[p1]}] ==

1, {AppendTo[p1, c]},

i == 2 &&

Product[If[p2[] != c, 1, 0], {i, 1, Length[p2]}] ==

1, {AppendTo[p2, c]},

i == 5 &&

Product[If[p5[] != c, 1, 0], {i, 1, Length[p5]}] ==

1, {AppendTo[p5, c]},

i == 6 &&

Product[If[p6[] != c, 1, 0], {i, 1, Length[p6]}] ==

1, {AppendTo[p6, c]}];

i = c;

D = D + randomD[[randomreal]];

Which[i == 1, {randomP = P11, randomD = P12},

i == 2, {randomP = P21, randomD = P22},

i == 5, {randomP = P51, randomD = P52},

i == 6, {randomP = P61, randomD = P62}];

u = u + 1; If[u > 11, Break[]];

If[Df > D, {Df = D, uf = u, pathf = path, path = {1}},

path = {1}];

}

];

Print[Df, ",", uf, ",", pathf];

# I2 U* h) `4 O

open[1000]

7 a/ M1 S3 |) K2 B: F3 Y7 V( W