Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
以下是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
C,B C,D
8 t6 H8 d  w* _D,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
9 i9 M; e: x% yH,D H,K H,L
I,E I,J
J,F J,G
K,G K,J
L,K
/: c, x;
endsets
# e. k& X/ a) g8 [data:
$ ~0 b2 w( s, C: T1 p6 }c=
150 165
130 230 160
140 100
% c' N4 S9 u. j0 y! F100 190
. c/ [3 h1 d" J7 l- C165 144
: K8 E1 z* G) h' I$ o9 {4 v! s170 144 128 218 174
200 122 109 185
& i0 b% ?8 v5 S! r8 c5 n- _% J180 141 190
194 148
174 233
! Z! x4 `- x8 J9 ?. v& z. m+ m2 H185 135
0 ~& F- X/ P8 y7 t3 j110;
* l0 @: ]4 m" E$ G% S+ \enddata
4 p. W( {4 ]+ tn = @size(nodes);
! U% n2 f/ G0 ~, h* qmin = @sum(arcs: c * x);
+ U  U5 E" u4 _( u@for(nodes(i):
; L% N0 r" f' G$ D6 D5 u, W@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
& Z, }) ^! c; I; F+ t9 @);
7 O2 ?$ N* C& ^@for(arcs: @bnd(1,x,9));
+ i2 `1 _; o7 ~1 M& n' T6 @
; W; x% L9 K3 z它只能算出路径的步数和路程，并不能得到线路。希望能用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];

) n  |. ~9 u# ]" W$ {! r

open[1000]

! I1 Y! ?! r! x+ c- [, c" O9 R* Y