This is documentation for Mathematica 6, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)


gives a maximal independent edge set of an undirected graph g.
  • MaximalIndependentEdgeSet gives an approximate maximal set of pairwise non-adjacent 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