Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
: ?+ x& v1 f) m以下是lingo的代码
7 ], i: K9 d- h( ^! s* e% j$ ?sets:
  l' N$ S$ I) v8 @. lnodes/A,B,C,D,E,F,G,H,I,J,K,L/;
arcs(nodes,nodes)/
A,B A,E
5 I$ F, Y1 @! v& sB,C B,E B,F
8 I1 ^7 i  @5 {C,B C,D
D,C D,H
E,A E,F
F,B F,E F,G F,I F,J
5 o( f. H8 `* ]6 w4 @G,C G,F G,H G,K
H,D H,K H,L
, Q; `! N, ^1 n! Y" I' u: h8 }2 Y8 ^I,E I,J
+ B# X( R! \- K% JJ,F J,G
8 X. G& G/ b* s; r+ QK,G K,J
L,K
( {) ]9 H  Q/ v' j! j! R- F/: c, x;
endsets
data:
c=
7 o: \6 _4 M- s1 w* R150 165
3 n- Y2 Y* R5 L& n- s& T- L0 [# T130 230 160
. E% U: W: l- J& h/ Z140 100
1 F. a& D) }4 }6 S- Q1 C1 A1 F100 190
) d5 z, I6 o+ g9 v& e7 N/ ~5 u/ _165 144
( H$ b& w0 c( d8 P& ^) ~170 144 128 218 174
200 122 109 185
8 N" \7 x4 W$ b- z+ ]0 ~$ F180 141 190
! J( ^' M$ {( W! d) s0 U6 Y194 148
174 233
* G) g& S( o& c* v" p185 135
110;
enddata
7 s) f. Y- G( In = @size(nodes);
min = @sum(arcs: c * x);
6 ]8 n+ ?1 s* ?. {: C  ]@for(nodes(i):
( }# L' i$ M; Y* ^6 T* Z@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
);
8 I# E5 R  z( t9 |  f6 m@for(arcs: @bnd(1,x,9));

4 |9 C# H7 y9 h它只能算出路径的步数和路程，并不能得到线路。希望能用mma解决这个问题。

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

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

) D7 T& u: I' x% Z: y: R% n

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];

3 t/ R# r5 d2 z

open[1000]

( ]) @: ^1 ?$ u