Mathematica 能否完全替代Lingo？

入戏太深丶

要求从1开始，最终回到1，且路径有方向，要求所有路径都经过。
& X+ ?) m, g* S9 t+ t0 a6 ^+ [以下是lingo的代码
sets:
1 ~; m6 e$ N9 o; o" y% fnodes/A,B,C,D,E,F,G,H,I,J,K,L/;
' O9 B; C% F9 m% larcs(nodes,nodes)/
A,B A,E
( O! t! O' r1 W+ i3 N$ fB,C B,E B,F
1 F! }, H% e* G2 wC,B C,D
D,C D,H
5 g9 ]/ m/ [' R1 ME,A E,F
$ _$ D* ^0 v8 ~  Y3 FF,B F,E F,G F,I F,J
G,C G,F G,H G,K
+ I( P' k" i9 O# {  |H,D H,K H,L
+ e$ J& M7 Y8 c9 M% P, kI,E I,J
0 f) P0 I8 n5 d0 ^5 cJ,F J,G
K,G K,J
L,K
, B& a# C1 V  l/: c, x;
endsets
data:
c=
150 165
130 230 160
140 100
100 190
. g; B% K" [; O0 f4 q# ~165 144
170 144 128 218 174
200 122 109 185
( O$ Q$ R$ @/ U8 z180 141 190
. ?2 t/ E' X- V! D: I! d194 148
# i  P! {! W, \$ }5 l/ {/ L174 233
, Q, s8 m" ]9 s* I185 135
6 ^, ?7 a; v# x3 m110;
enddata
n = @size(nodes);
* x5 h' G6 `" _* m% Z1 `( D1 o$ Vmin = @sum(arcs: c * x);
@for(nodes(i):
2 [+ |; l: R% y' w9 D@sum(arcs(i,j):x(i,j))=@sum(arcs(k,i):x(k,i))
4 c. k1 A9 h; Q2 V! X1 O( {);
@for(arcs: @bnd(1,x,9));

它只能算出路径的步数和路程，并不能得到线路。希望能用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];

; s1 e9 e& }5 k1 T6 O- E' h; K

open[1000]

* A, J/ y' f% I' [% w0 p- h