Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
以下是lingo的代码
* y1 v: I  a' G8 W4 qsets:
nodes/A,B,C,D,E,F,G,H,I,J,K,L/;
arcs(nodes,nodes)/
: ~$ R1 e, b7 \9 }A,B A,E
B,C B,E B,F
$ \" l) e1 y+ a: @9 S  j* e* tC,B C,D
8 `4 Z6 t9 s2 wD,C D,H
E,A E,F
9 {9 N9 A5 m0 }/ B& w6 V! pF,B F,E F,G F,I F,J
G,C G,F G,H G,K
: o& c& t% B5 v3 uH,D H,K H,L
+ a; p5 \. X& zI,E I,J
J,F J,G
K,G K,J
L,K
0 @( T+ {) b6 Y1 D, b! P/: c, x;
endsets
0 ]2 U' V# P2 |2 m" cdata:
c=
& R& x/ y) i  W6 A5 C. c, a$ t150 165
130 230 160
! ?1 p  W; [3 I* j. n* \140 100
, @7 \* e8 {/ `100 190
( W9 o5 c* z$ x" R8 m! g8 F165 144
170 144 128 218 174
' a) h! ]8 |4 g. |0 F" a200 122 109 185
180 141 190
194 148
+ u& z/ }, k; e% s4 h174 233
; k. V) K2 @& W. Z0 U185 135
' ?. w6 m. Q$ y0 Q- L& N110;
9 L$ \$ e0 w2 v1 h6 Henddata
n = @size(nodes);
min = @sum(arcs: c * x);
@for(nodes(i):
@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
8 D" h; y, _* H& I) B; v0 h);
2 m+ b. i1 l# p( }" M@for(arcs: @bnd(1,x,9));
* o4 M7 ]0 V. ^- n. m( T7 f
1 a, o! |1 v2 l它只能算出路径的步数和路程，并不能得到线路。希望能用mma解决这个问题。

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

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

" p) d! D  H) x$ C$ r: R6 H& q

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

5 U  \! |! v5 C% J8 |3 M

open[1000]