Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
以下是lingo的代码
8 _& V+ H- w& S5 Lsets:
! i+ z8 w$ O, K. D/ D. g/ }nodes/A,B,C,D,E,F,G,H,I,J,K,L/;
3 X3 Z9 h- r- u& [* z  warcs(nodes,nodes)/
. _/ c( v3 \2 {  z# SA,B A,E
B,C B,E B,F
C,B C,D
D,C D,H
E,A E,F
& B' L5 k( {* [- x7 DF,B F,E F,G F,I F,J
+ q! {4 N) C- j" T0 \2 U$ yG,C G,F G,H G,K
H,D H,K H,L
! y! \+ l7 h# k' U" T( L- gI,E I,J
! \2 Y7 w6 }1 a) C2 z+ {J,F J,G
K,G K,J
L,K
/: c, x;
" P( N, U" ]7 W- x2 j, rendsets
data:
c=
  j2 |/ |5 {. j2 ~! U; R150 165
, C  }/ I4 D. @: p130 230 160
140 100
100 190
1 v+ `+ b8 p% g$ E/ d. R0 Z# d3 }165 144
170 144 128 218 174
200 122 109 185
+ M# S5 k7 ^3 ?7 x0 Y" i180 141 190
194 148
174 233
$ h8 J: w- D- c  P; |" g5 A185 135
5 K. o; M: k8 ^' W- _110;
enddata
3 \4 L$ I$ f% L- N5 z0 e  d5 J  N+ ^n = @size(nodes);
8 V( }9 J  F2 \; I: p8 j5 Pmin = @sum(arcs: c * x);
) s8 s' \6 m; ~) J7 z* W8 P; B@for(nodes(i):
- u2 l) a0 J' {( A@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
- u, i$ z/ z, C$ B  }  R  b3 d( X);
@for(arcs: @bnd(1,x,9));
6 E4 n. C$ b  F1 e4 |! c( O' M
它只能算出路径的步数和路程，并不能得到线路。希望能用mma解决这个问题。

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

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

. S% }$ g9 ]% Q$ m

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]

" F. e4 P; E$ E8 T" W