This is documentation for Mathematica 6, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)


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