我新调试好的程序如下,应该是对的,供参考
( l% X$ \0 T: `1 b& _因为特殊要求,这里的边的长度是二维座标内的空间距离( K% ?' ^% A: y
& l4 E; Y; N+ s8 [5 I9 e8 Uto find-distance2 R- T7 r% ]4 l' o, \1 t
let i 01 A( s( i) B8 H/ d: _/ W' h
let j 0+ P3 | Y/ |: U6 {+ B' X2 c6 x
let nodedistance 0) R) ] Y$ k+ L5 P1 t- h
let linknumber 00 M4 u& q# j Z- s
0 y' J1 U9 O1 M' w9 o# R! @( j while [j < count turtles]
, g( I% I' e( S [
; T1 V4 k$ R, ^ while [i < count turtles]( z( s1 T1 ^$ x* y
[ if link-neighbor? turtle i1 R" K' _( x, E% m1 Y- [) Z
[ask turtle j [set nodedistance nodedistance + distance turtle i]- t3 B9 K" T3 d) D0 V* b6 A
ask turtle j [set linknumber linknumber + count [link-neighbors] of turtle i]
$ I7 t( ?, F, o. m5 |9 t ]$ E/ a, E) k" n
set i i + 15 K: ^4 d9 i) X' K4 S/ }
]
/ S5 {" P% T5 t9 A9 x set j j + 11 e `( ~% `$ a; u3 E
]
& M4 N2 S% E d' R: `, N set average-path-length nodedistance / (linknumber * 2), x/ K: L( j$ \
end |