Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
以下是lingo的代码
! o+ L' w; ~# Y- ~! @0 {" @sets:
) f/ G+ Y$ d$ s; onodes/A,B,C,D,E,F,G,H,I,J,K,L/;
4 v7 {1 ^7 Q/ B3 Z( A  Marcs(nodes,nodes)/
A,B A,E
B,C B,E B,F
+ m) u  d6 H. L1 J8 H$ \; t0 nC,B C,D
' K8 S3 D  A1 k" SD,C D,H
/ _% L8 }* m& d' W5 JE,A E,F
- j2 b* L9 q! e' K6 gF,B F,E F,G F,I F,J
G,C G,F G,H G,K
H,D H,K H,L
I,E I,J
0 Q* r9 q3 Q7 C3 X; C4 L& FJ,F J,G
K,G K,J
L,K
/: c, x;
endsets
data:
% e" H( P$ c7 ?6 I0 U# O* M9 t* f% Sc=
* _" z6 w8 F+ e* S5 v5 y150 165
* J/ o5 p# [) B* f2 ?130 230 160
140 100
100 190
165 144
170 144 128 218 174
/ s4 \2 M$ z8 S( `, U( I* ~200 122 109 185
% o- o: B$ `- r- x! g' Z& X180 141 190
194 148
174 233
185 135
110;
enddata
4 e! f& B7 H/ ln = @size(nodes);
) g3 |. v; M2 G9 e- r( ?8 c" imin = @sum(arcs: c * x);
0 `# g) B* I. h, l: b, f4 v& y: j% ]@for(nodes(i):
@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
);
@for(arcs: @bnd(1,x,9));
2 y2 k- ^5 q9 M2 j, p# M; O
" ^, B/ ~- [, k) ^' [5 \" E它只能算出路径的步数和路程，并不能得到线路。希望能用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];

open[1000]

9 t: Z/ c0 Z8 M( u( p& o1 e