You should download the PDF documentation which is available here. On page 222 there are 3 listed:
- matching() Return a maximum weighted matching of the graph represented by the list of its edges.
- has_perfect_matching() Return whether this graph has a perfect matching
- perfect_matchings() Return an iterator over all perfect matchings of the graph.
Clicking on each method will bring you to more instructions and examples.