As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. >>


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


open allclose all

Basic Examples  (2)

This defines a small graph:

This finds that the network is grouped into two communities:

CommunityStructurePartition has been superseded by FindGraphCommunities:

Options  (1)

Weighted  (1)

This specifies a weighted graph:

This plots the graph with edge weights shown:

This finds the community structure, ignoring edge weights:

This finds the community structure, taking into account the edge weights: