Graphing Algorithm for many nodes

 

I have been trying to develop a web based application to help in the graphing of nodes and their interactions.

I have attempted to use the Sigma.Js with the Force Atlas extension.

For my simple tests (few nodes) the results are quite good-looking, however with an additional thousand nodes the result becomes quite a mess.

许多节点与几个节点

Is there any such way to make the result more view able? (easier on the eyes/not just 1 big blob) How would I go about doing this? Are there any algorithms already written(that I may implement?)

You can try the Fruchterman-Reingold force layout (for which there is a sigma plugin). It specifically minimises the number of links that cross each other, so it is in general more suitable for large graphs (unless all the nodes have lots of connections).

In addition, the fisheye plugin may help to make more sense of the graph after it has been drawn.

sigma.layout.forceAtlas2缩放好得多，但如果图形具有很强的连接密度，它不会创造奇迹。

链接地址: http://www.djcxy.com/p/75732.html

上一篇: 是否有任何C99编译器在默认设置下

下一篇: 针对许多节点的图形化算法