可视化大图 [英] Visualize big graphs

问题描述

我有一个包含690,024个节点和7,398,042个边的图，并希望将其可视化。我已经使用graphviz的点和gephi，但由于内存不足而终止。有什么方法可以解决这个问题吗？

I have a graph with 690,024 nodes and 7,398,042 edges and want to visualize it. I have used graphviz's dot and gephi but both terminates because of low memory. Is there any way to fix this issue?

推荐答案

Gephi有基于JVM中分配给它的内存量的限制。请查看此 http://gephi.org/users/requirements/ 进行更改。
我建议使用斯坦福网络分析平台（SNAP）。
核心SNAP库是用C ++编写的，并针对最高性能和紧凑图形表示进行了优化。它可以轻松扩展到拥有数亿个节点和数十亿条边缘的海量网络。它可以高效地处理大图，计算结构属性，生成规则和随机图，并支持节点和边上的属性。除了大图的可伸缩性之外，SNAP的另一个优势是图形或网络中的节点，边和属性可以在计算过程中动态地改变。

Gephi has a limit based on amount of memory allocated to it in JVM. Check this http://gephi.org/users/requirements/ to make changes.
I would suggest to use Stanford Network Analysis Platform (SNAP) .
The core SNAP library is written in C++ and optimized for maximum performance and compact graph representation.
It easily scales to massive networks with hundreds of millions of nodes, and billions of edges. It efficiently manipulates large graphs, calculates structural properties, generates regular and random graphs, and supports attributes on nodes and edges. Besides scalability to large graphs, an additional strength of SNAP is that nodes, edges and attributes in a graph or a network can be changed dynamically during the computation.

这篇关于可视化大图的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！