Graph Utilities Package
GRAPH UTILITIES PACKAGE SYMBOL

MinCut


partitions the undirected graph g into k parts where the number of edge cuts is approximately minimized.

DetailsDetails

  • To use , you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
  • treats the input as an undirected graph, and tries to find a partition of the vertices into k parts so that each part has roughly the same number of vertices, and so that the number of edges between these parts (known as the edge separator) is minimized.

ExamplesExamplesopen allclose all

Basic Examples (1)Basic Examples (1)

In[1]:=
Click for copyable input

This defines a small graph:

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

This partitions the vertices into two parts with the minimum number of edge cuts:

In[4]:=
Click for copyable input
Out[4]=

This plots the graph with partitions, with one part colored red and the other colored green:

In[5]:=
Click for copyable input
Out[5]=

Scope (1)Scope (1)

Applications (1)Applications (1)

Top
Send Feedback
Mathematica 9 is now available!

400+ new features, including the new Wolfram Predictive Interface, social network analysis, enterprise CDF deployment, and more »

Try Now
Buy/Upgrade
New to Mathematica? Find your learning path »
Have a question? Ask support »