Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
以下是lingo的代码
sets:
6 a( q# `- y: I' Wnodes/A,B,C,D,E,F,G,H,I,J,K,L/;
arcs(nodes,nodes)/
9 w2 J+ s' N% M8 KA,B A,E
B,C B,E B,F
C,B C,D
D,C D,H
. U& D7 t; l" l  `7 m8 j: y/ OE,A E,F
F,B F,E F,G F,I F,J
( }; @5 K0 _8 Z* B! wG,C G,F G,H G,K
+ h0 S. F! U6 g& x! m2 ~+ LH,D H,K H,L
I,E I,J
J,F J,G
K,G K,J
$ k8 k, B8 M# @4 w  {& K+ }( f9 n: ML,K
8 W/ ]; m2 p+ c4 J6 \7 i$ P2 N/: c, x;
endsets
data:
c=
150 165
1 G* R' d9 `+ O: Q. g' X3 P3 w130 230 160
6 Q1 v7 G5 [8 p- w! F9 h( C140 100
100 190
% x8 M! g+ S, x8 x& a" y165 144
170 144 128 218 174
200 122 109 185
* H8 X7 g) G& e& g! I180 141 190
194 148
3 y7 r" {" a! W! L174 233
  ^; l2 N6 p0 ]# P1 x185 135
110;
enddata
/ Y$ r. f& E/ O& @' x4 h' H7 vn = @size(nodes);
8 a! r: P3 [4 V9 W1 B, }: Xmin = @sum(arcs: c * x);
@for(nodes(i):
2 [! M9 ?4 I% ]; [. R% s@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
);
, S2 {% ~2 J8 O1 X% O5 c" R( ]@for(arcs: @bnd(1,x,9));

- x* j9 j* o% @% \它只能算出路径的步数和路程，并不能得到线路。希望能用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];

open[1000]

# t; p* R; W* G4 J/ n: `. i5 O
( ?: N' X* `/ G1 I0 x+ X