class_docstr: Tests for bipartite matching algorithms.
class_docstr_tok: ["Tests","for","bipartite","matching","algorithms","."]
docstr: Asserts that the given set of vertices is the vertex cover we
  expected from the bipartite graph constructed in the :meth:`setup`
  fixture.
docstr_tok: ["Asserts","that","the","given","set","of","vertices","is","the","vertex","cover","we","expected","from","the","bipartite","graph","constructed","in","the",":","meth",":","`","setup","`","fixture","."]
code: def check_vertex_cover(self, vertices):
      """Asserts that the given set of vertices is the vertex cover we
      expected from the bipartite graph constructed in the :meth:`setup`
      fixture.
  
      """
      # By Konig's theorem, the number of edges in a maximum matching equals
      # the number of vertices in a minimum vertex cover.
      assert len(vertices) == 5
      # Assert that the set is truly a vertex cover.
      for u, v in self.graph.edges():
          assert u in vertices or v in vertices
  
imports: import itertools
  import pytest
  import networkx
  from networkx.algorithms.bipartite.matching import eppstein_matching, hopcroft_karp_matching, maximum_matching, minimum_weight_full_matching, to_vertex_cover
label_desc: Use image node_id 3 for calling the TestMatching obj's underlying member method code with example usage: obj.check_vertex_cover(vertices) without return types