D^(hf$dZddlZGddZy)z@Unit tests for the :mod:`networkx.algorithms.efficiency` module.Nc<eZdZdZdZdZdZdZdZdZ dZ y ) TestEfficiencyctj|_|jjgdtjd|_tj dd|_y)N)rr)nxGraphG1add_nodes_from cycle_graphG2lollipop_graphG3selfs g/var/www/skyplay_api_hub/venv/lib/python3.12/site-packages/networkx/algorithms/tests/test_efficiency.py setup_methodzTestEfficiency.setup_methodsE((* y)..###Aq)cPtj|jdddk(sJy)z> When nodes are disconnected, efficiency is 0 rrrN)r efficiencyr rs r"test_efficiency_disconnected_nodesz1TestEfficiency.test_efficiency_disconnected_nodess#}}TWWa+q000rcLtj|jdk(sJy)z= In a disconnected graph the efficiency is 0 rN)r local_efficiencyr rs r(test_local_efficiency_disconnected_graphz7TestEfficiency.test_local_efficiency_disconnected_graphs!""477+q000rctj|jdddk(sJtj|jdddk(sJy)Nrrrg?)r rrrs rtest_efficiencyzTestEfficiency.test_efficiencys@}}TWWa+q000}}TWWa+u444rcLtj|jdk(sJy)Ng?)r global_efficiencyrrs rtest_global_efficiencyz%TestEfficiency.test_global_efficiency s##DGG,555rctddD]1}tj|}tj|dk(r1Jy)zX Tests that the average global efficiency of the complete graph is one. r rN)ranger complete_graphr rnGs r%test_global_efficiency_complete_graphz4TestEfficiency.test_global_efficiency_complete_graph#sBq" 0A!!!$A''*a/ // 0rctddD]1}tj|}tj|dk(r1Jy)z Test that the local efficiency for a complete graph with at least 3 nodes should be one. For a graph with only 2 nodes, the induced subgraph has no edges. rr#rN)r$r r%rr&s r$test_local_efficiency_complete_graphz3TestEfficiency.test_local_efficiency_complete_graph+sB q" /A!!!$A&&q)Q. .. /rcLtj|jdk(sJy)z Test that the ego graph is used when computing local efficiency. For more information, see GitHub issue #2710. g?N)r rrrs rtest_using_ego_graphz#TestEfficiency.test_using_ego_graph5s! ""477+v555rN) __name__ __module__ __qualname__rrrrr!r)r+r-rrrrs**1 1 560/6rr)__doc__networkxr rr1rrr4sF4646r