我新调试好的程序如下,应该是对的,供参考7 ~) |9 y- n" p6 t' X; E! z0 j6 Q
因为特殊要求,这里的边的长度是二维座标内的空间距离6 H% F; ^; j, q
# E, R4 r6 q* U, |" E) p- @) m5 m; mto find-distance
+ p, C! ~0 o% h8 U/ u4 h let i 0
$ F( b2 Y3 b1 u let j 0
; ~. F& j" W! o( j& J let nodedistance 0
. K2 x- z; K _" S& J' N% H" m" S3 \ let linknumber 00 `7 s6 ]2 a% D. f' K! C
8 r* p" O; C4 Y0 X: H& Y3 N
while [j < count turtles]
, {( [1 B4 b) u2 g0 M5 V [0 y# O: `7 E' u8 W& B1 C% D
while [i < count turtles]" j, F1 a. b$ K0 j
[ if link-neighbor? turtle i( _! o3 j, Z! ~
[ask turtle j [set nodedistance nodedistance + distance turtle i]
4 J5 [/ l' v! A5 \5 H ask turtle j [set linknumber linknumber + count [link-neighbors] of turtle i]/ K, A8 ]% {1 S5 T8 J+ A; m
]" p- S2 F+ J. q( R( V& }) Q
set i i + 1
$ ?" ~9 x! R) q0 \ ]
: I5 h- y; a. r4 L. [ ?8 A9 A/ V8 v set j j + 1
1 k2 f& j! H6 v ] c- B6 g: q) \/ b. `6 U
set average-path-length nodedistance / (linknumber * 2)
0 X2 K% ?! e+ dend |