Enable JavaScript to interact with content and submit forms on Wolfram websites. Learn how

Wolfram Language & System Documentation Center

MaximalIndependentEdgeSet

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 and Options

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)

This defines a small graph:

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

MaximalIndependentEdgeSet has been superseded by FindIndependentEdgeSet:

Top