U ?hf@sdZddlZGdddZdS)z@Unit tests for the :mod:`networkx.algorithms.efficiency` module.Nc@sLeZdZddZddZddZddZd d Zd d Zd dZ ddZ dS)TestEfficiencycCs:t|_|jdddgtd|_tdd|_dS)N)nxZGraphG1Zadd_nodes_fromZ cycle_graphG2Zlollipop_graphG3selfr [/var/www/html/venv/lib/python3.8/site-packages/networkx/algorithms/tests/test_efficiency.py setup_methods  zTestEfficiency.setup_methodcCst|jdddkstdS)z> When nodes are disconnected, efficiency is 0 rrrN)r efficiencyrAssertionErrorr r r r"test_efficiency_disconnected_nodessz1TestEfficiency.test_efficiency_disconnected_nodescCst|jdkstdS)z= In a disconnected graph the efficiency is 0 rN)rlocal_efficiencyrrr r r r(test_local_efficiency_disconnected_graphsz7TestEfficiency.test_local_efficiency_disconnected_graphcCs4t|jdddkstt|jdddks0tdS)Nrrrg?)rrr rr r r rtest_efficiencyszTestEfficiency.test_efficiencycCst|jdkstdS)Ng?)rglobal_efficiencyr rr r r rtest_global_efficiency sz%TestEfficiency.test_global_efficiencycCs0tddD] }t|}t|dks tq dS)zX Tests that the average global efficiency of the complete graph is one. r rN)rangercomplete_graphrrr nGr r r%test_global_efficiency_complete_graph#s z4TestEfficiency.test_global_efficiency_complete_graphcCs0tddD] }t|}t|dks tq dS)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. rrrN)rrrrrrr r r$test_local_efficiency_complete_graph+s z3TestEfficiency.test_local_efficiency_complete_graphcCst|jdkstdS)z Test that the ego graph is used when computing local efficiency. For more information, see GitHub issue #2710. g?N)rrr rr r r rtest_using_ego_graph5sz#TestEfficiency.test_using_ego_graphN) __name__ __module__ __qualname__rrrrrrrr r r r rrs  r)__doc__Znetworkxrrr r r rs