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.

DetailsDetails

  • MaximalIndependentEdgeSet functionality is now available in the built-in Wolfram Language function FindIndependentEdgeSet.
  • To use , you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
  • 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:
  • WeightedFalsewhether edges with higher weights are preferred when forming the maximal independent edge set

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

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 shows that the maximal independent edge set contains three edges:

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

has been superseded by FindIndependentEdgeSet:

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