我新调试好的程序如下,应该是对的,供参考: _! V# |7 z" q/ Y) W7 K! h
因为特殊要求,这里的边的长度是二维座标内的空间距离) O/ F) F2 @, N3 }% c! g
- g9 Y1 S; ]: {' [to find-distance
8 q9 @' v& T4 z# k let i 0
! x& n1 ~0 K) q let j 0
8 s; S" _7 q- k- o5 Z let nodedistance 0
g* }/ }" H b: P let linknumber 0
9 U. W+ c+ T' I# b
, p! g" Q8 s, Q/ v5 R B% G while [j < count turtles]! E& H* f6 D$ G" I" t
[
, d* |2 Z- _! Y: e" C& U. p- s) U while [i < count turtles]
' t# C4 T4 n6 ^, h) y3 q [ if link-neighbor? turtle i
/ t* x% A0 P& C1 Y4 G8 F8 o [ask turtle j [set nodedistance nodedistance + distance turtle i]
. H! S7 K+ u7 T) k2 I$ h. ]1 O ask turtle j [set linknumber linknumber + count [link-neighbors] of turtle i]
# r, y1 C1 a0 x4 m' w ]
5 |. s" O2 ~+ I set i i + 1
0 |( \& K) P6 ^6 M ]
, q, M1 z# ^2 o; Z9 j. o set j j + 1
+ {+ i- O- e4 u* x6 D' ?$ t ]
8 ]; r( f7 }7 h" |* R7 p, ? set average-path-length nodedistance / (linknumber * 2)
) }2 H; j/ A# Mend |