Ë
|
?ñúh ã óB d Z ddlZddlmZ ddlmZmZ ddZddZd Z y) zg
|
altgraph.GraphUtil - Utility classes and functions
|
==================================================
|
é N)Údeque)ÚGraphÚ
|
GraphErrorc ó t j « }|s |r| | z }n| | dz
|
z }||kD r t d« t | « }|D ] }|j |« t j
|
|« }t j
|
|« } || k( r|s3|j || « |sH|j || « |j « |k\ r |S p)z
|
Generates and returns a :py:class:`~altgraph.Graph.Graph` instance with
|
*node_num* nodes randomly connected by *edge_num* edges.
|
é z1inconsistent arguments to 'generate_random_graph') r r ÚrangeÚadd_nodeÚrandomÚchoiceÚ edge_by_nodeÚadd_edgeÚnumber_of_edges)
|
Únode_numÚedge_numÚ
|
self_loopsÚ multi_edgesÚgÚ max_edgesÚnodesÚnodeÚheadÚtails
|
úEH:\Change_password\venv_build\Lib\site-packages\altgraph/GraphUtil.pyÚgenerate_random_graphr sÚ ô
|
Aá Ù Ø 8Ñ+Ià H¨q¡LÑ1Ià iÒ Ü Ð PÓQÐ Qä (OEàò Ø
|
|
4Õðð Ü}}UÓ#Ü}}UÓ#ð 4<¡
|
Ø ð >>$ Ó %Ð 1¹+Ø ð
|
|
|
4Ô Ø × Ñ Ó (Ò *Ø à Hð# ó c óv t j « }g }t |« D ]J }t |dz |« D ]6 }|j |« |j |« |j ||« 8 L t || |z « D ]¸ }|j |« |j |« |k rYt j |« } || k( r|s1|j || « r|sF|j || « |j |« |k rY|j |« D ]$ } |j |« |j | « & º |S )a
|
Generates and returns a :py:class:`~altgraph.Graph.Graph` instance that
|
will have *steps* \* *growth_num* nodes and a scale free (powerlaw)
|
connectivity. Starting with a fully connected graph with *growth_num*
|
nodes at every step *growth_num* nodes are added to the graph and are
|
connected to existing nodes with a probability proportional to the degree
|
of these existing nodes.
|
r )
|
r r Úappendr r Ú
|
out_degreer
|
r r Úout_nbrs)
|
ÚstepsÚ
|
growth_numr r ÚgraphÚstoreÚiÚjr Únbrs
|
r Úgenerate_scale_free_graphr' 5 s3 ô KKMEð EÜ :Ó ò !Üq1ujÓ)ò !AØ LLOØ LLOØ NN1aÕ ñ !ð!ô j %¨*Ñ"4Ó5ò Ø tÔ Ø× Ñ tÓ$ zÒ1Ü-- Ó&Cð s{¡:Øð ×!Ñ! $¨Ô,±[Øà NN4 Ô %ð × Ñ tÓ$ zÓ1ð >> $Ó'ò CØ LLÔ Ø LLÕ ñ ð ð& Lr c ó |ht « t « }}}t ||fg« }| j }| j }| j } |r|j « \ }
|
} || « } | $|D ] } | | « r |j | « n | }
|
|| « D ]J } | |« }|
|
| ur|j |
|
|f« ||vs'|j |« |j |
|
|f« L |r|D cg c] \ }}||vs ||f }}}|||fS c c}}w )aÄ
|
Perform a walk in a depth-first order starting
|
at *head*.
|
|
Returns (visited, removes, orphans).
|
|
* visited: the set of visited nodes
|
* removes: the list of nodes where the node
|
data does not all *filters*
|
* orphans: tuples of (last_good, node),
|
where node is not in removes, is directly
|
reachable from a node in *removes* and
|
*last_good* is the closest upstream node that is not
|
in *removes*.
|
)Úsetr Ú node_dataÚ out_edgesr ÚpopÚaddr )r" r ÚfiltersÚvisitedÚremovesÚorphansÚstackÚget_dataÚ get_edgesÚget_tailÚ last_goodr ÚdataÚfiltfuncÚedger ÚlgÚtls r Ú filter_stackr< ` s% ð" "& ¬«¬s«ugWGÜ D$<.Ó !EØHØIØzzHá
|
Ø ))+ 4Ù~Ø Ð Ø #ò !Ù ~ØKK Ô%Ùð !ð
|
! Ù dOò 0DÙD>DØ Ñ$Ø Y¨Ð -Ô.Ø7Ò"Ø DÔ!Ø i¨Ð .Õ/ð 0ò ð$ )0×EHR °2¸WÒ3DBxÐEGÑEà GWÐ $Ð$ùó Fs Ã* DÃ7D)FF)
|
Ú__doc__r
|
Ú collectionsr Úaltgraphr r r r' r< © r r ú<module>rA s& ðñó
|
Ý ç &ó& óR(óV+%r
|
