CommunityStructurePartition

CommunityStructurePartition[g]
gives the partition of a graph g into communities.

更多信息更多信息

  • To use , 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:
  • WeightedFalsewhether edges with higher weights are preferred during matching

范例范例打开所有单元关闭所有单元

基本范例 (1)基本范例 (1)

This defines a small graph:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=

This finds that the network is grouped into two communities:

In[3]:=
Click for copyable input
Out[3]=
New to Mathematica? Find your learning path »
Have a question? Ask support »