Graph Utilities Package >

CommunityStructurePartition

CommunityStructurePartition[g]
gives the partition of a graph g into communities.
  • 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
© 2008 Wolfram Research, Inc. japanese.gif
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team