Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
以下是lingo的代码
6 I, [: d( A" Y/ _5 L1 S/ asets:
nodes/A,B,C,D,E,F,G,H,I,J,K,L/;
arcs(nodes,nodes)/
# @( P* `9 U  O1 r+ `A,B A,E
8 y# _! W5 \4 n+ K; L. VB,C B,E B,F
C,B C,D
D,C D,H
E,A E,F
# y  ~2 t1 Y, jF,B F,E F,G F,I F,J
6 N: N$ t, m) R5 V5 V' n  bG,C G,F G,H G,K
H,D H,K H,L
I,E I,J
: D5 [/ ?+ C$ z9 T3 f! GJ,F J,G
8 K. \2 s/ r$ D$ F* ?K,G K,J
5 }9 Y0 B# D! T( HL,K
/: c, x;
endsets
, A4 A, b4 M" n; T; p% Mdata:
: G1 A1 i( D) f5 Y/ X7 }: Qc=
- R0 g* q2 E/ c) _$ `% J* S2 C150 165
! L, E! S9 b; ^# P7 J130 230 160
+ X  G5 t3 p, H- D0 N. N140 100
100 190
165 144
170 144 128 218 174
200 122 109 185
4 q. v6 f5 A/ A( \4 Y1 U5 o& U180 141 190
194 148
1 Y5 \8 d& L7 _2 ^+ l174 233
185 135
110;
enddata
2 Y& U* |5 p9 s$ n* @2 R: n$ On = @size(nodes);
5 _7 z" o1 D: b, Pmin = @sum(arcs: c * x);
@for(nodes(i):
" T% Y% `4 b% j9 K* P4 X@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
);
/ E/ O' O9 r! s  F. o: B/ {. L+ _@for(arcs: @bnd(1,x,9));

" ?. m8 \4 S* `$ Q3 J2 Q它只能算出路径的步数和路程，并不能得到线路。希望能用mma解决这个问题。

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

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

4 j; e8 l8 f+ G3 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]

  B& a# y) N+ S4 y