hf$SrSSKr"SS5rg)z@Unit tests for the :mod:`networkx.algorithms.efficiency` module.NcD\rSrSrSrSrSrSrSrSr Sr S r S r g ) TestEfficiencyc[R"5UlURR/SQ5 [R"S5Ul[R "SS5Ulg)N)r r)nxGraphG1add_nodes_from cycle_graphG2lollipop_graphG3selfs [/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/tests/test_efficiency.py setup_methodTestEfficiency.setup_methodsE((* y)..###Aq)cT[R"URSS5S:Xdeg)z. When nodes are disconnected, efficiency is 0 rrrN)r efficiencyr rs r"test_efficiency_disconnected_nodes1TestEfficiency.test_efficiency_disconnected_nodess#}}TWWa+q000rcP[R"UR5S:Xdeg)z- In a disconnected graph the efficiency is 0 rN)r local_efficiencyr rs r(test_local_efficiency_disconnected_graph7TestEfficiency.test_local_efficiency_disconnected_graphs!""477+q000rc[R"URSS5S:Xde[R"URSS5S:Xdeg)Nrrrg?)r rrrs rtest_efficiencyTestEfficiency.test_efficiencys@}}TWWa+q000}}TWWa+u444rcP[R"UR5S:Xdeg)Ng?)r global_efficiencyrrs rtest_global_efficiency%TestEfficiency.test_global_efficiency s##DGG,555rc[SS5H5n[R"U5n[R"U5S:XaM5e g)zH Tests that the average global efficiency of the complete graph is one. r rN)ranger complete_graphr%rnGs r%test_global_efficiency_complete_graph4TestEfficiency.test_global_efficiency_complete_graph#s=q"A!!!$A''*a/ //rc[SS5H5n[R"U5n[R"U5S:XaM5e g)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. r r)rN)r*r r+rr,s r$test_local_efficiency_complete_graph3TestEfficiency.test_local_efficiency_complete_graph+s= q"A!!!$A&&q)Q. ..rcP[R"UR5S:Xdeg)zp 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_graph#TestEfficiency.test_using_ego_graph5s! ""477+v555r)r rrN) __name__ __module__ __qualname____firstlineno__rrrr"r&r/r2r5__static_attributes__rrrrs**1 1 560/6rr)__doc__networkxr rr<rrr?sF4646r