Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
. |8 j4 e9 R# q以下是lingo的代码
sets:
nodes/A,B,C,D,E,F,G,H,I,J,K,L/;
# K& L: {+ |1 e3 v- f  e0 |* Tarcs(nodes,nodes)/
A,B A,E
B,C B,E B,F
% ]) k( e" x9 w7 _+ y- }0 mC,B C,D
D,C D,H
0 `% S1 T: u# {6 N4 ~3 ]) PE,A E,F
F,B F,E F,G F,I F,J
1 a" P' k5 ^' Y# z6 {" t$ ~G,C G,F G,H G,K
4 s- u" C. F5 Z3 K' ~H,D H,K H,L
3 }3 E3 B& p7 N! BI,E I,J
J,F J,G
K,G K,J
4 f6 e2 L4 M$ V/ dL,K
/: c, x;
: X- u8 o) x) l: [  {4 T( Hendsets
data:
4 a: K$ ^' B1 E, J, J0 |' _' ?* hc=
150 165
# D4 X. w8 d" \$ Q$ g; c+ s% W130 230 160
9 S3 E4 p$ u7 H0 v$ J# \140 100
100 190
165 144
% j, g4 h" \& `4 g/ K( n170 144 128 218 174
200 122 109 185
% L+ m# g* E& V. W180 141 190
194 148
174 233
9 q6 y! j+ {! `8 s; o185 135
: b% b9 N! d+ @  L110;
enddata
0 O8 U! ~* C  f# w0 nn = @size(nodes);
min = @sum(arcs: c * x);
@for(nodes(i):
0 a9 x8 q. U$ V. Q@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
);
, B% F% R$ b/ @# g" P@for(arcs: @bnd(1,x,9));
( h# v; f" k4 z
它只能算出路径的步数和路程，并不能得到线路。希望能用mma解决这个问题。

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

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

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]

3 l0 l  ?2 V6 H: M