ó žÃÒYc@snddlmZmZmZmZddlZd„Zd„Zeej ƒd„ƒZ d„Z d„Z dS(iÿÿÿÿ(t assert_equalt assert_truet assert_falsetraisesNcCsftjddƒ}tj|ƒ}ttj||ƒƒtj|ddƒ}ttj||ƒƒdS(Nidgš™™™™™¹?t start_withi(tnxtgnp_random_graphtdominating_setRtis_dominating_set(tGtD((s/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/tests/test_dominating.pyttest_dominating_sets cCsZtjdƒ}tttj|ƒƒdƒtjdƒ}tttj|ƒƒdƒdS(ss In complete graphs each node is a dominating set. Thus the dominating set has to be of cardinality 1. iiiN(Rtcomplete_graphRtlenR(tK4tK5((s/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/tests/test_dominating.pyt test_complete scCs(tjdƒ}tj|ddƒ}dS(NiRi (Rt path_graphR(R R ((s/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/tests/test_dominating.pyttest_raise_dominating_setscCsˆtjdƒ}tddgƒ}ttj||ƒƒtddgƒ}ttj||ƒƒtdgƒ}ttj||ƒƒdS(Niiiii(RRtsetRRR(R td((s/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/tests/test_dominating.pyttest_is_dominating_setscCs’tjdƒ}|jdd d gƒttj|tdddgƒƒƒttj|tddgƒƒƒttj|tddgƒƒƒdS( s>Example from https://en.wikipedia.org/wiki/Dominating_set iiiiiiN(ii(ii(ii(Rt cycle_graphtadd_edges_fromRRR(R ((s/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/tests/test_dominating.pyt test_wikipedia_is_dominating_set's %"( t nose.toolsRRRRtnetworkxRR Rt NetworkXErrorRRR(((s/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/tests/test_dominating.pyts "