o ъкЇedЦ@sddlZGdd└d┐ZdS)ИNc@s<eZdZdd└Zdd└Zdd└Zdd└Zd d └Zdd└Zd S)зTestClosenessVitalitycCs,t═d║}t═|║}|dddd°ksJ┌dS)NИИ╘rИr)зnxзcycle_graphзcloseness_vitality╘зselfзGзvitality╘rЗ^/var/www/ideatree/venv/lib/python3.10/site-packages/networkx/algorithms/tests/test_vitality.pyзtest_unweighteds z%TestClosenessVitality.test_unweightedcCsBt═║}tj|gd╒dd█tj|dd█}|dddd°ksJ┌dS)Nrr╘зweightrИ)rзGraphз add_cycler r rrrз test_weighted sz#TestClosenessVitality.test_weightedcCs2t═t═d║║}t═|║}|dddd°ksJ┌dS)Nrrr)rзDiGraphrr r rrrзtest_unweighted_digraphs z-TestClosenessVitality.test_unweighted_digraphcCСVt═║}tj|gd╒dd█tj|gd╒dd█tj|dd█}|dddd°ks)J┌dS╘Nrrr)rrrrИ)rrrr r rrrзtest_weighted_digraphС z+TestClosenessVitality.test_weighted_digraphcCrr)rзMultiDiGraphrr r rrrзtest_weighted_multidigraphrz0TestClosenessVitality.test_weighted_multidigraphcCs*t═d║}tj|dd█td┐ksJ┌dS)zwTests that the closeness vitality of a node whose removal disconnects the graph is negative infinity. rr)зnodeзinfN)rз path_graphr зfloat)rrrrrзtest_disconnecting_graph#s z.TestClosenessVitality.test_disconnecting_graphN) з__name__з __module__з__qualname__rrrrrr$rrrrrsr)зnetworkxrrrrrrзs