我新调试好的程序如下,应该是对的,供参考6 B9 L8 @" K: b5 k: l
因为特殊要求,这里的边的长度是二维座标内的空间距离& L: J& \9 o1 C+ @, U
1 X( ^) h1 _ e) X0 P
to find-distance1 T X, l1 G+ w$ k, x: U* s
let i 07 a; ]/ E; U! l% V) A& _
let j 0: H* X1 m) p! O
let nodedistance 0* |9 u, t/ S, A1 n
let linknumber 0
$ s% T1 P" e8 I" c% d 4 g$ O' s" V9 c+ ?! }/ m( p8 \% V
while [j < count turtles]. Z0 j" [3 N6 S
[# D7 M' X+ ?: L& f$ v% ]
while [i < count turtles]8 q- K3 }7 O! Z
[ if link-neighbor? turtle i
) o, N4 z9 v- n [ask turtle j [set nodedistance nodedistance + distance turtle i]$ U7 H( t0 z' z- o) Z
ask turtle j [set linknumber linknumber + count [link-neighbors] of turtle i] p- s0 K0 E N, W0 o; Q
]; \( ^2 B; v) @( q' A& d
set i i + 1- A5 M3 K. h% P7 e: A% S% X
] , _: S0 Q* B% ~$ T( h7 u& X
set j j + 1
* ~& V; x$ H" H% @: }7 h) m8 l ]& ~& W: ~$ k! P1 W
set average-path-length nodedistance / (linknumber * 2)' Q$ j# n# ~5 a" P, D9 P0 i# g5 W/ @+ [
end |