Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
, o  M' c& p5 |/ v以下是lingo的代码
7 m8 R8 H  o8 U# S0 R# ~2 asets:
' @3 S4 t+ o$ D& _4 tnodes/A,B,C,D,E,F,G,H,I,J,K,L/;
% I+ i# s: r' e7 z  ^% @& v4 M: rarcs(nodes,nodes)/
A,B A,E
B,C B,E B,F
+ h- G3 ^$ _2 V9 B% Y  g" V) OC,B C,D
D,C D,H
E,A E,F
6 q9 z$ k! l: iF,B F,E F,G F,I F,J
G,C G,F G,H G,K
H,D H,K H,L
' O3 O# Z* f8 x- n% kI,E I,J
J,F J,G
! u3 p. I  [- S0 V, p9 a- f7 ~5 n6 cK,G K,J
0 q$ y! l" {9 Q8 uL,K
& p! \+ |* Q0 v6 @& d, E/: c, x;
endsets
data:
9 }% E& U! `5 E& b( f8 Cc=
150 165
130 230 160
140 100
100 190
! d2 _/ E, K9 [5 r3 }0 z# [5 |165 144
' I* V7 J( Z, Z, x% x170 144 128 218 174
200 122 109 185
+ r) p0 p4 G$ R, [+ y180 141 190
# @! a* @' V7 Y' C8 G. ]194 148
0 Q4 P0 ^2 d9 n# X174 233
' d. O! M  R& h5 U185 135
& H, c* T7 _, u; M110;
- l# K; n/ \5 C8 K; Benddata
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))
# K/ f( U5 Q/ R% c& n9 j" x, W);
" k6 c; u9 ]. E4 e, I7 X@for(arcs: @bnd(1,x,9));
$ g: A0 F. k* ^) Y. \
它只能算出路径的步数和路程，并不能得到线路。希望能用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];

# \! ?0 l" n4 m( }0 I" {3 G

open[1000]