CommunityStructurePartition
GraphUtilities`
GraphUtilities`
CommunityStructurePartition
As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. »
CommunityStructurePartition[g]
gives the partition of a graph g into communities.
更多信息和选项
- CommunityStructurePartition functionality is now available in the built-in Wolfram Language function FindGraphCommunities.
- To use CommunityStructurePartition, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- The partition groups the vertices into communities, such that there is a higher density of edges within communities than between them.
- The following option can be given:
-
Weighted False whether edges with higher weights are preferred during matching
范例
打开所有单元 关闭所有单元基本范例 (2)
This finds that the network is grouped into two communities:
CommunityStructurePartition has been superseded by FindGraphCommunities:
Wolfram Research (2007)，CommunityStructurePartition，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/CommunityStructurePartition.html.
文本
Wolfram Research (2007)，CommunityStructurePartition，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/CommunityStructurePartition.html.
CMS
Wolfram 语言. 2007. "CommunityStructurePartition." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/CommunityStructurePartition.html.
APA
Wolfram 语言. (2007). CommunityStructurePartition. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/GraphUtilities/ref/CommunityStructurePartition.html 年