图形绘制软件
我需要绘制一个由 1876 个集群组成的图表，这些集群按以下方式组织：
962 clusters composed by 1 node
651 clusters composed by 2 nodes
144 clusters composed by 3 nodes
52 clusters composed by 4 nodes
24 clusters composed by 5 nodes
8 clusters composed by 6 nodes
8 clusters composed by 7 nodes
2 clusters composed by 8 nodes
4 clusters composed by 9 nodes
3 clusters composed by 10 nodes
1 cluster composed by 11 nodes
1 cluster composed by 12 nodes
4 clusters composed by 13 nodes
1 cluster composed by 16 nodes
1 cluster composed by 21 nodes
1 cluster composed by 22 nodes
1 cluster composed by 24 nodes
1 cluster composed by 25 nodes
1 cluster composed by 26 nodes
1 cluster composed by 29 nodes
2 clusters composed by 31 nodes
1 cluster composed by 43 nodes
1 cluster composed by 65 nodes
1 cluster composed by 4843953 nodes
我尝试了几个软件，包括 pajek、SocNet，但它们似乎更以节点为中心（它们允许您在节点上执行统计和一些高级操作）。相反，我不关心节点本身，也不关心它们的连接。 我只想显示这样的集群及其内部的节点。
有人知道有什么软件可以帮助我吗？
PS 这是 livejournal 的图表
I need to draw a graph composed by 1876 clusters organized in the following manner:
962 clusters composed by 1 node
651 clusters composed by 2 nodes
144 clusters composed by 3 nodes
52 clusters composed by 4 nodes
24 clusters composed by 5 nodes
8 clusters composed by 6 nodes
8 clusters composed by 7 nodes
2 clusters composed by 8 nodes
4 clusters composed by 9 nodes
3 clusters composed by 10 nodes
1 cluster composed by 11 nodes
1 cluster composed by 12 nodes
4 clusters composed by 13 nodes
1 cluster composed by 16 nodes
1 cluster composed by 21 nodes
1 cluster composed by 22 nodes
1 cluster composed by 24 nodes
1 cluster composed by 25 nodes
1 cluster composed by 26 nodes
1 cluster composed by 29 nodes
2 clusters composed by 31 nodes
1 cluster composed by 43 nodes
1 cluster composed by 65 nodes
1 cluster composed by 4843953 nodes
I tried several software included pajek, SocNet but they seems to be more node centered (they let you perform statistics and some advanced operations on the nodes). Instead, I don't care about the node itself and I neither care about their connections. I just want to show such clusters with the nodes inside.
Does anyone know any software that should help me?
P.S That is the livejournal's graph
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（4）
原则上，Mathematica 8 应该能够通过其新的 图表 对象。我说“原则上”，是因为我很难想象一个由近 500 万个节点（或顶点）组成的集群在屏幕或纸上打印时会是什么样子。选择合适的 GraphLayout 至关重要，因为此比较来自 Hu< /a> 显示：
它们是同一个图（936 个顶点）的 3 个描述，最差的渲染（当然）在左侧。本文包含一个具有 225k 个顶点的图的渲染，该图具有某种可辨别的结构。
无论如何，它可以处理邻接矩阵或边列表等形式的输入。边可以是有向的，也可以是无向的。您可以显示并标记所有或部分顶点和边，或者不显示任何顶点和边。您还可以删除簇（GraphComponents）并单独或组合显示它们。它还为您提供了各种 GraphLayout 选项：CircularEmbedding、SpiralEmbedding、HighDimensionalEmbedding、LargeNetwork 等。有多种 GraphStyle。
有一个名为 NeighborhoodGraph 的命令，您可能会发现它对于庞大的集群很有用。 Neighborhood[g,v,n] 生成距离顶点 v n 步内所有节点的子图。您还可以通过要求具有预定的边、顶点或两者列表的子图来简化事情。
请注意，某些 Graph 文档将引用 Combinatorica，尽管它在许多用途上都很出色且有用，但在我看来，它渲染图形的精度不如版本 8 Graph 对象。
此处讨论了有关大型图表的图表布局的一些问题。还有一个关于绘制大图的SO讨论，其中对各种软件解决方案进行了比较。
In principle, Mathematica 8 should be able to handle your problem with its new Graph object. I say, "in principle", because I have trouble imagining how a cluster of almost 5 million nodes (or vertices) will look when printed on screen or on paper. It will be crucial that you choose a suitable GraphLayout, as this comparison from Hu shows:
They are 3 depictions of the same graph (936 vertices), with the poorest rendering (of course) on the left. The article contains a rendering of a graph with 225k vertices that has a somewhat discernible structure.
Anyway, it can handle input in the form of adjacency matrix or list of edges, among others. Edges may be directed or not. You can show and label all or some or none of the vertices and edges. You can also remove the clusters (GraphComponents) and display them alone or in combination. It also gives you various GraphLayout options: CircularEmbedding, SpiralEmbedding, HighDimensionalEmbedding, LargeNetwork, etc. There are a variety of GraphStyles.
There is a command called NeighborhoodGraph that you may find useful for that huge cluster. Neighborhood[g,v,n] generates a subgraph of all nodes within n steps from vertex v. You can also simplify things by asking for a Subgraph with a predetermined list of edges, vertices or both.
Beware that some of the Graph documentation will refer to Combinatorica, which though excellent and useful for many purposes, does not render graphs with as much precision, in my view, as the version 8 Graph object will.
Some of the issues regarding graph layout for huge graphs are discussed here. There is also a SO discussion about plotting large graphs in which various software solutions are compared.
尝试 AT&T 的 graphviz。
Try AT&T's graphviz.
我不认为你会得到你的问题的合理答案，但我想在这里提供我的 2 美分：
当您找到上述评论的答案和详细信息后，我认为会有一种方法将它们相应地可视化。
I don't think that you will get a reasonable answer to your question, but I want to provide my 2 cents here:
When you have found answers and details to the remarks above, I think there will be a way to visualize them accordingly.
Tulip 据说它是每个主要 Linux 发行版的软件包（但显然也适用于 Windows） “能够在相对普通的硬件（例如 600MHz Pentium III、256MB RAM）上管理多达 500,000 个节点和边的图”。
这听起来正是你想要的。
Tulip, which comes as package with every major Linux distro (but apparently is also available for Windows) is said to be "capable of managing graphs with up to 500,000 nodes and edges on relatively modest hardware (eg. 600MHz Pentium III, 256MB RAM)".
That sounds just like what you want.