You could look into "force directed graphs", which is the general term for graph placement algorithms which use a model of attraction for connected nodes and repulsion for unconnected nodes.
If you search for any mainstream language and "graph layout" you're sure to find toolkits that implement this algorithm. Java has many including the Infovis Toolkit. There's a previous question about javascript implementations here, and even Boost includes functionality in their graph library.
发布评论
评论（1）
您可以查看“力定向图”，这是图放置算法的通用术语，该算法使用连接节点的吸引力模型和未连接节点的排斥力模型。
如果您搜索任何主流语言和“图形布局”，您一定会找到实现此算法的工具包。 Java 有很多，包括 Infovis Toolkit。之前有一个关于 javascript 实现的问题此处，甚至 Boost 也在其图形库中包含了功能。
You could look into "force directed graphs", which is the general term for graph placement algorithms which use a model of attraction for connected nodes and repulsion for unconnected nodes.
If you search for any mainstream language and "graph layout" you're sure to find toolkits that implement this algorithm. Java has many including the Infovis Toolkit. There's a previous question about javascript implementations here, and even Boost includes functionality in their graph library.