我新调试好的程序如下,应该是对的,供参考
+ N, h' a) o' L6 I% o+ r) U1 [因为特殊要求,这里的边的长度是二维座标内的空间距离
% y( T$ n3 k+ `! C( b
: q8 V, | X9 L' m, O! dto find-distance
1 {8 a5 l: a' u% @+ C# J2 ] let i 0
# O3 s! T* d! P' C let j 0! u9 Q: N3 }2 N: }
let nodedistance 0
n" M9 j# x2 Y+ t$ X' H/ g let linknumber 0! i% ^3 [0 h+ F& F) t; _
. N& N3 L9 Z7 @ while [j < count turtles] G* I1 r5 ~% A( d0 ]
[
& A0 Z8 h7 W% ]5 \+ a1 `8 X2 o; p while [i < count turtles]
- T+ ^* Z0 J' M# a( d [ if link-neighbor? turtle i, C1 z: g% r5 b+ g6 C
[ask turtle j [set nodedistance nodedistance + distance turtle i]3 w6 C+ f" W, N
ask turtle j [set linknumber linknumber + count [link-neighbors] of turtle i]
2 {" k" u# p" p) j J ]8 S1 [) A( X6 H) L- z6 G
set i i + 1
/ K9 j. R" A$ \3 X, ^ ] 8 M, m6 w% A- N" Z
set j j + 17 Z+ ~( Y8 ]- p% t5 C+ C
]" Y$ l/ p6 R L4 W, n
set average-path-length nodedistance / (linknumber * 2)
P6 V+ T! F$ Tend |