Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
7 y( G3 i2 _- P; x. R* n以下是lingo的代码
sets:
( w* U0 P" a0 A$ Inodes/A,B,C,D,E,F,G,H,I,J,K,L/;
arcs(nodes,nodes)/
& R, Q" l& K7 P. c" }+ Y5 X$ qA,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
G,C G,F G,H G,K
H,D H,K H,L
I,E I,J
0 D- i; C5 _, ~3 F1 _( g. Z# eJ,F J,G
K,G K,J
L,K
/: c, x;
endsets
, b4 A  p. E. e) }# S. Rdata:
c=
) o! P  \3 L8 P0 O, Y: [150 165
130 230 160
3 r/ X& Q+ p6 N, D/ [$ x/ \140 100
100 190
165 144
  c' x1 }5 Q0 `170 144 128 218 174
4 H  i0 x! y. M  r200 122 109 185
" N" z( M5 D6 j* ]. S6 G180 141 190
194 148
" h  ~# {3 ~' u0 s4 v/ F174 233
185 135
1 j: U, T  C5 i# t110;
enddata
n = @size(nodes);
min = @sum(arcs: c * x);
6 k* `. ]$ ~6 s; Z1 t, r# o3 g7 e@for(nodes(i):
@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
);
# I4 w6 E( S$ B@for(arcs: @bnd(1,x,9));
: S9 d' J3 P; o& Y( {5 Z- `) Q
它只能算出路径的步数和路程，并不能得到线路。希望能用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];

# G# P0 I- ]1 x8 }6 G/ a

open[1000]

5 T  M9 d( B( g" \+ c) K( p, c