我新调试好的程序如下,应该是对的,供参考% {# K* z% d/ W' p
因为特殊要求,这里的边的长度是二维座标内的空间距离
0 l* Y, Q9 B+ ^
0 y6 k! H y" _! f zto find-distance
4 N+ B5 I. g, z- U let i 0' |+ W" D, n; N
let j 06 H, b! N! b6 e, M7 ?
let nodedistance 0. W4 Y: _' T; Q) W' u
let linknumber 0+ R( q3 j, c h* C8 `9 I+ K' C) f
* d8 F, q _& L while [j < count turtles]
* L8 |. b0 n9 z; r4 j [5 [! t* Y( u# M
while [i < count turtles]1 B& I/ B: R- M4 G$ ^
[ if link-neighbor? turtle i$ D6 e4 e. D/ M+ J3 Y# a
[ask turtle j [set nodedistance nodedistance + distance turtle i]7 f# R* E. M: n1 x3 z5 Q% R5 Y) N
ask turtle j [set linknumber linknumber + count [link-neighbors] of turtle i]" H! u; Y7 w, [$ K/ h
]1 a+ K. y1 o7 q, w: J9 v% Q
set i i + 12 w* x8 i1 }) f# b; h
]
* Y( o1 t3 u1 |2 E$ j set j j + 1
5 _( l+ O+ G; g* j2 X. O ]! k. n/ e% k f) d
set average-path-length nodedistance / (linknumber * 2)0 H# l/ d# h- {7 f! s
end |