class_docstr: A matching of vertices in a graph.
  
  A matching of an undirected graph is a set of edges such that each
  vertex is incident on at most one matched edge. When each vertex is
  incident on I{exactly} one matched edge, the matching called
  I{perfect}. This class is used in C{igraph} to represent non-perfect
  and perfect matchings in undirected graphs.
  
  This class is usually not instantiated directly, everything
  is taken care of by the functions that return matchings.
  
  Examples:
  
    >>> from igraph import Graph
    >>> g = Graph.Famous("noperfectmatching")
    >>> matching = g.maximum_matching()
class_docstr_tok: ["A","matching","of","vertices","in","a","graph",".","A","matching","of","an","undirected","graph","is","a","set","of","edges","such","that","each","vertex","is","incident","on","at","most","one","matched","edge",".","When","each","vertex","is","incident","on","I","{","exactly","}","one","matched","edge",",","the","matching","called","I","{","perfect","}",".","This","class","is","used","in","C","{","igraph","}","to","represent","non-perfect","and","perfect","matchings","in","undirected","graphs",".","This","class","is","usually","not","instantiated","directly",",","everything","is","taken","care","of","by","the","functions","that","return","matchings",".","Examples",":",">",">",">","from","igraph","import","Graph",">",">",">","g","=","Graph.Famous","(","``","noperfectmatching","''",")",">",">",">","matching","=","g.maximum_matching","(",")"]
docstr: 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.
docstr_tok: ["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","."]
code: 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
      )
  
file_path: python-igraph/src/igraph/matching.py
imports: from igraph._igraph import Vertex
label_desc: Use image node_id 7 for calling the Matching obj's underlying member method code with example usage: obj.is_maximal() and returns: self