Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
  z( F. u& U0 P$ p7 G以下是lingo的代码
sets:
nodes/A,B,C,D,E,F,G,H,I,J,K,L/;
0 j0 w; Q/ \0 D% s2 B! Barcs(nodes,nodes)/
* A& O  ]' n1 cA,B A,E
B,C B,E B,F
  n4 h% c( I$ {2 c# ?C,B C,D
0 j* g6 `; S* o: M' n  rD,C D,H
. {: j( `( }3 ^  d$ }$ }4 HE,A E,F
F,B F,E F,G F,I F,J
) d6 A! |5 g* U2 x8 j+ h/ n4 QG,C G,F G,H G,K
. L8 L" S& J+ p9 `4 aH,D H,K H,L
5 X, _; |- P0 E9 k$ t+ QI,E I,J
J,F J,G
' I' M: Y1 r" L  W% `! F4 aK,G K,J
L,K
/: c, x;
endsets
data:
c=
5 O2 N, }* F7 X150 165
" \* ]4 J% U. Q  ]+ X/ z130 230 160
140 100
' Q5 F) V1 J* t3 p$ C1 S8 C$ [100 190
165 144
+ Q: P7 t% o+ \! C$ `! Z! K' ~8 z170 144 128 218 174
200 122 109 185
4 i9 r: r- r8 V% e. D180 141 190
194 148
174 233
0 v( H# L" L* \/ Z- u, q4 Z- a7 T185 135
110;
enddata
n = @size(nodes);
min = @sum(arcs: c * x);
/ e% I6 X. O, W) }- A@for(nodes(i):
@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
: V. W& x5 F8 E1 K( [+ }; w);
/ v6 H& r% b3 z) I% i@for(arcs: @bnd(1,x,9));
9 ]) i7 [' i9 O: k
# }, B* I: k2 K0 e- u它只能算出路径的步数和路程，并不能得到线路。希望能用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];

$ l, ]- \: T/ @& L- d& \

open[1000]

0 r+ }4 A8 d8 J! l$ M