我新调试好的程序如下,应该是对的,供参考
8 G: E9 Y1 o+ u5 `/ }2 H因为特殊要求,这里的边的长度是二维座标内的空间距离/ n3 A' [% F( X, @
1 z/ Q* l6 v; I
to find-distance
U- h7 ^" z6 C3 X2 A let i 08 @- i- L4 k2 i5 o, |- T! R
let j 0
7 o" `- L9 ~: b4 z% B9 T" ]/ _/ p let nodedistance 0( X- V5 P }9 e( g/ r
let linknumber 0* H q' p0 ]. B% w. b: i* r/ a3 c! [7 z
7 i- j$ J* A! D while [j < count turtles]
- G; \- e' ~4 g$ R! P- s$ L( h [& g+ f. R" e2 M! v
while [i < count turtles]
( q; u; p Y: i2 O [ if link-neighbor? turtle i- }9 A, p$ X, ~* {1 u
[ask turtle j [set nodedistance nodedistance + distance turtle i]* h$ @* b% ]" L9 R9 b3 B
ask turtle j [set linknumber linknumber + count [link-neighbors] of turtle i]% @* C! [) U$ { m
], x+ D; t+ B8 U& }
set i i + 1
t3 p: w7 X# C9 `8 N9 [ ]
/ y/ N7 ]' f# p7 ?7 J" g set j j + 1
( b& b) ]7 d; l7 ?5 B% _ ]
7 Q+ @! F& S) a8 {# o% |3 s7 r! ^3 u) K set average-path-length nodedistance / (linknumber * 2)
1 P7 S: I' `- A5 j, vend |