Mercurial > repos > shellac > sam_consensus_v3
view env/lib/python3.9/site-packages/networkx/algorithms/bipartite/tests/test_covering.py @ 0:4f3585e2f14b draft default tip
"planemo upload commit 60cee0fc7c0cda8592644e1aad72851dec82c959"
author | shellac |
---|---|
date | Mon, 22 Mar 2021 18:12:50 +0000 |
parents | |
children |
line wrap: on
line source
import networkx as nx import networkx.algorithms.bipartite as bipartite class TestMinEdgeCover: """Tests for :func:`networkx.algorithms.bipartite.min_edge_cover`""" def test_empty_graph(self): G = nx.Graph() assert bipartite.min_edge_cover(G) == set() def test_graph_single_edge(self): G = nx.Graph() G.add_edge(0, 1) assert bipartite.min_edge_cover(G) == {(0, 1), (1, 0)} def test_bipartite_default(self): G = nx.Graph() G.add_nodes_from([1, 2, 3, 4], bipartite=0) G.add_nodes_from(["a", "b", "c"], bipartite=1) G.add_edges_from([(1, "a"), (1, "b"), (2, "b"), (2, "c"), (3, "c"), (4, "a")]) min_cover = bipartite.min_edge_cover(G) assert nx.is_edge_cover(G, min_cover) assert len(min_cover) == 8 def test_bipartite_explicit(self): G = nx.Graph() G.add_nodes_from([1, 2, 3, 4], bipartite=0) G.add_nodes_from(["a", "b", "c"], bipartite=1) G.add_edges_from([(1, "a"), (1, "b"), (2, "b"), (2, "c"), (3, "c"), (4, "a")]) min_cover = bipartite.min_edge_cover(G, bipartite.eppstein_matching) assert nx.is_edge_cover(G, min_cover) assert len(min_cover) == 8