class_docstr: Tests for bipartite matching algorithms.
class_docstr_tok: ["Tests","for","bipartite","matching","algorithms","."]
docstr: Tests that the Hopcroft--Karp algorithm produces a maximum
  cardinality matching in a bipartite graph.
docstr_tok: ["Tests","that","the","Hopcroft","--","Karp","algorithm","produces","a","maximum","cardinality","matching","in","a","bipartite","graph","."]
code: def test_hopcroft_karp_matching(self):
      """Tests that the Hopcroft--Karp algorithm produces a maximum
      cardinality matching in a bipartite graph.
  
      """
      self.check_match(
          hopcroft_karp_matching(self.graph, self.top_nodes)
      )
  
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 5 for calling the TestMatching obj's underlying member method code with example usage: obj.test_hopcroft_karp_matching() without return types