o ßË·eÌã@s<ddlZddlZdd„Zdd„Zdd„Zdd „Zd d „ZdS) éNcCsHt dd¡}t |¡}t ||¡sJ‚tj|dd}t ||¡s"J‚dS)Nédgš™™™™™¹?r©Ú start_with)ÚnxÚgnp_random_graphÚdominating_setÚis_dominating_set©ÚGÚD©r ú`/var/www/ideatree/venv/lib/python3.10/site-packages/networkx/algorithms/tests/test_dominating.pyÚtest_dominating_sets  rcCsDt 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)rÚcomplete_graphÚlenr)ÚK4ÚK5r r r Ú test_completes  rcCsJt tj¡t d¡}tj|dd}WdƒdS1swYdS)Nré r)ÚpytestÚraisesrÚ NetworkXErrorÚ path_graphrr r r r Útest_raise_dominating_sets "þrcCsTt d¡}ddh}t ||¡sJ‚ddh}t ||¡sJ‚dh}t ||¡r(J‚dS)Nrréré)rrr)r Údr r r Útest_is_dominating_sets r cCsXt 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>rrrrrrN)rÚ cycle_graphÚadd_edges_fromr)r r r r Ú test_wikipedia_is_dominating_set(s r#)rÚnetworkxrrrrr r#r r r r Ús