hSrSSKrSSKJrJr SSKJr S/r\"S5\R"SSS 0S S 9S S j55r g)zRFunctions for generating stochastic graphs from a given weighted directed graph. N)DiGraph MultiDiGraph)not_implemented_forstochastic_graph undirectedweightznot copyT) edge_attrs mutates_input returns_graphcFU(a+UR5(a [U5O [U5n[UR US95nUR SS9H-upEnX4S:XaSXb'MUR US5X4- Xb'M/ [R"U5 U$)aReturns a right-stochastic representation of directed graph `G`. A right-stochastic graph is a weighted digraph in which for each node, the sum of the weights of all the out-edges of that node is 1. If the graph is already weighted (for example, via a 'weight' edge attribute), the reweighting takes that into account. Parameters ---------- G : directed graph A :class:`~networkx.DiGraph` or :class:`~networkx.MultiDiGraph`. copy : boolean, optional If this is True, then this function returns a new graph with the stochastic reweighting. Otherwise, the original graph is modified in-place (and also returned, for convenience). weight : edge attribute key (optional, default='weight') Edge attribute key used for reading the existing weight and setting the new weight. If no attribute with this key is found for an edge, then the edge weight is assumed to be 1. If an edge has a weight, it must be a positive number. )rT)datarr ) is_multigraphrrdict out_degreeedgesgetnx _clear_cache)Gcopyrdegreeuvds P/var/www/html/env/lib/python3.13/site-packages/networkx/generators/stochastic.pyrr s:  00LOgaj!,,f,- .F777%a 9>AIfa(694AI & OOA H)Tr) __doc__networkxrnetworkx.classesrrnetworkx.utilsr__all__ _dispatchablerrrr%sT 2.  \" Ad% #% r