Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
0 G! ^9 o$ X+ L! V# S8 z. X0 V以下是lingo的代码
sets:
4 J7 j' D8 Z* B# [% k4 m: inodes/A,B,C,D,E,F,G,H,I,J,K,L/;
arcs(nodes,nodes)/
, H% T6 e# e! B, ]- |9 vA,B A,E
' x1 K$ ?# a! x: I$ w/ R0 mB,C B,E B,F
C,B C,D
5 ~  M4 Q5 t% _; G" HD,C D,H
" L$ T8 M5 d1 u2 x& lE,A E,F
F,B F,E F,G F,I F,J
" |" O0 x' s6 w5 I) H- l' TG,C G,F G,H G,K
/ Q, m& E  Y5 `H,D H,K H,L
8 x* ]; r* X5 z! c6 `3 f# _6 G9 UI,E I,J
J,F J,G
K,G K,J
L,K
/: c, x;
endsets
1 |8 M5 d: {. M! A0 fdata:
c=
150 165
# q+ e& \0 N+ z% U  P5 J( @+ a130 230 160
  t1 {" r3 M9 u6 {140 100
100 190
165 144
9 u( g- J. S! f170 144 128 218 174
2 S3 m# k7 n2 i0 m/ w) ^- C200 122 109 185
. G! h( H/ H2 C2 W3 z180 141 190
194 148
174 233
' s# c0 P5 Y2 {+ K, b; M& j185 135
110;
enddata
n = @size(nodes);
- T$ S1 e' c  l7 umin = @sum(arcs: c * x);
" b3 w2 R  N% U8 k" H@for(nodes(i):
@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
);
' L8 Q( P* v+ R/ ~* e# K, ~% c@for(arcs: @bnd(1,x,9));
7 B* v* Y8 P2 z! Q0 a( W) W% K
它只能算出路径的步数和路程，并不能得到线路。希望能用mma解决这个问题。

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

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

  f5 O: |  ?  C4 `# M& Y

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

3 ]1 J5 j" K' M. ~

open[1000]

; V4 T, O7 Q5 |4 T