Wolfram Language & System 10.3 (2015)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)


finds an independent edge set of the graph g with a maximum number of edges.

uses rules to specify the graph g.

Details and OptionsDetails and Options

  • An independent edge set is also known as a matching.
  • An independent edge set is a set of edges that are never incident to the same vertex.
  • FindIndependentEdgeSet returns a list of edges.
  • FindIndependentEdgeSet works with undirected graphs, directed graphs, weighted graphs, and multigraphs.
Introduced in 2010
| Updated in 2015