|
GraphTheory[BipartiteMatching]
|
|
Calling Sequence
|
|
BipartiteMatching(G)
|
|
|
Parameters
|
|
|
G
|
-
|
undirected unweighted bipartite graph
|
|
|
|
|
|
Description
|
|
|
•
|
BipartiteMatching('G') returns the size of a maximum matching in a bipartite graph G. It also returns the set of edges of one maximum matching.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
Draw the matching in red
|
>
|
![HighlightEdges(G, B[2])](/support/helpjp/helpview.aspx?si=6027/file01776/math65.png)
|
|
>
|
|
|
|
Download Help Document
Was this information helpful?
