Mercurial > repos > shellac > sam_consensus_v3
comparison env/lib/python3.9/site-packages/networkx/algorithms/approximation/tests/test_vertex_cover.py @ 0:4f3585e2f14b draft default tip
"planemo upload commit 60cee0fc7c0cda8592644e1aad72851dec82c959"
author | shellac |
---|---|
date | Mon, 22 Mar 2021 18:12:50 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
-1:000000000000 | 0:4f3585e2f14b |
---|---|
1 import networkx as nx | |
2 from networkx.algorithms.approximation import min_weighted_vertex_cover | |
3 | |
4 | |
5 def is_cover(G, node_cover): | |
6 return all({u, v} & node_cover for u, v in G.edges()) | |
7 | |
8 | |
9 class TestMWVC: | |
10 """Unit tests for the approximate minimum weighted vertex cover | |
11 function, | |
12 :func:`~networkx.algorithms.approximation.vertex_cover.min_weighted_vertex_cover`. | |
13 | |
14 """ | |
15 | |
16 def test_unweighted_directed(self): | |
17 # Create a star graph in which half the nodes are directed in | |
18 # and half are directed out. | |
19 G = nx.DiGraph() | |
20 G.add_edges_from((0, v) for v in range(1, 26)) | |
21 G.add_edges_from((v, 0) for v in range(26, 51)) | |
22 cover = min_weighted_vertex_cover(G) | |
23 assert 2 == len(cover) | |
24 assert is_cover(G, cover) | |
25 | |
26 def test_unweighted_undirected(self): | |
27 # create a simple star graph | |
28 size = 50 | |
29 sg = nx.star_graph(size) | |
30 cover = min_weighted_vertex_cover(sg) | |
31 assert 2 == len(cover) | |
32 assert is_cover(sg, cover) | |
33 | |
34 def test_weighted(self): | |
35 wg = nx.Graph() | |
36 wg.add_node(0, weight=10) | |
37 wg.add_node(1, weight=1) | |
38 wg.add_node(2, weight=1) | |
39 wg.add_node(3, weight=1) | |
40 wg.add_node(4, weight=1) | |
41 | |
42 wg.add_edge(0, 1) | |
43 wg.add_edge(0, 2) | |
44 wg.add_edge(0, 3) | |
45 wg.add_edge(0, 4) | |
46 | |
47 wg.add_edge(1, 2) | |
48 wg.add_edge(2, 3) | |
49 wg.add_edge(3, 4) | |
50 wg.add_edge(4, 1) | |
51 | |
52 cover = min_weighted_vertex_cover(wg, weight="weight") | |
53 csum = sum(wg.nodes[node]["weight"] for node in cover) | |
54 assert 4 == csum | |
55 assert is_cover(wg, cover) |