def check_vertex_cover(self, vertices):
        # 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
        # TODO Assert that the vertices are the correct ones.
Asserts that the given set of vertices is the vertex cover we
dataset/ETHPy150Open networkx/networkx/networkx/algorithms/bipartite/tests/test_matching.py/TestMatching.check_vertex_cover