OhBdZddlZddlmZddlmZmZddZddZdZ y) zg altgraph.GraphUtil - Utility classes and functions ================================================== N)deque)Graph GraphErrorctj}|s |r||z}n||dz z}||kDr tdt|}|D]}|j| t j |}t j |} || k(r|s3|j || |sH|j|| |j|k\r |Sp)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') rrrangeadd_noderandomchoice edge_by_nodeadd_edgenumber_of_edges) node_numedge_num self_loops multi_edgesg max_edgesnodesnodeheadtails d/mnt/c/Users/Administrator/Desktop/help_/test_env/lib/python3.12/site-packages/altgraph/GraphUtil.pygenerate_random_graphr s  A   8+I HqL1I i PQ Q (OE 4 }}U#}}U# 4<  >>$ % 1+  4   ( *  H# cvtj}g}t|D]J}t|dz|D]6}|j||j||j||8Lt|||zD]}|j ||j ||krYt j|} || k(r|s1|j|| r|sF|j|| |j ||krY|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) rrappendr r out_degreer r r out_nbrs) steps growth_numrrgraphstoreijrnbrs rgenerate_scale_free_graphr'5s3 KKME E : !q1uj) !A LLO LLO NN1a  !!j%*"45 tt$z1--&Cs{:!!$,[ NN4 %t$z1>>$' C LL  LL  & Lrc|htt}}}t||fg}|j}|j}|j} |r|j \} } || } | $|D]} | | r |j | n| } || D]J}| |}| | ur|j | |f||vs'|j ||j| |fL|r|Dcgc]\}}||vs ||f}}}|||fScc}}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_edgesrpopaddr)r"rfiltersvisitedremovesorphansstackget_data get_edgesget_tail last_goodrdatafiltfuncedgerlgtls r filter_stackr<`s%""&sugWG D$<. !EHIzzH ))+ 4~  # !~KK% ! ! dO 0DD>D$ Y-.7" D! i./  0 $)0EHR2W3DBxEGE GW $$Fs * D7D)FF) __doc__r collectionsraltgraphrrrr'r<rrrAs& && R(V+%r