a Ьч1b╦у@s<ddlZddlZddДZddДZddДZdd ДZd dДZdS)щNcCsHtаddб}tа|б}tа||бs&JВtj|ddН}tа||бsDJВdS)NщdgЪЩЩЩЩЩ╣?rйZ start_with)┌nxZgnp_random_graph┌dominating_set┌is_dominating_setй┌G┌Dйr ·Hlib/python3.9/site-packages/networkx/algorithms/tests/test_dominating.py┌test_dominating_sets rcCsDtаdб}ttа|бГdks JВ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_complete s rcCsHtаtjбП(tаdб}tj|ddН}WdГn1s:0YdS)Nr щ r)┌pytestZraisesrZ NetworkXError┌ path_graphrrr r r┌test_raise_dominating_sets rcCsTtаdб}ddh}tа||бs"JВddh}tа||бs:JВdh}tа||бrPJВdS)Nr rщrщ)rrr)r┌dr r r┌test_is_dominating_sets rcCsXtаdб}|аgdвбtа|hdгбs,JВtа|ddhбs@JВtа|ddhбsTJВdS)z9Example from https://en.wikipedia.org/wiki/Dominating_setr ))rr )rr )rr>rr rrrrN)rZcycle_graphZadd_edges_fromr)rr r r┌ test_wikipedia_is_dominating_set's r)rZnetworkxrrrrrrr r r r┌s