(self)
return self._graph._is_maximal_matching(self._matching, types=self._types)
Returns whether the matching is maximal.

        A matching is maximal when it is not possible to extend it any more
        with extra edges; in other words, unmatched vertices in the graph
        must be adjacent to matched vertices only.
Returns whether the matching is maximal.
Returns whether the matching is maximal .
def is_maximal(self):
        """Returns whether the matching is maximal.

        A matching is maximal when it is not possible to extend it any more
        with extra edges; in other words, unmatched vertices in the graph
        must be adjacent to matched vertices only.
        """
        return self._graph._is_maximal_matching(self._matching, types=self._types)
def is_maximal ( self ) : return self . _graph . _is_maximal_matching ( self . _matching , types = self . _types )