fif,dZddlZGddZdS)z@Unit tests for the :mod:`networkx.algorithms.efficiency` module.Nc>eZdZdZdZdZdZdZdZdZ dZ d S) TestEfficiencyctj|_|jgdtjd|_tjdd|_dS)N)rr)nxGraphG1add_nodes_from cycle_graphG2lollipop_graphG3selfs /var/www/development/aibuddy-work/election-extract/venv/lib/python3.11/site-packages/networkx/algorithms/tests/test_efficiency.py setup_methodzTestEfficiency.setup_methodsR(** yyy))).###Aq))cHtj|jdddksJdS)z> When nodes are disconnected, efficiency is 0 rrrN)r efficiencyr rs r"test_efficiency_disconnected_nodesz1TestEfficiency.test_efficiency_disconnected_nodess+}TWa++q000000rcDtj|jdksJdS)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("47++q000000rctj|jdddksJtj|jdddksJdS)Nrrrg?)r rrrs rtest_efficiencyzTestEfficiency.test_efficiencysJ}TWa++q0000}TWa++u444444rcDtj|jdksJdS)Ng?)r global_efficiencyrrs rtest_global_efficiencyz%TestEfficiency.test_global_efficiency s&#DG,,555555rctddD]0}tj|}tj|dksJ1dS)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#sTq" 0 0A!!$$A'**a///// 0 0rctddD]0}tj|}tj|dksJ1dS)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+sT q" / /A!!$$A&q))Q..... / /rcDtj|jdksJdS)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( "47++v555555rN) __name__ __module__ __qualname__rrrrr!r)r+r-rrrrs***111 111 555666000///66666rr)__doc__networkxr rr1rrr4sIFF46464646464646464646r