+ jf&Rt^RIt!RR4tR#)z@Unit tests for the :mod:`networkx.algorithms.efficiency` module.NcPa]tRt^toRtRtRtRtRtRt Rt Rt R t Vt R #) TestEfficiencyc\P!4VnVPP.RO4\P!^4Vn\P !^^4VnR#)N)r)nxGraphG1add_nodes_from cycle_graphG2lollipop_graphG3selfs&j/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/algorithms/tests/test_efficiency.py setup_methodTestEfficiency.setup_methodsE((* y)..###Aq)c X\P!VP^^4^8XgQhR#)z. When nodes are disconnected, efficiency is 0 N)r efficiencyr rs&r"test_efficiency_disconnected_nodes1TestEfficiency.test_efficiency_disconnected_nodess#}}TWWa+q000rc T\P!VP4^8XgQhR#)z- In a disconnected graph the efficiency is 0 N)rlocal_efficiencyr rs&r(test_local_efficiency_disconnected_graph7TestEfficiency.test_local_efficiency_disconnected_graphs!""477+q000rc\P!VP^^4^8XgQh\P!VP^^4R8XgQhR#)Ng?)rrr rs&rtest_efficiencyTestEfficiency.test_efficiencys@}}TWWa+q000}}TWWa+u444rcT\P!VP4R8XgQhR#)Ng?)rglobal_efficiencyr rs&rtest_global_efficiency%TestEfficiency.test_global_efficiency s##DGG,555rc \^^ 4F6p\P!V4p\P!V4^8XdK6Qh R#)zH Tests that the average global efficiency of the complete graph is one. N)rangercomplete_graphr$rnGs& r%test_global_efficiency_complete_graph4TestEfficiency.test_global_efficiency_complete_graph#s=q"A!!!$A''*a/ //rc \^^ 4F6p\P!V4p\P!V4^8XdK6Qh R#)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. N)r(rr)rr*s& r$test_local_efficiency_complete_graph3TestEfficiency.test_local_efficiency_complete_graph+s= q"A!!!$A&&q)Q. ..rc T\P!VP4R8XgQhR#)zp Test that the ego graph is used when computing local efficiency. For more information, see GitHub issue #2710. Ng?)rrrrs&rtest_using_ego_graph#TestEfficiency.test_using_ego_graph5s! ""477+v555r)r r rN)__name__ __module__ __qualname____firstlineno__rrrr r%r-r0r3__static_attributes____classdictcell__) __classdict__s@rrrs2*1 1 560/66rr)__doc__networkxrrrrr?sF4646r