ó ú£Õ\c@s=dZddlZdZdgZddd„Zd„ZdS(s Spectral bipartivity measure. iÿÿÿÿNsAric Hagberg (hagberg@lanl.gov)tspectral_bipartivitytweightc Cs"yddl}Wn tk r2tddƒ‚nX|jƒ}tj||d|ƒ}|jj|ƒ}|jj| ƒ}d||}|dkr¶|jƒj ƒ|jƒj ƒSt t |t t |ƒƒƒƒ} i} x:|D]2} | | } || | f|| | f| | >> from networkx.algorithms import bipartite >>> G = nx.path_graph(4) >>> bipartite.spectral_bipartivity(G) 1.0 Notes ----- This implementation uses Numpy (dense) matrices which are not efficient for storing large sparse graphs. See Also -------- color References ---------- .. [1] E. Estrada and J. A. Rodríguez-Velázquez, "Spectral measures of bipartivity in complex networks", PhysRev E 72, 046105 (2005) iÿÿÿÿNs'spectral_bipartivity() requires SciPy: shttp://scipy.org/Rgà?(t scipy.linalgt ImportErrortnodestnxtto_numpy_matrixtlinalgtexpmtNonetdiagonaltsumtdicttziptrangetlen( tGRRtscipytnodelisttAtexpAtexpmAtcoshAtindextsbtnti((s^/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/bipartite/spectral.pyRs$)     !  &cCs`ddlm}yddl}Wn|dƒ‚nXyddl}Wn|dƒ‚nXdS(sFixture for nose tests.iÿÿÿÿ(tSkipTestNsNumPy not availablesSciPy not available(tnoseRtnumpyR(tmoduleRRR((s^/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/bipartite/spectral.pyt setup_moduleNs(t__doc__tnetworkxRt __author__t__all__R RR(((s^/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/bipartite/spectral.pyts   ?