iFSrSSKrSSKJr SSKJrJr SSjrSSjrSr g) zg altgraph.GraphUtil - Utility classes and functions ================================================== N)deque)Graph GraphErrorc[R"5nU(d#U(aX-nOXS- -nX:a [S5e[U5nUHnURU5 M [R "U5n[R "U5n X:Xa U(dM;UR X5b U(dMVURX5 UR5U:aU$M)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 ?C:\des-py\RoboSAPF\venv\Lib\site-packages\altgraph\GraphUtil.pygenerate_random_graphr s  A   +I qL1I  PQ Q (OE 4 }}U#}}U# <  >>$ % 1+  4   ( *  H# c[R"5n/n[U5HLn[US-U5H6nURU5 URU5 URXg5 M8 MN [XU-5HnUR U5 UR U5U:ak[ R"U5n X:Xa U(dM9URX5(a U(dMXURX5 UR U5U:aMkURU5H%n URU5 URU 5 M' M U$)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'5s KKME E : q1uj)A LLO LLO NN1 *j*"45 tt$z1--&C{:!!$,,[ NN4 %t$z1>>$'C LL  LL (6& LrcDU1[5[5pTn[X4/5nURnURnURn U(aUR 5upU"U 5n U b+UH#n U "U 5(aMUR U 5 O U n U"U 5HKnU "U5nXLaUR X45 X;dM(UR U5 URX45 MM U(aMUVVs/sHunnUU;dMUU4PM nnnX4U4$s snnf)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""&sugG D<. !EHIzzH ))+ ~  #~~KK%$ ! dODD>D$ Y-." D! i./ $ %$)0EHR2W3DxBxGE W $$Fs < D D)FF) __doc__r collectionsraltgraphrrrr'r<rrrAs& && R(V+%r