Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
以下是lingo的代码
7 O* X. T& X1 o  E: ?sets:
. L8 Z: Y4 f3 Pnodes/A,B,C,D,E,F,G,H,I,J,K,L/;
1 E3 T' e2 N" aarcs(nodes,nodes)/
& _8 f$ l; I) ?+ m+ o$ AA,B A,E
) A. b% `% u. C9 K9 s0 `9 _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
G,C G,F G,H G,K
$ l- `  m6 ?6 |6 d8 w5 EH,D H,K H,L
I,E I,J
J,F J,G
( |! O5 [1 V6 c- l( b8 S5 ^K,G K,J
L,K
) t6 x/ A* y( o/ M6 Q" S& v: W/: c, x;
endsets
data:
* N6 Z5 }  Q/ j# p6 lc=
150 165
; G" Y" k6 w" c130 230 160
5 b1 p- Y) _- e' \3 d140 100
) s7 p. I  k  Z0 V$ o3 Z  `100 190
165 144
; u" ?: W6 Z  ^7 w" [170 144 128 218 174
200 122 109 185
180 141 190
, M6 R% C" ?  W0 E" M194 148
174 233
) O1 t* S0 _: p# Y185 135
110;
enddata
n = @size(nodes);
5 o4 @0 j% O' ]7 O3 t3 imin = @sum(arcs: c * x);
@for(nodes(i):
@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
5 l6 J0 g" @/ Q' r/ o; Z) O);
@for(arcs: @bnd(1,x,9));

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

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

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

: j5 A# s# c5 {0 l! ^/ j0 _* J) r

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];

open[1000]

4 ^4 A+ w7 w& X! c) h  r& `8 u1 J; U