GraphUtilities`
GraphUtilities`

MaximalIndependentEdgeSet

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

MaximalIndependentEdgeSet[g]

gives a maximal independent edge set of an undirected graph g.

Details

• MaximalIndependentEdgeSet functionality is now available in the built-in Wolfram Language function FindIndependentEdgeSet.
• To use MaximalIndependentEdgeSet, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
• MaximalIndependentEdgeSet gives an approximate maximal set of pairwise nonadjacent edges of g.
• A maximal independent edge set of a graph is also called a maximal matching.
• The following option can be given:
•  Weighted False whether edges with higher weights are preferred when forming the maximal independent edge set

Examples

Basic Examples(2)

 In[1]:=

This defines a small graph:

 In[2]:=
 In[3]:=
 Out[3]=

This shows that the maximal independent edge set contains three edges:

 In[4]:=
 Out[4]=

MaximalIndependentEdgeSet has been superseded by FindIndependentEdgeSet:

 In[1]:=
 In[2]:=
 Out[2]=
 In[3]:=
 Out[3]=