Module Expr Str Import alias Import alias identifier ImportFrom alias ImportFrom alias ImportFrom alias ImportFrom alias ImportFrom alias ClassDef bases body Expr Str FunctionDef arguments args NameParam defaults body Expr Str Assign NameStore ListLoad TupleLoad Num Num TupleLoad Num Num TupleLoad Num Num TupleLoad Num Num TupleLoad Num Num TupleLoad Num Num TupleLoad Num Num TupleLoad Num Num Assign AttributeStore NameLoad attr Call AttributeLoad NameLoad attr Expr Call AttributeLoad AttributeLoad NameLoad attr attr Call NameLoad Num Expr Call AttributeLoad AttributeLoad NameLoad attr attr NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str Assign NameStore NameLoad Assign NameStore Call NameLoad Call AttributeLoad NameLoad attr Call AttributeLoad NameLoad attr Assert CompareEq NameLoad BinOpSub Call NameLoad Call NameLoad Num Set Num Num Assert Call NameLoad GeneratorExp CompareEq NameLoad SubscriptLoad NameLoad Index SubscriptLoad NameLoad Index NameLoad comprehension NameStore Call NameLoad Num CompareIn NameLoad NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str Assert CompareEq Call NameLoad NameLoad Num For TupleStore NameStore NameStore Call AttributeLoad AttributeLoad NameLoad attr attr body Assert BoolOpOr CompareIn NameLoad NameLoad CompareIn NameLoad NameLoad decorator_list FunctionDef arguments args NameParam defaults body Expr Str Expr Call AttributeLoad NameLoad attr Call NameLoad AttributeLoad NameLoad attr decorator_list FunctionDef arguments args NameParam defaults body Expr Str Expr Call AttributeLoad NameLoad attr Call NameLoad AttributeLoad NameLoad attr decorator_list FunctionDef arguments args NameParam defaults body Expr Str Assign NameStore Call NameLoad AttributeLoad NameLoad attr Assign NameStore Call NameLoad AttributeLoad NameLoad attr NameLoad Expr Call AttributeLoad NameLoad attr NameLoad decorator_list decorator_list FunctionDef arguments args defaults body Expr Str Assign NameStore Call AttributeLoad NameLoad attr Expr Call AttributeLoad NameLoad attr ListLoad Str Num Num Num keyword Num Expr Call AttributeLoad NameLoad attr ListLoad Num Str Str keyword Num Expr Call AttributeLoad NameLoad attr ListLoad TupleLoad Str Num TupleLoad Str Str TupleLoad Num Str TupleLoad Num Str TupleLoad Num Str TupleLoad Num Num Assign NameStore Call NameLoad NameLoad Expr Call NameLoad CompareEq Call NameLoad NameLoad Call NameLoad Call NameLoad NameLoad Assert Call NameLoad GeneratorExp CompareIn NameLoad Call NameLoad Call AttributeLoad NameLoad attr comprehension NameStore Call NameLoad Call AttributeLoad NameLoad attr decorator_list
N/A N/A Unit tests for the :mod:`networkx.algorithms.bipartite.matching` module. N/A itertools N/A networkx nx nose.tools assert_true networkx.algorithms.bipartite.matching eppstein_matching networkx.algorithms.bipartite.matching hopcroft_karp_matching networkx.algorithms.bipartite.matching maximum_matching networkx.algorithms.bipartite.matching to_vertex_cover TestMatching N/A N/A N/A Tests for bipartite matching algorithms. setup N/A N/A self N/A N/A N/A Creates a bipartite graph for use in testing matching algorithms.

        The bipartite graph has a maximum cardinality matching that leaves
        vertex 1 and vertex 10 unmatched. The first six numbers are the left
        vertices and the next six numbers are the right vertices.

         N/A edges N/A N/A 0 7 N/A 0 8 N/A 2 6 N/A 2 9 N/A 3 8 N/A 4 8 N/A 4 9 N/A 5 11 N/A N/A self graph N/A N/A nx Graph N/A N/A N/A N/A self graph add_nodes_from N/A range 12 N/A N/A N/A N/A self graph add_edges_from edges N/A check_match N/A N/A self matching N/A N/A N/A Asserts that the matching is what we expect from the bipartite graph
        constructed in the :meth:`setup` fixture.

         N/A M matching N/A matched_vertices N/A frozenset N/A N/A itertools chain N/A N/A M items N/A N/A matched_vertices N/A N/A frozenset N/A range 12 N/A 1 10 N/A N/A all N/A N/A u N/A M N/A N/A M N/A u N/A u N/A range 12 N/A u M N/A check_vertex_cover N/A N/A self vertices N/A N/A N/A Asserts that the given set of vertices is the vertex cover we
        expected from the bipartite graph constructed in the :meth:`setup`
        fixture.

         N/A N/A N/A len vertices 5 N/A N/A u v N/A N/A N/A self graph edges N/A N/A N/A N/A u vertices N/A v vertices N/A test_eppstein_matching N/A N/A self N/A N/A N/A Tests that David Eppstein's implementation of the Hopcroft--Karp
        algorithm produces a maximum cardinality matching.

         N/A N/A N/A self check_match N/A eppstein_matching N/A self graph N/A test_hopcroft_karp_matching N/A N/A self N/A N/A N/A Tests that the Hopcroft--Karp algorithm produces a maximum
        cardinality matching in a bipartite graph.

         N/A N/A N/A self check_match N/A hopcroft_karp_matching N/A self graph N/A test_to_vertex_cover N/A N/A self N/A N/A N/A Test for converting a maximum matching to a minimum vertex cover. N/A matching N/A maximum_matching N/A self graph N/A vertex_cover N/A to_vertex_cover N/A self graph matching N/A N/A N/A self check_vertex_cover vertex_cover N/A N/A test_eppstein_matching N/A N/A N/A N/A N/A Test in accordance to issue #1927 N/A G N/A N/A nx Graph N/A N/A N/A G add_nodes_from N/A a 2 3 4 bipartite 0 N/A N/A N/A G add_nodes_from N/A 1 b c bipartite 1 N/A N/A N/A G add_edges_from N/A N/A a 1 N/A a b N/A 2 b N/A 2 c N/A 3 c N/A 4 1 N/A matching N/A eppstein_matching G N/A N/A assert_true N/A N/A len matching N/A len N/A maximum_matching G N/A N/A all N/A N/A x N/A set N/A N/A matching keys N/A x N/A set N/A N/A matching values N/A