o ]ZŽhÌã@s<ddlZddlZdd„Zdd„Zdd„Zdd „Zd d „ZdS) éNcCsHt dd¡}t |¡}t ||¡sJ‚tj|dd}t ||¡s"J‚dS)Nédgš™™™™™¹?r©Z start_with)ÚnxZgnp_random_graphÚdominating_setÚis_dominating_set©ÚGÚD©r úX/var/www/auris/lib/python3.10/site-packages/networkx/algorithms/tests/test_dominating.pyÚtest_dominating_sets  r cCsDt d¡}tt |¡ƒdksJ‚t d¡}tt |¡ƒdks J‚dS)znIn complete graphs each node is a dominating set. Thus the dominating set has to be of cardinality 1. éééN)rZcomplete_graphÚlenr)ZK4ZK5r r r Ú test_completes  rcCsJt tj¡t d¡}tj|dd}WdƒdS1swYdS)Nr é r)ÚpytestZraisesrZ NetworkXErrorÚ path_graphrrr r r Útest_raise_dominating_sets "þrcCsTt d¡}ddh}t ||¡sJ‚ddh}t ||¡sJ‚dh}t ||¡r(J‚dS)Nr réré)rrr)rÚdr r r Útest_is_dominating_sets rcCsXt d¡}| gd¢¡t |hd£¡sJ‚t |ddh¡s J‚t |ddh¡s*J‚dS)z9Example from https://en.wikipedia.org/wiki/Dominating_setr ))rr )rr )rr>rr rrrrN)rZ cycle_graphZadd_edges_fromr)rr r r Ú test_wikipedia_is_dominating_set(s r)rZnetworkxrr rrrrr r r r Ús