Mercurial > repos > shellac > sam_consensus_v3
view env/lib/python3.9/site-packages/networkx/algorithms/tests/test_dominating.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 pytest import networkx as nx def test_dominating_set(): G = nx.gnp_random_graph(100, 0.1) D = nx.dominating_set(G) assert nx.is_dominating_set(G, D) D = nx.dominating_set(G, start_with=0) assert nx.is_dominating_set(G, D) def test_complete(): """ In complete graphs each node is a dominating set. Thus the dominating set has to be of cardinality 1. """ K4 = nx.complete_graph(4) assert len(nx.dominating_set(K4)) == 1 K5 = nx.complete_graph(5) assert len(nx.dominating_set(K5)) == 1 def test_raise_dominating_set(): with pytest.raises(nx.NetworkXError): G = nx.path_graph(4) D = nx.dominating_set(G, start_with=10) def test_is_dominating_set(): G = nx.path_graph(4) d = {1, 3} assert nx.is_dominating_set(G, d) d = {0, 2} assert nx.is_dominating_set(G, d) d = {1} assert not nx.is_dominating_set(G, d) def test_wikipedia_is_dominating_set(): """Example from https://en.wikipedia.org/wiki/Dominating_set """ G = nx.cycle_graph(4) G.add_edges_from([(0, 4), (1, 4), (2, 5)]) assert nx.is_dominating_set(G, {4, 3, 5}) assert nx.is_dominating_set(G, {0, 2}) assert nx.is_dominating_set(G, {1, 2})