我新调试好的程序如下,应该是对的,供参考$ k( H0 s3 \& e; a' D* T, v5 N" j
因为特殊要求,这里的边的长度是二维座标内的空间距离2 T" ?" t' p6 y5 Q
& I4 _; `" Q* z E2 i" c
to find-distance$ E3 O( ~% P* |. s b# ]
let i 0 j* U$ O& U! N( l P) ~2 r- y
let j 0 g' L7 b6 z: V. D& f let nodedistance 02 t" A, w: f8 L( S
let linknumber 0! t$ Y1 Q3 ]* F6 B. q c2 G
- a$ e' ? y/ e* C R, Y while [j < count turtles]4 ~3 Q+ d7 [" v6 H w- b5 Q9 b
[7 X. `; x" p, O5 d9 O( A- d4 H
while [i < count turtles] # h8 L/ w. n- n3 W2 V1 a [ if link-neighbor? turtle i1 G: [! j3 D2 i) V+ ?
[ask turtle j [set nodedistance nodedistance + distance turtle i]7 y" g+ o3 @4 O: [- ^ y+ X; L9 N
ask turtle j [set linknumber linknumber + count [link-neighbors] of turtle i]) i. W! [0 n! o4 F
] 0 H3 s3 g+ y8 A5 V set i i + 1 ' Q0 U; G- H7 j) K ] 2 m) z F2 r$ z4 C4 b3 u set j j + 17 b+ t# R8 i+ W4 G$ G9 [5 ` @
] u/ h* c9 ?7 [- L+ |
set average-path-length nodedistance / (linknumber * 2) / M8 P7 L' f; I) M4 Zend