Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
9 l# a# i3 B. L; t0 t+ W+ e以下是lingo的代码
sets:
# j$ n# ?3 N! Rnodes/A,B,C,D,E,F,G,H,I,J,K,L/;
$ f/ }, [: d+ T3 A& `  n, ?4 aarcs(nodes,nodes)/
3 z/ @+ w3 p) n9 tA,B A,E
) ]/ l2 R4 c. D) @$ Q/ R( N) |. DB,C B,E B,F
C,B C,D
' `5 G* m. t$ W" M8 ND,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
8 Z; J5 S+ N' k& Y% P# ZH,D H,K H,L
I,E I,J
( m3 F. y- c! C, K3 P4 \4 ?  \J,F J,G
K,G K,J
L,K
# G5 K# |& j) K, [$ a0 J2 r/: c, x;
endsets
data:
c=
150 165
130 230 160
, }* M- z0 I3 m8 L! }5 D3 v140 100
100 190
165 144
170 144 128 218 174
200 122 109 185
% p- j8 a3 Y5 c+ ^  b( R180 141 190
; ~4 q. h1 j4 x& {' P* G  T194 148
; ^7 F' B7 a) U4 e7 r6 M174 233
185 135
110;
+ \; u4 B4 x; T+ S8 Senddata
n = @size(nodes);
min = @sum(arcs: c * x);
@for(nodes(i):
# N- }3 x9 y! J7 I1 f$ T1 @" p/ u@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
. C- ^: j4 _" }0 k. j4 Z% B- o);
2 I2 T( C. }( O@for(arcs: @bnd(1,x,9));

( U! ~/ N5 [& U3 L, s0 C它只能算出路径的步数和路程，并不能得到线路。希望能用mma解决这个问题。

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

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

* g+ V: e! L' @2 @

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

% Z! F3 |' _7 a8 J

open[1000]