Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
" L$ z) y4 V1 \5 J$ `: s以下是lingo的代码
% M9 ~( K+ i& R( bsets:
5 B7 F2 m; G) _) n7 anodes/A,B,C,D,E,F,G,H,I,J,K,L/;
arcs(nodes,nodes)/
# I! z: _! `, jA,B A,E
2 X3 I/ d' ^9 ^9 YB,C B,E B,F
6 c2 ]0 |7 r- `( Q; nC,B C,D
D,C D,H
E,A E,F
$ S( A/ d3 Z, T  R3 l: {F,B F,E F,G F,I F,J
G,C G,F G,H G,K
5 ^! X1 C8 {: \# KH,D H,K H,L
I,E I,J
J,F J,G
K,G K,J
9 t8 k4 M/ ^+ N6 OL,K
/: c, x;
endsets
0 j5 w: F- \7 h3 y- J* S+ W* _data:
6 R8 p6 n: v' |. u6 V6 `c=
150 165
130 230 160
/ x: ~2 {; d# B140 100
, x$ Z7 p5 D7 _- [" ?, x, Q2 Z100 190
5 _* K7 k/ i. [* f; n. I: }165 144
170 144 128 218 174
% a/ w$ h2 W: v200 122 109 185
180 141 190
, g" u+ @, J, {' T8 O194 148
: I3 {( c+ H" F* C+ `" ^174 233
185 135
110;
1 w+ j2 g9 m. V' {/ P1 fenddata
0 F/ M0 q- _- F, z  i% L7 X0 H- in = @size(nodes);
+ x' Z* G# c' e( h" @4 X( Mmin = @sum(arcs: c * x);
4 [; G& g- @7 V0 b@for(nodes(i):
  v- L% ?9 j/ U& E  Q@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
# C) a: [( [+ u- }) P# E6 z5 P5 `9 q);
# n! [! D: ]9 X& c2 j9 ]@for(arcs: @bnd(1,x,9));

它只能算出路径的步数和路程，并不能得到线路。希望能用mma解决这个问题。

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

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

: M5 m1 @7 P0 ~8 i4 y1 b/ i4 r

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

9 y5 |1 v& B2 b# L

open[1000]

' t! Z$ x( e  |2 P