示例#1
0
 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
 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_true(nx.is_edge_cover(G, min_cover))
     assert_equal(len(min_cover), 8)
示例#3
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_true(nx.is_edge_cover(G, min_cover))
     assert_equal(len(min_cover), 8)
示例#4
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_graph_single_edge(self):
     G = nx.Graph()
     G.add_edge(0, 1)
     assert_equal(bipartite.min_edge_cover(G), {(0, 1), (1, 0)})
 def test_empty_graph(self):
     G = nx.Graph()
     assert_equal(bipartite.min_edge_cover(G), set())
示例#7
0
 def test_graph_single_edge(self):
     G = nx.Graph()
     G.add_edge(0, 1)
     assert_equal(bipartite.min_edge_cover(G),
                  {(0, 1), (1, 0)})
示例#8
0
 def test_empty_graph(self):
     G = nx.Graph()
     assert_equal(bipartite.min_edge_cover(G), set())
示例#9
0
 def test_empty_graph(self):
     G = nx.Graph()
     assert bipartite.min_edge_cover(G) == set()
示例#10
0
def edgeCover():
    st = bipartite.min_edge_cover(g)
    messagebox.showinfo("Info", "Set of Edges are {}".format(st))