 |
BUILT-IN MATHEMATICA SYMBOL
FindGraphPartition
FindGraphPartition[g]
gives a partition of vertices of the graph g.
FindGraphPartition[g, k]
gives a partition of vertices into k approximately equal-size parts.
FindGraphPartition[g, {n1, ..., nk}]
gives a partition of vertices into parts with sizes 
, ..., 
.
FindGraphPartition[g, {
1, ..., k}]
gives a partition of vertices into parts with approximate size proportions 
, ..., 
.
Details
- FindGraphPartition finds a partition of vertices such that the number of edges having endpoints in different parts is minimized.
- FindGraphPartition[g] is equivalent to FindGraphPartition[g, 2].
- FindGraphPartition treats graphs as undirected simple graphs.
- For a weighted graph, FindGraphPartition finds a partition such that the sum of edge weights for edges having endpoints in different parts is minimized.
- FindGraphPartition[g, {1, ..., k}] will give a partition where the size of a part is given by the sum of its vertex weights.
- The partitions are ordered by their length with the largest part first.
New in 9
