ó ú£Õ\c@sëdZddlZdZdddddd gZd d „Zd d d „Zdd d d„Zd ddddd d„Z e Z d dddd„Z d dddd„Z d dd d„Z d d„Zd d„Zd d„Zd„ZdS(sF ****** Layout ****** Node positioning algorithms for graph drawing. iÿÿÿÿNs?Aric Hagberg (hagberg@lanl.gov) Dan Schult(dschult@colgate.edu)tcircular_layoutt random_layoutt shell_layoutt spring_layouttspectral_layouttfruchterman_reingold_layouticCsyyddl}Wntk r/tdƒ‚nXt|ƒ}|j|jj||fƒd|jƒ}tt||ƒƒS(sJPosition nodes uniformly at random in the unit square. For every node, a position is generated by choosing each of dim coordinates uniformly at random on the interval [0.0, 1.0). NumPy (http://scipy.org) is required for this function. Parameters ---------- G : NetworkX graph A position will be assigned to every node in G. dim : int Dimension of layout. Returns ------- dict : A dictionary of positions keyed by node Examples -------- >>> G = nx.lollipop_graph(4, 3) >>> pos = nx.random_layout(G) iÿÿÿÿNs2random_layout() requires numpy: http://scipy.org/ tdtype(tnumpyt ImportErrortlentasarraytrandomtfloat32tdicttzip(tGtdimtnptntpos((sO/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/drawing/layout.pyRs  *icCsüyddl}Wntk r/tdƒ‚nXt|ƒdkrFiSt|ƒdkrqid ||jƒd6S|jdd|jd|jt|ƒd|jƒ}|j|j|j |ƒ|j |ƒgƒƒ}t |d|ƒ}t t ||ƒƒS( sPosition nodes on a circle. Parameters ---------- G : NetworkX graph dim : int Dimension of layout, currently only dim=2 is supported scale : float Scale factor for positions Returns ------- dict : A dictionary of positions keyed by node Examples -------- >>> G=nx.path_graph(4) >>> pos=nx.circular_layout(G) Notes ------ This algorithm currently only works in two dimensions and does not try to minimize edge crossings. iÿÿÿÿNs4circular_layout() requires numpy: http://scipy.org/ iig@Rtscale(i(RRR tnodestarangetpiR t transposetarraytcostsint_rescale_layoutR R(RRRRttR((sO/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/drawing/layout.pyR;s 60c Cs]yddl}Wntk r/tdƒ‚nXt|ƒdkrFiSt|ƒdkrqid ||jƒd6S|dkr|jƒg}nt|dƒdkr®d}nd}i}xœ|D]”}|jdd|jd|jt|ƒd |jƒ}|j|j ||j |ƒ||j |ƒgƒƒ} |j t || ƒƒ|d7}qÁW|S( svPosition nodes in concentric circles. Parameters ---------- G : NetworkX graph nlist : list of lists List of node lists for each shell. dim : int Dimension of layout, currently only dim=2 is supported scale : float Scale factor for positions Returns ------- dict : A dictionary of positions keyed by node Examples -------- >>> G=nx.path_graph(4) >>> shells=[[0],[1,2,3]] >>> pos=nx.shell_layout(G,shells) Notes ------ This algorithm currently only works in two dimensions and does not try to minimize edge crossings. iÿÿÿÿNs1shell_layout() requires numpy: http://scipy.org/ iiggð?g@R(i(RRR RtNoneRRR RRRRtupdateR( RtnlistRRRtradiustnposRRR((sO/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/drawing/layout.pyRfs(!    68i2tweightcCsýyddl}Wntk r/tdƒ‚nX|dk r†tt|tt|ƒƒƒƒ}|jg|D]} || ^qjƒ}n|dk rÿ|j|jjt|ƒ|fƒƒ} xIt |ƒD]2\} } | |krÆ|j|| ƒ| | >> G=nx.path_graph(4) >>> pos=nx.spring_layout(G) # The same using longer function name >>> pos=nx.fruchterman_reingold_layout(G) iÿÿÿÿNs@fruchterman_reingold_layout() requires numpy: http://scipy.org/ iiiôR#R(i(RRRR RtrangeR R R t enumerateRt ValueErrortnxtto_scipy_sparse_matrixt_sparse_fruchterman_reingoldtto_numpy_matrixt_fruchterman_reingoldR(RRRtfixedt iterationsR#RRtnfixedtvtpos_arrtiRtA((sO/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/drawing/layout.pyR¢s8.  !) ' !  cCs£yddl}Wntk r/tdƒ‚nXy|j\}}Wn tk retjdƒ‚nX|j|ƒ}|dkr®|j|jj||fƒd|j ƒ}n|j |j ƒ}|j d|ƒ}d} | t |dƒ} |j |jd|jd|jdfd|j ƒ} xyt|ƒD]k} xat|jdƒD]L} |dd…| df|dd…| f| dd…dd…| f_sparse_fruchterman_reingold() scipy numpy: http://scipy.org/ Rgð?gš™™™™™¹?iiiR3g{®Gáz„?(RRR4R5R'R6t scipy.sparseRGRHttolilRR R RR7R8R9R:R$tTR;R<t getrowviewttoarray(R2RRR,R-RR=R>RGRHR?RR@RDRBR1RARCtAiRE((sO/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/drawing/layout.pyR)1sT     -    2cCs´yddl}Wntk r/tdƒ‚nXt|ƒdkrÇt|ƒdkrf|jgƒ}nNt|ƒdkr“|jddggƒ}n!|jddgddggƒ}tt||ƒƒSykt|ƒdkråt‚ntj|d |d d ƒ}|j ƒr"||j |ƒ}nt ||ƒ}Wn]ttfk r‘tj |d |ƒ}|j ƒr||j |ƒ}nt ||ƒ}nXt||ƒ}tt||ƒƒS( sPosition nodes using the eigenvectors of the graph Laplacian. Parameters ---------- G : NetworkX graph dim : int Dimension of layout weight : string or None optional (default='weight') The edge attribute that holds the numerical value used for the edge weight. If None, then all edge weights are 1. scale : float Scale factor for positions Returns ------- dict : A dictionary of positions keyed by node Examples -------- >>> G=nx.path_graph(4) >>> pos=nx.spectral_layout(G) Notes ----- Directed graphs will be considered as unidrected graphs when positioning the nodes. For larger graphs (>500 nodes) this will use the SciPy sparse eigenvalue solver (ARPACK). iÿÿÿÿNs4spectral_layout() requires numpy: http://scipy.org/ iiigà?iôR#Rtf(RRR RR RR&R'R(t is_directedRt_sparse_spectralR*t _spectralR(RRR#RRRR2((sO/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/drawing/layout.pyRxs2$ !   c Csÿyddl}Wntk r/tdƒ‚nXy|j\}}Wn tk retjdƒ‚nX|j|ƒ}|j|d|jƒ}||j |ddƒ}||}|j j |ƒ\}} |j |ƒd|d!} |j | dd…| fƒS(Niÿÿÿÿs4spectral_layout() requires numpy: http://scipy.org/ s-spectral() takes an adjacency matrix as inputRR3i(RRR4R5R'R6R tidentityRR;tlinalgteigtargsorttreal( R2RRR=R>tItDtLt eigenvaluest eigenvectorstindex((sO/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/drawing/layout.pyRR½s     cCsoy ddl}ddlm}Wntk r?tdƒ‚nXyddlm}Wn!tk rwddlm}nXy|j\}}Wn t k r­t j dƒ‚nX|j |j ddƒjƒ}||d ||ƒ}||} |d} td | dt|j|ƒƒƒ} || | d d d | ƒ\} } |j| ƒd| !}|j| dd…|fƒS(Niÿÿÿÿ(RGs=_sparse_spectral() requires scipy & numpy: http://scipy.org/ (teigsh(teigen_symmetrics4sparse_spectral() takes an adjacency matrix as inputR3iiitwhichtSMtncv(RRIRGRtscipy.sparse.linalg.eigenR^tscipy.sparse.linalgR_R4R5R'R6R R;RKtmaxtintR8RVRW(R2RRRGR^R=R>tdataRYRZR?RbR[R\R]((sO/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/drawing/layout.pyRQÖs,       &!cCs½d}xrt|jdƒD]]}|dd…|fc|dd…|fjƒ8s2   $+< K=GE  "