Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
以下是lingo的代码
sets:
nodes/A,B,C,D,E,F,G,H,I,J,K,L/;
arcs(nodes,nodes)/
8 y4 Y  G9 t; W5 g7 Z- p, `A,B A,E
B,C B,E B,F
. l( D( o% G) ?) a1 R: z& \% b/ g2 [C,B C,D
D,C D,H
E,A E,F
  g1 l) a8 B' F- PF,B F,E F,G F,I F,J
0 D+ o4 s1 J, A1 j5 j. ^1 ]+ JG,C G,F G,H G,K
( Y, U1 t* W0 J0 e5 [  X6 HH,D H,K H,L
I,E I,J
' _& i" W- }% R" q" P/ R" w- L3 FJ,F J,G
! w: l7 h2 c2 u3 UK,G K,J
L,K
$ W6 s+ V* v  C. x# y/: c, x;
4 a- ]. u2 E6 a( H' |, ~endsets
data:
c=
3 \! L$ s! ^2 s5 z150 165
; P( x/ ~; r7 {7 s& \7 p2 D; R130 230 160
140 100
100 190
165 144
8 K/ g- Z1 y) h  R170 144 128 218 174
7 j! C$ H6 c( L1 a# l+ t+ F! e8 T200 122 109 185
4 `3 T) M6 ]  e# u) Y* V180 141 190
3 @  ]  B3 K5 M& l' y' ^194 148
174 233
, c7 F5 B! t3 w: b6 v# Q& w185 135
% m  K/ R5 y9 x/ K1 O9 R110;
enddata
n = @size(nodes);
min = @sum(arcs: c * x);
0 n" L  t6 ?% ]% O) N& V@for(nodes(i):
@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
- n+ Q* x. i- g( E# E$ A% `, D);
@for(arcs: @bnd(1,x,9));

8 s" R  h% J+ Q$ H- T- N6 e它只能算出路径的步数和路程，并不能得到线路。希望能用mma解决这个问题。

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

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

0 a6 D5 A8 c5 V5 C  X- Y

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]

  K# m6 m3 ?( v7 }5 {7 ~