摘要： 提出一种曲线跟踪填充算法测量复杂网络的长度，在对曲线上的象素填充时，分类统计象素的总数，最后计算曲线的长度．本算法速度快、精度高、效率高，不受网络复杂度的限制．

关键词: 跟踪填充, 高精度, 长度测量, 复杂网络

Abstract: A new method of measuring the complex network length was presented in the paper. Based on the curve. it can follow the curve, change its color and count the different type of pixels seperately and then calculates the length of the complex network. The new algorithm has the charateristic of high running speed. high precision and efficiency. It has no restriction on the degree of complexicity of the network.