我新调试好的程序如下,应该是对的,供参考
& d# Q# `0 a5 J因为特殊要求,这里的边的长度是二维座标内的空间距离
3 L- i: V8 L# ^$ V& t% r3 p; Q+ @+ v) G9 A3 J2 X- k, T' R
to find-distance6 ^9 ^9 u9 F" d2 ?
let i 0
, A+ h5 _+ M3 f- R% Q; ^; ~3 \ let j 0" t5 D: ^- i# y7 e8 @ }, i o
let nodedistance 0
/ t! j# l$ C5 B5 ]3 F let linknumber 0' j6 R& Q: y1 j, B; X
$ r9 b! h, Q4 s9 R% @
while [j < count turtles]: {: g$ p$ w" I8 L9 D7 a
[
: i* u5 C/ f0 i while [i < count turtles]
# `+ L B# @7 h! \% D* `2 e) d [ if link-neighbor? turtle i
. |2 e* b6 J# D [ask turtle j [set nodedistance nodedistance + distance turtle i] {" s) a7 M6 {( N0 q* K* X: W
ask turtle j [set linknumber linknumber + count [link-neighbors] of turtle i]* \ q5 C6 H% \7 g- w+ X2 b
]& X1 v3 \1 }5 y9 @
set i i + 1; {2 ~" F5 m( c- F' F8 U7 I! {
] , J$ g9 \# p) L8 [
set j j + 1% S* l3 ?1 G. @0 L7 L7 O! ]
]1 w4 N9 K7 b f2 k2 ~
set average-path-length nodedistance / (linknumber * 2)
1 u6 Z9 T& ~, m7 P' H5 Send |