Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
, S- r" ~9 F$ e9 [以下是lingo的代码
sets:
nodes/A,B,C,D,E,F,G,H,I,J,K,L/;
arcs(nodes,nodes)/
A,B A,E
B,C B,E B,F
4 N) P0 b2 L: s# h/ UC,B C,D
D,C D,H
' G' U- G% N& ^) j7 V8 h# x0 TE,A E,F
F,B F,E F,G F,I F,J
* w2 U" I& p* {+ p8 SG,C G,F G,H G,K
H,D H,K H,L
I,E I,J
J,F J,G
* J. G4 \3 V+ J( B( a' k: h% `K,G K,J
: O# A+ G, ]- ]L,K
1 c- g" T% I  `* o# A9 v5 o/: c, x;
( I* o& r# D- ^3 j8 fendsets
2 H! x" h+ x, @5 d0 Tdata:
c=
: c( O$ v; Q% n  m- e$ [+ v9 T- u/ R150 165
; r  _5 R7 r) c/ f+ Q5 U# M130 230 160
. j0 G- p! B0 |- w# o140 100
100 190
( C: M* R2 d) Q+ F' i165 144
170 144 128 218 174
200 122 109 185
180 141 190
6 }- V; I! A; _: L/ U194 148
174 233
7 `( f* e( Y/ x, l  K185 135
110;
enddata
8 U% A/ U% \! o% L# Nn = @size(nodes);
min = @sum(arcs: c * x);
@for(nodes(i):
@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
);
@for(arcs: @bnd(1,x,9));

* w4 J7 }5 R# P它只能算出路径的步数和路程，并不能得到线路。希望能用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];

8 j& ]+ {+ u& G, ~3 E. A  C$ M

open[1000]

3 S, E$ i4 b$ I* }5 y) q