U ?hÌã@s<ddlZddlZdd„Zdd„Zdd„Zdd „Zd d „ZdS) éNcCsHt dd¡}t |¡}t ||¡s&t‚tj|dd}t ||¡sDt‚dS)Nédgš™™™™™¹?r©Z start_with)ÚnxZgnp_random_graphÚdominating_setÚis_dominating_setÚAssertionError©ÚGÚD©r ú[/var/www/html/venv/lib/python3.8/site-packages/networkx/algorithms/tests/test_dominating.pyÚtest_dominating_sets   r cCsDt d¡}tt |¡ƒdks t‚t d¡}tt |¡ƒdks@t‚dS)znIn complete graphs each node is a dominating set. Thus the dominating set has to be of cardinality 1. éééN)rZcomplete_graphÚlenrr)ZK4ZK5r r r Ú test_completes  rc Cs4t tj¡t d¡}tj|dd}W5QRXdS)Nré r)ÚpytestZraisesrZ NetworkXErrorÚ path_graphrrr r r Útest_raise_dominating_sets rcCsTt d¡}ddh}t ||¡s"t‚ddh}t ||¡s:t‚dh}t ||¡rPt‚dS)Nrréré)rrrr)r Údr r r Útest_is_dominating_sets rcCs\t d¡}| dddg¡t |dddh¡s0t‚t |ddh¡sDt‚t |d dh¡sXt‚d S) z9Example from https://en.wikipedia.org/wiki/Dominating_setr)rr)rr)rrrrrrrN)rZ cycle_graphZadd_edges_fromrr)r r r r Ú test_wikipedia_is_dominating_set(s  r)rZnetworkxrr rrrrr r r r Ús