摘要
通过对复杂网络现有拓扑布局算法的研究,给出了一种基于数据场理论和层次聚类方法的布局算法,不仅解决了大规模复杂网络在二维平面上分布时的节点重叠问题,而且能够灵活的计算和反映各种不同网络中节点的重要性程度。通过试验,证明了该算法设计合理,布局结果具有一定的对称性,可视化程度较好。
Through the research to the existed complex network topology layout algorithm,this article has given a layout algorithm based on the data field theory and the level clustering method.It not only has solved the question how to distribute the large-scale complex network nodes in the two-dimensional surface,but also computed and reflected nimbly the importance of nodes in different networks.Through the experiment,had proven this algorithm design is reasonable,the layout result has certain symmetry,the visualization degree is good.
出处
《微计算机信息》
2010年第30期157-158,91,共3页
Control & Automation
关键词
网络拓扑可视化
布局
拓扑势
层次聚类
network topology visualization
layout
topology potential
hierarchy clustering