o ִi@s<ddlZddlZddZddZddZdd Zd d ZdS) NcCsHtdd}t|}t||sJtj|dd}t||s"JdS)Ndg?r start_with)nxgnp_random_graphdominating_setis_dominating_setGDr \/home/kuhnn/.local/lib/python3.10/site-packages/networkx/algorithms/tests/test_dominating.pytest_dominating_sets  rcCsDtd}tt|dksJtd}tt|dks JdS)znIn complete graphs each node is a dominating set. Thus the dominating set has to be of cardinality 1. N)rcomplete_graphlenr)K4K5r r r test_completes  rcCsJttjtd}tj|dd}WddS1swYdS)Nr r)pytestraisesr NetworkXError path_graphrr r r r test_raise_dominating_sets "rcCsTtd}ddh}t||sJddh}t||sJdh}t||r(JdS)Nrrr)rrr)r dr r r test_is_dominating_sets r cCsXtd}|gdt|hdsJt|ddhs Jt|ddhs*JdS)z9Example from https://en.wikipedia.org/wiki/Dominating_setr))rr)rr)rr>rrrrrrN)r cycle_graphadd_edges_fromr)r r r r test_wikipedia_is_dominating_set(s r#)rnetworkxrrrrr r#r r r r s