MaximalBipartiteMatching

MaximalBipartiteMatching[g]
gives the maximal matching of the bipartite graph g.

更多信息更多信息

  • To use , you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
  • gives a maximal set of nonadjacent edges between the two vertex sets of the bipartite graph.
  • The bipartite graph represented by an matrix consists of the row and column vertex sets and C={1, 2, ..., n}, with a vertex iR and jC connected if the matrix element .
  • The bipartite graph represented by a rule list consists of vertex sets R=Union[{i1, i2, ...}] and C=Union[{j1, j2, ...}], with a vertex iR and jC connected if the rule is included in the rule list.
  • returns a list of index pairs , where the number of pairs k is not larger than either vertex set.

范例范例打开所有单元关闭所有单元

基本范例 (1)基本范例 (1)

In[1]:=
Click for copyable input

A bipartite graph describing acceptable drinks for four people:

In[2]:=
Click for copyable input

The drink each person should have, if no two people are to have the same drink:

In[3]:=
Click for copyable input
Out[3]=
New to Mathematica? Find your learning path »
Have a question? Ask support »